Complete path planning that simultaneously optimizes length and clearance

Sakcak, Basak; LaValle, Steven M. (2021-10-18)
 
Avaa tiedosto
Lataukset: 

URL:
https://doi.org/10.1109/ICRA48506.2021.9561784

Sakcak, Basak
LaValle, Steven M.
Institute of Electrical and Electronics Engineers
18.10.2021

B. Sakcak and S. M. LaValle, "Complete Path Planning That Simultaneously Optimizes Length and Clearance," 2021 IEEE International Conference on Robotics and Automation (ICRA), 2021, pp. 10100-10106, doi: 10.1109/ICRA48506.2021.9561784

https://rightsstatements.org/vocab/InC/1.0/
© 2021 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
https://rightsstatements.org/vocab/InC/1.0/
doi:https://doi.org/10.1109/ICRA48506.2021.9561784
Näytä kaikki kuvailutiedot
Julkaisun pysyvä osoite on
https://urn.fi/URN:NBN:fi-fe2021111154646
Tiivistelmä

Abstract

This paper considers a fundamental, optimal path planning problem that requires simultaneously minimizing path length and maximizing obstacle clearance. We show that in even simple planar settings with point and disc obstacles, the set of alternative solutions such that no one is clearly better than another (the set of Pareto-optimal solutions) is uncountably infinite. In spite of this difficulty, we introduce a complete, efficient algorithm that computes the Pareto front and a data structure that finitely represents the complete set of all Pareto- optimal paths. Particular optimal paths can then be selected from the computed data structure during execution, based on any additional conditions or considerations.

Kokoelmat