Items related to Unobstructed Shortest Paths in Polyhedral Environments...

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

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

This specific ISBN edition is currently not available.

Synopsis

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.

"synopsis" may belong to another edition of this title.

(No Available Copies)

Search Books:



Create a Want

Can't find the book you're looking for? We'll keep searching for you. If one of our booksellers adds it to AbeBooks, we'll let you know!

Create a Want

Other Popular Editions of the Same Title

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

Featured Edition

ISBN 10:  3540176292 ISBN 13:  9783540176299
Publisher: Springer, 1987
Softcover