Artificial potential biased probabilistic roadmap method

Probabilistic roadmap methods (PRM) have been successfully used to solve difficult path planning problems but their efficiency is limited when the free space contains narrow passages through which the robot must pass. This paper presents a new sampling scheme that aims to increase the probability of finding paths through narrow passages. Here, a biased sampling scheme is used to increase the distribution of nodes in narrow regions of the free space. A partial computation of the artificial potential field is used to bias the distribution of nodes.

[1]  David Hsu,et al.  The bridge test for sampling narrow passages with probabilistic roadmap planners , 2003, 2003 IEEE International Conference on Robotics and Automation (Cat. No.03CH37422).

[2]  Lydia E. Kavraki,et al.  A Random Sampling Scheme for Path Planning , 1997, Int. J. Robotics Res..

[3]  Micha Sharir,et al.  Motion Planning in the Presence of Moving Obstacles , 1985, FOCS.

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

[5]  P. Svestka.  On probabilistic completeness and expected complexity for probabilistic path planning , 1996 .

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

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

[8]  Jean-Claude Latombe,et al.  Kinodynamic motion planning amidst moving obstacles , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).

[9]  Roderic A. Grupen,et al.  The applications of harmonic functions to robotics , 1993, J. Field Robotics.

[10]  Daniel E. Koditschek,et al.  Exact robot navigation using artificial potential functions , 1992, IEEE Trans. Robotics Autom..

[11]  Lydia E. Kavraki,et al.  On finding narrow passages with probabilistic roadmap planners , 1998 .