Adaptive Strategies for Probabilistic Roadmap Construction

This paper presents an experimental study of prospects for using adaptable local search techniques in probabilistic roadmap based motion planning. The classical PRM approach uses a single fast and simple local planner to build a network representation of the configuration space. Advanced PRM planners utilize heuristic sampling techniques and combine multiple local planners. The planner described here uses a single local planner, but adjusts its competence during the roadmap construction stage according to the problem at hand. Two adjusting strategies are proposed and compared experimentally against using a static local planner at a set competence level. The results indicate that roadmap construction with an adaptive local planner can bring advantages including more robust performance and a reduction in planning cost variance.

[1]  Nils J. Nilsson,et al.  Principles of Artificial Intelligence , 1980, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[2]  Nancy M. Amato,et al.  MAPRM: a probabilistic roadmap planner with sampling on the medial axis of the free space , 1999, Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C).

[3]  Thierry Siméon,et al.  Visibility based probabilistic roadmaps , 1999, Proceedings 1999 IEEE/RSJ International Conference on Intelligent Robots and Systems. Human and Environment Friendly Robots with High Intelligence and Emotional Quotients (Cat. No.99CH36289).

[4]  Henning Tolle,et al.  Motion planning with many degrees of freedom-random reflections at C-space obstacles , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.

[5]  Nancy M. Amato,et al.  An adaptive framework for 'single shot' motion planning , 2000, Proceedings. 2000 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2000) (Cat. No.00CH37113).

[6]  Pekka Isto,et al.  Constructing probabilistic roadmaps with powerful local planning and path optimization , 2002, IEEE/RSJ International Conference on Intelligent Robots and Systems.

[7]  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).

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

[9]  Daniel Vallejo,et al.  OBPRM: an obstacle-based PRM for 3D workspaces , 1998 .

[10]  Pekka Isto,et al.  A two-level search algorithm for motion planning , 1997, Proceedings of International Conference on Robotics and Automation.

[11]  J. Latombe,et al.  Randomized Query Processing in Robot Motion Planning , 1998 .

[12]  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.

[13]  Lydia E. Kavraki,et al.  Randomized query processing in robot path planning , 1995, STOC '95.

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

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

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

[17]  Lydia E. Kavraki,et al.  Capturing the Connectivity of High-Dimensional Geometric Spaces by Parallelizable Random Sampling Techniques , 1998, IPPS/SPDP Workshops.