ERPP: An experience-based randomized path planner

This paper presents a motion planning algorithm capable of exploiting the experience gained in previous path computations in the same static workspace. The algorithm takes advantage of a parallel approach to speed up computation and compile a graph retaining useful knowledge about the environment. Experimental results assess the performance improvement of the experience-based planner over the parallel implementation of a well-known probabilistic motion planning algorithm.

[1]  Dominik Henrich,et al.  Fast Motion Planning by Parallel Processing – a Review , 1997, J. Intell. Robotic Syst..

[2]  B. Faverjon,et al.  Probabilistic Roadmaps for Path Planning in High-Dimensional Con(cid:12)guration Spaces , 1996 .

[3]  Jean-Claude Latombe,et al.  Robot motion planning , 1991, The Kluwer international series in engineering and computer science.

[4]  Lydia E. Kavraki,et al.  Randomized preprocessing of configuration for fast path planning , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.

[5]  Mark H. Overmars,et al.  A probabilistic learning approach to motion planning , 1995 .

[6]  Narendra Ahuja,et al.  Gross motion planning—a survey , 1992, CSUR.

[7]  Nancy M. Amato,et al.  A randomized roadmap method for path and manipulation planning , 1996, Proceedings of IEEE International Conference on Robotics and Automation.

[8]  Stefano Caselli,et al.  Randomized motion planning on parallel and distributed architectures , 1999, Proceedings of the Seventh Euromicro Workshop on Parallel and Distributed Processing. PDP'99.

[9]  Florent Lamiraux,et al.  On the expected complexity of random path planning , 1996, Proceedings of IEEE International Conference on Robotics and Automation.

[10]  Vipin Kumar,et al.  A parallel formulation of informed randomized search for robot motion planning problems , 1995, Proceedings of 1995 IEEE International Conference on Robotics and Automation.

[11]  Dominik Henrich,et al.  Path planning for industrial robot arms - A parallel randomized approach , 1996 .

[12]  Jean-Claude Latombelatombe.  Ing of Connguration Space for Fast Path Planning , 2007 .

[13]  J. Latombe,et al.  Probabilistic Roadm Aps for Path Planning in High-dimensional Connguration Spaces , 1997 .

[14]  John Canny,et al.  The complexity of robot motion planning , 1988 .

[15]  Tsai-Yen Li,et al.  Assembly maintainability study with motion planning , 1995, Proceedings of 1995 IEEE International Conference on Robotics and Automation.

[16]  Nancy M. Amato,et al.  Probabilistic roadmap methods are embarrassingly parallel , 1999, Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C).

[17]  Angel P. del Pobil,et al.  Practical Motion Planning in Robotics: Current Approaches and Future Directions , 1998 .

[18]  Jean-Claude Latombe,et al.  Robot Motion Planning: A Distributed Representation Approach , 1991, Int. J. Robotics Res..

[19]  Pang C. Chen.  Adaptive path planning: algorithm and analysis , 1995, Proceedings of 1995 IEEE International Conference on Robotics and Automation.

[20]  John H. Reif,et al.  Complexity of the mover's problem and generalizations , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).