Item description for Unobstructed Shortest Paths in Polyhedral Environments (Lecture Notes in Computer Science) by Varol Akman...
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.
Promise Angels is dedicated to bringing you great books at great prices. Whether you read for entertainment, to learn, or for literacy - you will find what you want at promiseangels.com!
Est. Packaging Dimensions: Length: 9.21" Width: 6.14" Height: 0.24" Weight: 0.39 lbs.
Release Date Apr 6, 1987
ISBN 3540176292 ISBN13 9783540176299
Availability 67 units. Availability accurate as of May 26, 2017 05:50.
Usually ships within one to two business days from La Vergne, TN.
Orders shipping to an address other than a confirmed Credit Card / Paypal Billing address may incur and additional processing delay.