Unobstructed Shortest Paths in Polyhedral Environments

1987
ISBN: 978-3-540-17629-9
Verlag: Springer Berlin Heidelberg

Buch, Englisch, Band 251, 106 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 189 g

Reihe: Lecture Notes in Computer Science

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.

Zielgruppe

Research

Autoren/Hrsg.

Akman, Varol

Fachgebiete

• Mathematik | Informatik EDV | Informatik Informatik Künstliche Intelligenz Wissensbasierte Systeme, Expertensysteme
• Technische Wissenschaften Elektronik | Nachrichtentechnik Elektronik Robotik
• Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Grafikprogrammierung

Inhaltsverzeichnis

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.