Robot motion planning using adaptive random walks

We propose a novel motion planning algorithm based on adaptive random walks. The proposed algorithm turns out to be easy to implement and the solution it produces can be easily and efficiently optimized. Furthermore the algorithm can incorporate adaptive components, so that the developer is not required to specify all the parameters of the random distributions involved, and the algorithm itself can adapt to the environment it is moving in. Proofs of the theoretical soundness of the algorithm are provided as well as implementation details. Numerical comparisons with well known algorithms illustrate its effectiveness.

[1]  B. Øksendal.  Stochastic Differential Equations , 1985 .

[2]  Lydia E. Kavraki,et al.  Probabilistic roadmaps for path planning in high-dimensional configuration spaces , 1996, IEEE Trans. Robotics Autom..

[3]  Mark H. Overmars,et al.  The Gaussian sampling strategy for probabilistic roadmap planners , 1999, Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C).

[4]  Dinesh Manocha,et al.  Fast Proximity Queries with Swept Sphere Volumes , 1999 .

[5]  Jean-Claude Latombe,et al.  Motion Planning: A Journey of Robots, Molecules, Digital Actors, and Other Artifacts , 1999, Int. J. Robotics Res..

[6]  Heikki Haario,et al.  Adaptive proposal distribution for random walk Metropolis algorithm , 1999, Comput. Stat..

[7]  Steven M. LaValle,et al.  RRT-connect: An efficient approach to single-query path planning , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).

[8]  Lydia E. Kavraki,et al.  Path planning using lazy PRM , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).

[9]  S. LaValle,et al.  Randomized Kinodynamic Planning , 2001 .

[10]  Nancy M. Amato,et al.  Using Motion Planning to Study Protein Folding Pathways , 2002, J. Comput. Biol..

[11]  Steven M. LaValle,et al.  Efficient nearest neighbor searching for motion planning , 2002, Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292).