Unobstructed Shortest Paths in Polyhedral Environments (Lecture Notes in Computer Science)

Akman, Varol

ISBN 10: 3540176292 / ISBN 13: 9783540176299

Editore: Springer, 1987

Riguardo questo articolo

We are unable to ship to Canada at this time.0387176292 Ex-library paperback in very nice condition with the usual markings and attachments.

Codice articolo DA1411404

Dati bibliografici

• Titolo: Unobstructed Shortest Paths in Polyhedral Environments (Lecture Notes in Computer Science)
• Editore: Springer
• Data di pubblicazione: 1987
• Lingua: Inglese
• ISBN 10: 3540176292
• ISBN 13: 9783540176299
• Rilegatura: Paperback
• Condizione: Very Good
• Peso: 14 once

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.