Unobstructed Shortest Paths in Polyhedral Environments (Lecture Notes in Computer Science, 251, Band 251) - Softcover

Akman, Varol

 
9783540176299: Unobstructed Shortest Paths in Polyhedral Environments (Lecture Notes in Computer Science, 251, Band 251)

Inhaltsangabe

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.

Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.

Weitere beliebte Ausgaben desselben Titels

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

Vorgestellte Ausgabe

ISBN 10:  0387176292 ISBN 13:  9780387176291
Softcover