• Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Unobstructed Shortest Paths in Polyhedral Environments

Unobstructed Shortest Paths in Polyhedral Environments

Paperback

Series: Lecture Notes in Computer Science, Book 251

Technology & EngineeringGeneral ComputersProgramming

ISBN10: 3540176292
ISBN13: 9783540176299
Publisher: Springer Nature
Published: Mar 11 1987
Pages: 106
Weight: 0.38
Height: 0.24 Width: 6.14 Depth: 9.21
Language: English

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.

Also in

Technology & Engineering