Unobstructed Shortest Paths in Polyhedral Environments: 251 - Brossura

Akman, Varol

Brossura

ISBN 10: 3540176292 ISBN 13: 9783540176299

Casa editrice: Springer, 2008

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.

Su questo libro

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.

Dettagli dell'edizione

• Editore: Springer
• Data di pubblicazione: 2008
• Lingua: Inglese
• ISBN 10: 3540176292
• ISBN 13: 9783540176299
• Rilegatura: Copertina flessibile
• Numero di pagine: 116
• Contatto del produttore: non disponibile
• Persona responsabile: CMN Printpool Inh. Mathis Neumann; https://www.also.com/ec/cms5/en_6000/6000/index.jsp; ; Friedrich-Karl-Str. 9; Hamburg; Germania