Unobstructed Shortest Paths in Polyhedral Environments - Lecture Notes in Computer Science - Varol Akman - Books - Springer-Verlag Berlin and Heidelberg Gm - 9783540176299 - March 11, 1987
In case cover and title do not match, the title is correct

Varol Akman
Unobstructed Shortest Paths in Polyhedral Environments - Lecture Notes in Computer Science 1987 edition

Price
HK$ 438
excl. VAT

Ordered from remote warehouse

Expected to be ready for shipping Jun 18 - 24

Our customers say:

14-day return policy in accordance with European consumer protection law
Top ranking on Trustpilot
Add to your iMusic wish list

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.

106 pages, biography

Media Books     Paperback Book   (Book with soft cover and glued back)
Released March 11, 1987
ISBN13 9783540176299
Publishers Springer-Verlag Berlin and Heidelberg Gm
Pages 106
Dimensions 156 × 234 × 6 mm   ·   172 g
Language English  

Mere med samme udgiver

See all of Varol Akman ( e.g. Paperback Book and Hardcover Book )