Unobstructed shortest paths in polyhedral environments
Presents algebraic and geometric algorithms to deal with a specific problem, which frequently occurs in model-based robotics systems and is of utmost importance in calibrating the complexity of robotics tasks in general. The algorithms are based on several ideas from areas such as elimination theory...
Gardado en:
| Autor Principal: | |
|---|---|
| Formato: | Livre numérique |
| Idioma: | Anglais |
| Publicado: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Series: | Lecture notes in computer science
251 |
| Sujets: | |
| Acceso en liña: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Nota: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Unobstructed shortest paths in polyhedral environments, Varol Akman, 1987, Berlin, Springer-Verlag, 1 vol. ([8]-103 p., Lecture notes in computer science, 3-540-17629-2 • Unobstructed Shortest Paths in Polyhedral Environments, Texte imprimé, 9783662175439 |
| LEADER | 02842nam a22003977a 4500 | ||
|---|---|---|---|
| 001 | 944343 | ||
| 008 | 110927q2000 xxe ||| |||| 00| 0 eng d | ||
| 009 | PPN155184741 | ||
| 020 | |a 9783540477310 (PDF) | ||
| 041 | 0 | |a eng | |
| 082 | |a 629.892 | ||
| 082 | |a 004 | ||
| 100 | 1 | |a Akman, Varol, |d 1957- | |
| 245 | 1 | 0 | |a Unobstructed shortest paths in polyhedral environments |c Varol Akman. |
| 260 | |a Berlin [etc.] : |b Springer. | ||
| 260 | |a Cham : |b Springer Nature, |c [20..]. | ||
| 490 | 0 | |a Lecture notes in computer science |v 251 |x 1611-3349 | |
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 505 | 0 | |a Solution of the general instance of FINDPATH -- Solutions of two specific instances of FINDPATH -- Two Voronoi-based techniques for FINDPATH -- Desirable functionalities of a geometer's workbench -- Conclusion and future work. | |
| 506 | |a Accès en ligne pour les établissements français bénéficiaires des licences nationales | ||
| 506 | |a Accès soumis à abonnement pour tout autre établissement | ||
| 506 | |a Conditions particulières de réutilisation pour les bénéficiaires des licences nationales. https://www.licencesnationales.fr/springer-nature-ebooks-contrat-licence-ln-2017 | ||
| 520 | |a Presents algebraic and geometric algorithms to deal with a specific problem, which frequently occurs in model-based robotics systems and is of utmost importance in calibrating the complexity of robotics tasks in general. The algorithms are based on several ideas from areas such as elimination theory, optimization, polyhedral theory and Voronoi diagrams. The algorithms were also implemented in a Lisp in a workbench to allow experimentation with shortest path problems. | ||
| 650 | |a Informatique | ||
| 650 | |a Algorithmes | ||
| 650 | |a Simulation par ordinateur | ||
| 650 | |a Intelligence artificielle | ||
| 650 | |a Robotique | ||
| 776 | 0 | |0 020168896 |t Unobstructed shortest paths in polyhedral environments |f Varol Akman |d 1987 |c Berlin |n Springer-Verlag |p 1 vol. ([8]-103 p. |s Lecture notes in computer science |z 3-540-17629-2 | |
| 776 | 0 | |t Unobstructed Shortest Paths in Polyhedral Environments |b Texte imprimé |z 9783662175439 | |
| 856 | 4 | |q PDF |u https://doi.org/10.1007/3-540-17629-2 |z Accès sur la plateforme de l'éditeur | |
| 856 | 4 | |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-LHSRN47X-3 |z Accès sur la plateforme Istex | |
| 856 | 4 | |5 452349901:747920524 |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/3-540-17629-2 |z Accès Université d'Orléans | |
| 856 | 4 | |5 180339901:750932996 |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/3-540-17629-2 |z Accès INSA CVL | |
| 997 | |0 944343 |1 Livre numérique |a Ressource numérique |b INSA |b ENSA |c 0/Bibliothèque numérique/ |c 1/Bibliothèque numérique/Autre ressource numérique/ | ||