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, optimization, polyhedral theory and Voronoi diagrams. The algorithms were also implemented in a Lisp in a workbench to allow experimentation with shortest path problems.

List of contents

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.

Product details

• Authors: Varol Akman
• Publisher: Springer, Berlin
• Languages: English
• Product format: Paperback / Softback
• Released: 01.01.1987
• EAN: 9783540176299
• ISBN: 978-3-540-17629-9
• No. of pages: 103
• Weight: 195 g
• Series: Lecture Notes in Computer Science; Lecture Notes in Computer Science
• Subject: Natural sciences, medicine, IT, technology > IT, data processing > Application software