Unobstructed Shortest Paths in Polyhedral Environments

Varol Akman

ISBN 10: 3540176292 / ISBN 13: 9783540176299

Editore: Springer Berlin Heidelberg, 1987

Riguardo questo articolo

Druck auf Anfrage Neuware - Printed after ordering - 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.

Codice articolo 9783540176299

Dati bibliografici

• Titolo: Unobstructed Shortest Paths in Polyhedral Environments
• Editore: Springer Berlin Heidelberg
• Data di pubblicazione: 1987
• Lingua: Inglese
• ISBN 10: 3540176292
• ISBN 13: 9783540176299
• Rilegatura: Taschenbuch
• Condizione: Neu
• Dimensioni: 235 L x 155 A x 7 P (millimetri) 235 millimetri di larghezza per 155 millimetri di altezza per 7 millimetri di profondità
• Peso: 189 grammi

Descrizione articolo

Riassunto

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.

Contenuti

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.