Unobstructed shortest paths in polyhedral environments:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Berlin u.a.
Springer
1987
|
| Schriftenreihe: | Lecture notes in computer science
251 |
| Schlagworte: | |
| Beschreibung: | 103 S. |
| ISBN: | 3540176292 0387176292 |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV000832866 | ||
| 003 | DE-604 | ||
| 007 | t| | ||
| 008 | 881108s1987 xx |||| 00||| eng d | ||
| 020 | |a 3540176292 |9 3-540-17629-2 | ||
| 020 | |a 0387176292 |9 0-387-17629-2 | ||
| 035 | |a (OCoLC)260133540 | ||
| 035 | |a (DE-599)BVBBV000832866 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-12 |a DE-91G |a DE-384 |a DE-703 |a DE-739 |a DE-20 |a DE-706 |a DE-83 |a DE-19 |a DE-188 |a DE-11 | ||
| 050 | 0 | |a QA75 | |
| 050 | 0 | |a TJ211 | |
| 082 | 0 | |a 629.8/92 |2 19 | |
| 084 | |a DAT 537d |2 stub | ||
| 100 | 1 | |a Akman, Varol |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Unobstructed shortest paths in polyhedral environments |
| 264 | 1 | |a Berlin u.a. |b Springer |c 1987 | |
| 300 | |a 103 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Lecture notes in computer science |v 251 | |
| 650 | 4 | |a Algorithmes | |
| 650 | 7 | |a FINDPATH |2 inriac | |
| 650 | 4 | |a Robotique | |
| 650 | 7 | |a algorithme non numérique |2 inriac | |
| 650 | 7 | |a chemin graphe |2 inriac | |
| 650 | 7 | |a chemin optimal |2 inriac | |
| 650 | 7 | |a diagramme Voronoï |2 inriac | |
| 650 | 7 | |a polyèdre convexe |2 inriac | |
| 650 | 7 | |a robotique |2 inriac | |
| 650 | 4 | |a Algorithms | |
| 650 | 4 | |a Polyhedral functions | |
| 650 | 4 | |a Robotics | |
| 650 | 0 | 7 | |a Kürzester-Weg-Problem |0 (DE-588)4138403-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Polyeder |0 (DE-588)4132101-7 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Polyedergebiet |0 (DE-588)4175160-7 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Polyedergebiet |0 (DE-588)4175160-7 |D s |
| 689 | 0 | 1 | |a Kürzester-Weg-Problem |0 (DE-588)4138403-9 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Polyeder |0 (DE-588)4132101-7 |D s |
| 689 | 1 | 1 | |a Kürzester-Weg-Problem |0 (DE-588)4138403-9 |D s |
| 689 | 1 | |5 DE-604 | |
| 830 | 0 | |a Lecture notes in computer science |v 251 |w (DE-604)BV000000607 |9 251 | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-000523000 | |
Datensatz im Suchindex
| _version_ | 1820874836901101568 |
|---|---|
| adam_text | |
| any_adam_object | |
| author | Akman, Varol |
| author_facet | Akman, Varol |
| author_role | aut |
| author_sort | Akman, Varol |
| author_variant | v a va |
| building | Verbundindex |
| bvnumber | BV000832866 |
| callnumber-first | Q - Science |
| callnumber-label | QA75 |
| callnumber-raw | QA75 TJ211 |
| callnumber-search | QA75 TJ211 |
| callnumber-sort | QA 275 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | SS 4800 |
| classification_tum | DAT 537d |
| ctrlnum | (OCoLC)260133540 (DE-599)BVBBV000832866 |
| dewey-full | 629.8/92 |
| dewey-hundreds | 600 - Technology (Applied sciences) |
| dewey-ones | 629 - Other branches of engineering |
| dewey-raw | 629.8/92 |
| dewey-search | 629.8/92 |
| dewey-sort | 3629.8 292 |
| dewey-tens | 620 - Engineering and allied operations |
| discipline | Informatik Mess-/Steuerungs-/Regelungs-/Automatisierungstechnik / Mechatronik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 cb4500</leader><controlfield tag="001">BV000832866</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">881108s1987 xx |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3540176292</subfield><subfield code="9">3-540-17629-2</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0387176292</subfield><subfield code="9">0-387-17629-2</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)260133540</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV000832866</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-12</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-20</subfield><subfield code="a">DE-706</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-19</subfield><subfield code="a">DE-188</subfield><subfield code="a">DE-11</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA75</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">TJ211</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">629.8/92</subfield><subfield code="2">19</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 537d</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Akman, Varol</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Unobstructed shortest paths in polyhedral environments</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin u.a.</subfield><subfield code="b">Springer</subfield><subfield code="c">1987</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">103 S.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Lecture notes in computer science</subfield><subfield code="v">251</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithmes</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">FINDPATH</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Robotique</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">algorithme non numérique</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">chemin graphe</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">chemin optimal</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">diagramme Voronoï</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">polyèdre convexe</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">robotique</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Polyhedral functions</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Robotics</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Kürzester-Weg-Problem</subfield><subfield code="0">(DE-588)4138403-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Polyeder</subfield><subfield code="0">(DE-588)4132101-7</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Polyedergebiet</subfield><subfield code="0">(DE-588)4175160-7</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Polyedergebiet</subfield><subfield code="0">(DE-588)4175160-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Kürzester-Weg-Problem</subfield><subfield code="0">(DE-588)4138403-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Polyeder</subfield><subfield code="0">(DE-588)4132101-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="1"><subfield code="a">Kürzester-Weg-Problem</subfield><subfield code="0">(DE-588)4138403-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Lecture notes in computer science</subfield><subfield code="v">251</subfield><subfield code="w">(DE-604)BV000000607</subfield><subfield code="9">251</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-000523000</subfield></datafield></record></collection> |
| id | DE-604.BV000832866 |
| illustrated | Not Illustrated |
| indexdate | 2025-01-10T15:06:05Z |
| institution | BVB |
| isbn | 3540176292 0387176292 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-000523000 |
| oclc_num | 260133540 |
| open_access_boolean | |
| owner | DE-12 DE-91G DE-BY-TUM DE-384 DE-703 DE-739 DE-20 DE-706 DE-83 DE-19 DE-BY-UBM DE-188 DE-11 |
| owner_facet | DE-12 DE-91G DE-BY-TUM DE-384 DE-703 DE-739 DE-20 DE-706 DE-83 DE-19 DE-BY-UBM DE-188 DE-11 |
| physical | 103 S. |
| publishDate | 1987 |
| publishDateSearch | 1987 |
| publishDateSort | 1987 |
| publisher | Springer |
| record_format | marc |
| series | Lecture notes in computer science |
| series2 | Lecture notes in computer science |
| spelling | Akman, Varol Verfasser aut Unobstructed shortest paths in polyhedral environments Berlin u.a. Springer 1987 103 S. txt rdacontent n rdamedia nc rdacarrier Lecture notes in computer science 251 Algorithmes FINDPATH inriac Robotique algorithme non numérique inriac chemin graphe inriac chemin optimal inriac diagramme Voronoï inriac polyèdre convexe inriac robotique inriac Algorithms Polyhedral functions Robotics Kürzester-Weg-Problem (DE-588)4138403-9 gnd rswk-swf Polyeder (DE-588)4132101-7 gnd rswk-swf Polyedergebiet (DE-588)4175160-7 gnd rswk-swf Polyedergebiet (DE-588)4175160-7 s Kürzester-Weg-Problem (DE-588)4138403-9 s DE-604 Polyeder (DE-588)4132101-7 s Lecture notes in computer science 251 (DE-604)BV000000607 251 |
| spellingShingle | Akman, Varol Unobstructed shortest paths in polyhedral environments Lecture notes in computer science Algorithmes FINDPATH inriac Robotique algorithme non numérique inriac chemin graphe inriac chemin optimal inriac diagramme Voronoï inriac polyèdre convexe inriac robotique inriac Algorithms Polyhedral functions Robotics Kürzester-Weg-Problem (DE-588)4138403-9 gnd Polyeder (DE-588)4132101-7 gnd Polyedergebiet (DE-588)4175160-7 gnd |
| subject_GND | (DE-588)4138403-9 (DE-588)4132101-7 (DE-588)4175160-7 |
| title | Unobstructed shortest paths in polyhedral environments |
| title_auth | Unobstructed shortest paths in polyhedral environments |
| title_exact_search | Unobstructed shortest paths in polyhedral environments |
| title_full | Unobstructed shortest paths in polyhedral environments |
| title_fullStr | Unobstructed shortest paths in polyhedral environments |
| title_full_unstemmed | Unobstructed shortest paths in polyhedral environments |
| title_short | Unobstructed shortest paths in polyhedral environments |
| title_sort | unobstructed shortest paths in polyhedral environments |
| topic | Algorithmes FINDPATH inriac Robotique algorithme non numérique inriac chemin graphe inriac chemin optimal inriac diagramme Voronoï inriac polyèdre convexe inriac robotique inriac Algorithms Polyhedral functions Robotics Kürzester-Weg-Problem (DE-588)4138403-9 gnd Polyeder (DE-588)4132101-7 gnd Polyedergebiet (DE-588)4175160-7 gnd |
| topic_facet | Algorithmes FINDPATH Robotique algorithme non numérique chemin graphe chemin optimal diagramme Voronoï polyèdre convexe robotique Algorithms Polyhedral functions Robotics Kürzester-Weg-Problem Polyeder Polyedergebiet |
| volume_link | (DE-604)BV000000607 |
| work_keys_str_mv | AT akmanvarol unobstructedshortestpathsinpolyhedralenvironments |