Unobstructed Shortest Paths In Polyhedral Environments (Lecture Notes In Computer Science) Varol Akman

ISBN: 9783540176299

Published: March 11th 1987

Paperback

106 pages


Description

Unobstructed Shortest Paths In Polyhedral Environments (Lecture Notes In Computer Science)  by  Varol Akman

Unobstructed Shortest Paths In Polyhedral Environments (Lecture Notes In Computer Science) by Varol Akman
March 11th 1987 | Paperback | PDF, EPUB, FB2, DjVu, talking book, mp3, RTF | 106 pages | ISBN: 9783540176299 | 5.19 Mb

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 onMorePresents 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.



Enter the sum





Related Archive Books



Related Books


Comments

Comments for "Unobstructed Shortest Paths In Polyhedral Environments (Lecture Notes In Computer Science)":


hallsciences.com

©2010-2015 | DMCA | Contact us