A Region-specific Hybrid Sampling Method for Optimal Path Planning

被引:3
作者
Zhong, Chengcheng [1 ]
Liu, Hong [1 ]
机构
[1] Peking Univ, Key Lab Machine Percept, Minist Educ, Shenzhen Grad Sch, Beijing, Peoples R China
基金
国家高技术研究发展计划(863计划); 中国国家自然科学基金;
关键词
Optimal Path Planning; Narrow Passage Problem; Non-uniform Sampling; Region-based; RRT-ASTERISK; MOTION;
D O I
10.5772/63031
中图分类号
TP24 [机器人技术];
学科分类号
080202 ; 1405 ;
摘要
Finding high quality paths within a limited time in configuration space is a challenging issue for path planning. Recently, an asymptotically optimal method called fast marching tree (FMT*) has been proposed. This method converges significantly faster than its state-of-the-art counterparts when addressing a wide range of problems. However, FMT* appears unable to solve the narrow passage problem in optimal path planning, since it is based on uniform sampling. Aiming at solving this problem, a novel region-based sampling method integrating global scenario information and local region information is proposed in this paper. First, global information related to configuration space is extracted from an initial sample set obtained via hybrid sampling. Then, local regions are constructed and local region information is captured to make intelligent decisions regarding regions that are difficult and need to be boosted. Finally, the initial sample set is sent to FMT* using a modified locally optimal one-step connection strategy in order to find an initial and feasible solution. If no solution is found and time permits, the guided hybrid sampling will be adopted in order to add more useful samples to the sample set until a solution is found or the time for doing so runs out. Simulation results for six benchmark scenarios validate that our method can achieve significantly better results than other state-of-the-art methods when applied in challenging scenarios with narrow passages.
引用
收藏
页数:15
相关论文
共 38 条
[1]  
Akgun B., 2011, 2011 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2011), P2640, DOI 10.1109/IROS.2011.6048838
[2]  
AMATO NM, 1998, P INT WORKSH ALG FDN, P155
[3]  
Arslan O, 2013, IEEE INT CONF ROBOT, P2421, DOI 10.1109/ICRA.2013.6630906
[4]  
Boor V, 1999, ICRA '99: IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION, VOLS 1-4, PROCEEDINGS, P1018, DOI 10.1109/ROBOT.1999.772447
[5]   Sparse roadmap spanners for asymptotically near-optimal motion planning [J].
Dobson, Andrew ;
Bekris, Kostas E. .
INTERNATIONAL JOURNAL OF ROBOTICS RESEARCH, 2014, 33 (01) :18-47
[6]  
Gammell J D., 2014, 2014 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2014), P2997
[7]  
Gammell JD, 2015, IEEE INT CONF ROBOT, P3067, DOI 10.1109/ICRA.2015.7139620
[8]   Creating high-quality paths for motion planning [J].
Geraerts, Roland ;
Overmars, Mark H. .
INTERNATIONAL JOURNAL OF ROBOTICS RESEARCH, 2007, 26 (08) :845-863
[9]  
Hauser K, 2015, IEEE INT CONF ROBOT, P2951, DOI 10.1109/ICRA.2015.7139603
[10]  
Hsu D, 2003, IEEE INT CONF ROBOT, P4420