ENGLISH

Unobstructed Shortest Paths in Polyhedral Environments

By Varol Akman (auth.)

Book information

Publisher
Springer-Verlag Berlin Heidelberg
Year
1987
ISBN
3540176292, 9783540176299
DOI
10.1007/3-540-17629-2
Open Library ID
OL9596452M
Language
english
Format
DJVU
Filesize
1 MB (1100061 bytes)
Series
Lecture Notes in Computer Science 251
Edition
1
Pages
106\109
Library
Kolxo3
DPI
300
Time added
2011-07-22 07:35:22
Computer Graphics; Simulation and Modeling; Artifi

Description

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.

Similar books