Unobstructed shortest paths in polyhedral environments
Αποθηκεύτηκε σε:
| Κύριος συγγραφέας: | |
|---|---|
| Μορφή: | Βιβλίο |
| Γλώσσα: | English |
| Δημοσίευση: |
Berlin :
Springer-Verlag,
c1987
|
| Σειρά: | Lecture notes in computer science ;
; 251 |
| Θέματα: | |
| Ετικέτες: |
Προσθήκη ετικέτας
Δεν υπάρχουν, Καταχωρήστε ετικέτα πρώτοι!
|
MARC
| LEADER | 00000nam a2200000 i 4500 | ||
|---|---|---|---|
| 001 | 1/26900 | ||
| 008 | 941103s1987 eng d | ||
| 020 | |a 3-540-17629-2 | ||
| 035 | |a 1991 |l 10037695 | ||
| 040 | |a GR-MY-UA |b gre |e aacr | ||
| 041 | 0 | |a eng | |
| 082 | 0 | |a 629.892 | |
| 100 | 1 | |a Akman, Varol. | |
| 245 | 1 | 0 | |a Unobstructed shortest paths in polyhedral environments / |c Varol Akman |
| 260 | |a Berlin : |b Springer-Verlag, |c c1987 | ||
| 300 | |a 103 p.; |c 25 cm. | ||
| 490 | 1 | |a Lecture notes in computer science |v ; 251 | |
| 500 | |a Includes bibliography | ||
| 650 | 0 | 0 | |a Polyhedral functions. |
| 650 | 0 | 0 | |a Robotics. |
| 650 | 0 | 0 | |a Algorithms. |
| 830 | 0 | |a Lecture notes in computer science ; |v ; 251 | |
| 852 | |a INST |b SAMOS |e 19941103 |h 629.892 AKM |p 005300003469 |q 005300003469 |t BK |y 0 | ||
| 909 | |a Σ |b 021711 | ||