-
Anglický jazyk
Unobstructed Shortest Paths in Polyhedral Environments
Autor: 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... Viac o knihe
Na objednávku
49.49 €
bežná cena: 54.99 €
O knihe
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.
- Vydavateľstvo: Springer Berlin Heidelberg
- Rok vydania: 1987
- Formát: Paperback
- Rozmer: 235 x 155 mm
- Jazyk: Anglický jazyk
- ISBN: 9783540176299
Nemecký jazyk 
