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.
Read More
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.
Read Less
Add this copy of Unobstructed Shortest Paths in Polyhedral Environments to cart. $9.99, very good condition, Sold by GuthrieBooks rated 5.0 out of 5 stars, ships from Spring Branch, TX, UNITED STATES, published 1987 by Springer.
Add this copy of Unobstructed Shortest Paths in Polyhedral Environments to cart. $19.00, very good condition, Sold by Powell's Books Chicago rated 5.0 out of 5 stars, ships from Chicago, IL, UNITED STATES, published 1987 by Springer.
Add this copy of Unobstructed Shortest Paths in Polyhedral Environments to cart. $60.65, new condition, Sold by Ingram Customer Returns Center rated 5.0 out of 5 stars, ships from NV, USA, published 1987 by Springer.
