Anytime Solution Optimization for Sampling-Based Motion Planning

R. Luna, I. A. Şucan, M. Moll, and L. E. Kavraki, “Anytime Solution Optimization for Sampling-Based Motion Planning,” in IEEE International Conference on Robotics and Automation, Karlsruhe, Germany, 2013, pp. 5053–5059.

Abstract

Recent work in sampling-based motion planning has yielded several different approaches for computing good quality paths in high degree of freedom systems: path shortcutting methods that attempt to shorten a single solution path by connecting non-consecutive configurations, a path hybridization technique that combines portions of two or more solutions to form a shorter path, and asymptotically optimal algorithms that converge to the shortest path over time. This paper presents an extensible meta-algorithm that incorporates a traditional sampling-based planning algorithm with offline path shorten- ing techniques to form an anytime algorithm which exhibits competitive solution lengths to the best known methods and optimizers. A series of experiments involving rigid motion and complex manipulation are performed as well as a comparison with asymptotically optimal methods which show the efficacy of the proposed scheme, particularly in high-dimensional spaces.

Publisher: http://dx.doi.org/10.1109/ICRA.2013.6631301

PDF preprint: http://kavrakilab.org/publications/luna-sucan2013anytime-solution-optimization.pdf