Anzeige
Erschienen in:
2013 | OriginalPaper | Buchkapitel
Robust Complete Path Planning in the Plane
verfasst von : Victor Milenkovic, Elisha Sacks, Steven Trac
Erschienen in: Algorithmic Foundations of Robotics X
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
We present a complete path planning algorithm for a plane robot with three degrees of freedom and a static obstacle. The part boundaries consist of
n
linear and circular edges. The algorithm constructs and searches a combinatorial representation of the robot free space. Its computational complexity is O((
n
4
+ c
3
) log
n
) with
c
3
ε
O(
n
6
) the number of configurations with three simultaneous contacts between robot and obstacle edges. The algorithm is implemented robustly using our adaptive-precision controlled perturbation library. The program is fast and memory efficient, is provably accurate, and handles degenerate input.