Unobstructed Shortest Paths in Polyhedral Environments

Unobstructed Shortest Paths in Polyhedral Environments - Lecture Notes in Computer Science

1987th edition

Paperback (11 Mar 1987)

Save $2.07

  • RRP $60.41
  • $58.34
Add to basket

Includes delivery to the United States

10+ copies available online - Usually dispatched within 7 days

Publisher's Synopsis

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.

Book information

ISBN: 9783540176299
Publisher: Springer Berlin Heidelberg
Imprint: Springer
Pub date:
Edition: 1987th edition
Language: English
Number of pages: 106
Weight: 390g
Height: 234mm
Width: 156mm
Spine width: 6mm