Buy it now
Buying options
Tax calculation will be finalised at checkout
Other ways to access
This is a preview of subscription content, log in via an institution to check for access.
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.
Bibliographic Information
Book Title: Unobstructed Shortest Paths in Polyhedral Environments
Authors: Varol Akman
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/3-540-17629-2
Publisher: Springer Berlin, Heidelberg
-
eBook Packages: Springer Book Archive
Copyright Information: Springer-Verlag Berlin Heidelberg 1987
Softcover ISBN: 978-3-540-17629-9Published: 11 March 1987
eBook ISBN: 978-3-540-47731-0Published: 30 June 2005
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: X, 106
Topics: Computer Graphics, Simulation and Modeling, Artificial Intelligence