by Lydia E. Kavraki, Mihail N. Kolountzakis, Jean-claude Latombe
http://www.cs.rice.edu/CS/Robotics/papers/icra96.ps.gz
Add To MetaCart
Abstract:
We provide an analysis of a recent path planning method which uses probabilistic roadmaps. This method has proven very successful in practice, but the theoretical understanding of its performance is still limited. Assuming that a path fl exists between two configurations a and b of the robot, we study the dependence of the failure probability to connect a and b on (i) the length of fl, (ii) the distance function of fl from the obstacles, and (iii) the number of nodes N of the probabilistic roadmap constructed. Importantly, our results do not depend strongly on local irregularities of the configuration space, as was the case with previous analysis. These results are illustrated with a simple but illuminating example. In this example, we provide estimates for N, the principal parameter of the method, in order to achieve failure probability within prescribed bounds. We also compare, through this example, the different approaches to the analysis of the planning method. 1
Citations
|
1563
|
Robot Motion Planning
– Latombe
- 1991
|
|
284
|
Robot motion planning: a distributed representation approach
– Barraquand, Latombe
- 1991
|
|
148
|
Randomized preprocessing of configuration space for fast path planning
– Kavraki, Latombe
|
|
119
|
A probabilistic learning approach to motion planning,” in Algorithmic Foundations of Robotics, K. Goldberg et al., Eds
– Overmars, ˇSvestka
- 1995
|
|
85
|
Assembly maintainability study with motion planning
– Chang, Li
- 1995
|
|
79
|
Random networks in configuration space for fast path planning
– Kavraki
- 1995
|
|
56
|
Motion planning for many degrees of freedom—Random reflections at C-space obstacles
– Horsch, Schwarz, et al.
- 1994
|
|
50
|
Probabilistic roadmaps for fast path planning in high dimensional configuration spaces,” to be published
– Kavraki, ˇSvestka, et al.
|
|
46
|
Randomized query processing in robot path planning,” 27th Annu
– Kavraki, Latombe, et al.
- 1995
|
|
6
|
Adaptive Path Planning: Algorithm and Analysis
– Chen
- 1995
|
|
5
|
Le Fil d'Ariane: Une M'ethode de Planification G'en'erale. Application `a la Planification Automatique de Trajectoires, Th`ese de l'Institut Nat. Polytechnique de Grenoble
– Larios
- 1994
|
|
4
|
A random sampling scheme for motion planning
– Barraquand, Kavraki, et al.
- 1996
|
|
3
|
On the expected complexity of random path planning", Centre National de la Recherche Scientifique
– Lamiraux, Laumond
- 1995
|
|
3
|
Overmars "Motion planning for carlike robots using probabilistic roadmaps
– vestka, M
- 1994
|
