Power Search
Low Price Guarantee
We Take School POs
Unobstructed Shortest Paths in Polyhedral Environments 1987 Edition
Contributor(s): Akman, Varol (Author)

View larger image

 ISBN: 3540176292     ISBN-13: 9783540176299
Publisher: Springer
OUR PRICE: $52.24  

Binding Type: Paperback - See All Available Formats & Editions
Published: March 1987
Qty:

Click for more in this series: Lecture Notes in Computer Science
Additional Information
BISAC Categories:
- Technology & Engineering | Robotics
- Computers | Computer Graphics
- Computers | Intelligence (ai) & Semantics
Dewey: 629.892
Series: Lecture Notes in Computer Science
Physical Information: 0.24" H x 6.14" W x 9.21" L (0.38 lbs) 106 pages
 
Descriptions, Reviews, Etc.
Publisher Description:

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.
 
Customer ReviewsSubmit your own review
 
To tell a friend about this book, you must Sign In First!