Varol Akman

Unobstructed Shortest Paths in Polyhedral Environments

• Broschiertes Buch

Produktbeschreibung

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.

---

Hinweis: Dieser Artikel kann nur an eine deutsche Lieferadresse ausgeliefert werden.

Produktdetails

• Lecture Notes in Computer Science 251
• Verlag: Springer / Springer Berlin Heidelberg / Springer, Berlin
• Artikelnr. des Verlages: 978-3-540-17629-9
• 2000.
• Seitenzahl: 116
• Erscheinungstermin: 11. März 1987
• Englisch
• Abmessung: 235mm x 155mm x 7mm
• Gewicht: 189g
• ISBN-13: 9783540176299
• ISBN-10: 3540176292
• Artikelnr.: 09250993

Inhaltsangabe

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.