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...
Spremljeno u:
| Glavni autor: | |
|---|---|
| Format: | Livre numérique |
| Jezik: | Anglais |
| Izdano: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Serija: | Lecture notes in computer science
251 |
| Teme: | |
| Online pristup: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Bilješka: |
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 |
Sadržaj:
- 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.