Narrow passage sampling for probabilistic roadmap planning

被引:110
作者
Sun, Z [1 ]
Hsu, D
Jiang, TT
Kurniawati, H
Reif, JH
机构
[1] Hong Kong Baptist Univ, Dept Comp Sci, Kowloon, Hong Kong, Peoples R China
[2] Natl Univ Singapore, Dept Comp Sci, Singapore 117543, Singapore
[3] Duke Univ, Dept Comp Sci, Durham, NC 27708 USA
基金
美国国家科学基金会;
关键词
motion planning; probabilistic roadmap (PRM) planner; random sampling; randomized algorithm; robotics;
D O I
10.1109/TRO.2005.853485
中图分类号
TP24 [机器人技术];
学科分类号
080202 ; 1405 ;
摘要
Probabilistic roadmap (PRM) planners have been successful in path planning of robots with many degrees of freedom, but sampling narrow passages in a robot's configuration space remains a challenge for PRM planners. This paper presents a hybrid sampling strategy in the PRM framework for finding paths through narrow passages. A key ingredient of the new strategy is the bridge test, which reduces sample density in many unimportant parts of a configuration space, resulting in increased sample density in narrow passages. The bridge test can be implemented efficiently in high-dimensional configuration spaces using only simple tests of local geometry. The strengths of the bridge test and uniform sampling complement each other naturally. The two sampling strategies are combined to construct the hybrid sampling strategy for our planner. We implemented the planner and tested it on rigid and articulated robots in 2-D and 3-D environments. Experiments show that the hybrid sampling strategy enables relatively small roadmaps to reliably capture the connectivity of configuration spaces with difficult narrow passages.
引用
收藏
页码:1105 / 1115
页数:11
相关论文
共 32 条
[1]  
AMATO NM, 2002, P INT C COMP MOL BIO, P2
[2]  
[Anonymous], P WORKSH ALG FDN ROB
[3]  
APAYDIN MS, 2002, P INT C COMP MOL BIO, P12
[4]   A random sampling scheme for path planning [J].
Barraquand, J ;
Kavraki, L ;
Latombe, JC ;
Motwani, R ;
Li, TY ;
Raghavan, P .
INTERNATIONAL JOURNAL OF ROBOTICS RESEARCH, 1997, 16 (06) :759-774
[5]  
Bohlin R., 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065), P521, DOI 10.1109/ROBOT.2000.844107
[6]  
Boor V, 1999, ICRA '99: IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION, VOLS 1-4, PROCEEDINGS, P1018, DOI 10.1109/ROBOT.1999.772447
[7]  
CHANG H, 1995, IEEE INT CONF ROBOT, P1012, DOI 10.1109/ROBOT.1995.525415
[8]  
Collins AD, 2003, IEEE INT CONF ROBOT, P4433
[9]  
Dale LK, 2001, IEEE INT CONF ROBOT, P1940, DOI 10.1109/ROBOT.2001.932892
[10]  
Foskey M, 2001, IROS 2001: PROCEEDINGS OF THE 2001 IEEE/RJS INTERNATIONAL CONFERENCE ON INTELLIGENT ROBOTS AND SYSTEMS, VOLS 1-4, P55, DOI 10.1109/IROS.2001.973336