Lecture Notes in Computer Science

Unobstructed Shortest Paths in Polyhedral Environments

Authors: Akman, Varol

Buy this book

eBook $69.99
price for USA (gross)
  • ISBN 978-3-540-47731-0
  • Digitally watermarked, DRM-free
  • Included format:
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover $89.99
price for USA
  • ISBN 978-3-540-17629-9
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
About this book

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.

Buy this book

eBook $69.99
price for USA (gross)
  • ISBN 978-3-540-47731-0
  • Digitally watermarked, DRM-free
  • Included format:
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover $89.99
price for USA
  • ISBN 978-3-540-17629-9
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Loading...

Recommended for you

Loading...

Bibliographic Information

Bibliographic Information
Book Title
Unobstructed Shortest Paths in Polyhedral Environments
Authors
Series Title
Lecture Notes in Computer Science
Series Volume
251
Copyright
1987
Publisher
Springer-Verlag Berlin Heidelberg
Copyright Holder
Springer-Verlag Berlin Heidelberg
eBook ISBN
978-3-540-47731-0
DOI
10.1007/3-540-17629-2
Softcover ISBN
978-3-540-17629-9
Series ISSN
0302-9743
Edition Number
1
Number of Pages
X, 106
Topics