Sampling-based Algorithms for Optimal Motion Planning

Details Sampling-based Algorithms for Optimal Motion Planning Sampling-based Algorithms for Optimal Motion Planning

2011-05-05

arxiv.org/abs/1105.1186v1

Computer Science

Robotics

76 pages, 26 figures, to appear in International Journal of Robotics Research

Scientific paper

During the last decade, sampling-based path planning algorithms, such as Probabilistic RoadMaps (PRM) and Rapidly-exploring Random Trees (RRT), have been shown to work well in practice and possess theoretical guarantees such as probabilistic completeness. However, little effort has been devoted to the formal analysis of the quality of the solution returned by such algorithms, e.g., as a function of the number of samples. The purpose of this paper is to fill this gap, by rigorously analyzing the asymptotic behavior of the cost of the solution returned by stochastic sampling-based algorithms as the number of samples increases. A number of negative results are provided, characterizing existing algorithms, e.g., showing that, under mild technical conditions, the cost of the solution returned by broadly used sampling-based algorithms converges almost surely to a non-optimal value. The main contribution of the paper is the introduction of new algorithms, namely, PRM* and RRT*, which are provably asymptotically optimal, i.e., such that the cost of the returned solution converges almost surely to the optimum. Moreover, it is shown that the computational complexity of the new algorithms is within a constant factor of that of their probabilistically complete (but not asymptotically optimal) counterparts. The analysis in this paper hinges on novel connections between stochastic sampling-based path planning algorithms and the theory of random geometric graphs.

Affiliated with

Also associated with

No associations

Rating

Sampling-based Algorithms for Optimal Motion Planning does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Sampling-based Algorithms for Optimal Motion Planning, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Sampling-based Algorithms for Optimal Motion Planning will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-575448