Unobstructed Shortest Paths in Polyhedral Environments
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.
1101308630
Unobstructed Shortest Paths in Polyhedral Environments
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.
54.99
In Stock
5
1
Unobstructed Shortest Paths in Polyhedral Environments
106
Unobstructed Shortest Paths in Polyhedral Environments
106Paperback(1987)
$54.99
54.99
In Stock
Product Details
| ISBN-13: | 9783540176299 |
|---|---|
| Publisher: | Springer Berlin Heidelberg |
| Publication date: | 04/06/1987 |
| Series: | Lecture Notes in Computer Science , #251 |
| Edition description: | 1987 |
| Pages: | 106 |
| Product dimensions: | 6.10(w) x 9.25(h) x 0.01(d) |
From the B&N Reads Blog