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.
General
Is the information for this product incomplete, wrong or inappropriate?
Let us know about it.
Does this product have an incorrect or missing image?
Send us a new image.
Is this product missing categories?
Add more categories.
Review This Product
No reviews yet - be the first to create one!