Robust complete path planning in the plane

Victor Milenkovic, Elisha Sacks, Steven Trac

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

4 Citations (Scopus)

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

Fingerprint

Motion planning
Robots
Computational complexity
Data storage equipment

ASJC Scopus subject areas

  • Artificial Intelligence
  • Electrical and Electronic Engineering

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

Robust complete path planning in the plane. / Milenkovic, Victor; Sacks, Elisha; Trac, Steven.

Springer Tracts in Advanced Robotics. Vol. 86 Springer Verlag, 2013. p. 37-52 (Springer Tracts in Advanced Robotics; Vol. 86).

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

Milenkovic, V, Sacks, E & Trac, S 2013, Robust complete path planning in the plane. in Springer Tracts in Advanced Robotics. vol. 86, Springer Tracts in Advanced Robotics, vol. 86, Springer Verlag, pp. 37-52, 10th International Workshop on the Algorithmic Foundations of Robotics, WAFR 2012, Cambridge, United States, 6/13/12. https://doi.org/10.1007/978-3-642-36279-8_3
Milenkovic V, Sacks E, Trac S. Robust complete path planning in the plane. In Springer Tracts in Advanced Robotics. Vol. 86. Springer Verlag. 2013. p. 37-52. (Springer Tracts in Advanced Robotics). https://doi.org/10.1007/978-3-642-36279-8_3
Milenkovic, Victor ; Sacks, Elisha ; Trac, Steven. / Robust complete path planning in the plane. Springer Tracts in Advanced Robotics. Vol. 86 Springer Verlag, 2013. pp. 37-52 (Springer Tracts in Advanced Robotics).
@inproceedings{7bec9aa48c7444e99f19c5cda56bbc8e,
title = "Robust complete path planning in the plane",
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.",
author = "Victor Milenkovic and Elisha Sacks and Steven Trac",
year = "2013",
doi = "10.1007/978-3-642-36279-8_3",
language = "English (US)",
isbn = "9783642362781",
volume = "86",
series = "Springer Tracts in Advanced Robotics",
publisher = "Springer Verlag",
pages = "37--52",
booktitle = "Springer Tracts in Advanced Robotics",

}

TY - GEN

T1 - Robust complete path planning in the plane

AU - Milenkovic, Victor

AU - Sacks, Elisha

AU - Trac, Steven

PY - 2013

Y1 - 2013

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85009517020&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85009517020&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-36279-8_3

DO - 10.1007/978-3-642-36279-8_3

M3 - Conference contribution

SN - 9783642362781

VL - 86

T3 - Springer Tracts in Advanced Robotics

SP - 37

EP - 52

BT - Springer Tracts in Advanced Robotics

PB - Springer Verlag

ER -