Robust complete path planning in the plane

Victor Milenkovic, Elisha Sacks, Steven Trac

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Scopus citations

Abstract

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 algorithmconstructs and searches a combinatorial representation of the robot free space. Its computational complexity is O((n4 +c3) logn) with c3 ∈ O(n6) 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.

Original languageEnglish (US)
Title of host publicationSpringer Tracts in Advanced Robotics
PublisherSpringer Verlag
Pages37-52
Number of pages16
Volume86
ISBN (Print)9783642362781
DOIs
StatePublished - 2013
Event10th International Workshop on the Algorithmic Foundations of Robotics, WAFR 2012 - Cambridge, United States
Duration: Jun 13 2012Jun 15 2012

Publication series

NameSpringer Tracts in Advanced Robotics
Volume86
ISSN (Print)16107438
ISSN (Electronic)1610742X

Other

Other10th International Workshop on the Algorithmic Foundations of Robotics, WAFR 2012
CountryUnited States
CityCambridge
Period6/13/126/15/12

ASJC Scopus subject areas

  • Artificial Intelligence
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Robust complete path planning in the plane'. Together they form a unique fingerprint.

  • Cite this

    Milenkovic, V., Sacks, E., & Trac, S. (2013). Robust complete path planning in the plane. In Springer Tracts in Advanced Robotics (Vol. 86, pp. 37-52). (Springer Tracts in Advanced Robotics; Vol. 86). Springer Verlag. https://doi.org/10.1007/978-3-642-36279-8_3