Sampling and node adding in probabilistic roadmap planners

被引:29
|
作者
Geraerts, R [1 ]
Overmars, MH [1 ]
机构
[1] Univ Utrecht, Inst Informat & Comp Sci, NL-3584 CH Utrecht, Netherlands
关键词
comparative study; PRM; motion planning; sampling techniques; node adding techniques;
D O I
10.1016/j.robot.2005.09.026
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The probabilistic roadmap approach is one of the leading motion planning techniques. Over the past decade the technique has been studied by many different researchers. This has led to a large number of variants of the approach, each with its own merits. It is difficult to compare the different techniques because they were tested on different types of scenes, using different underlying libraries, implemented by different people on different machines. In this paper we provide a comparative study of a number of these techniques, all implemented in a single system and run on the same test scenes and on the same computer. In particular we compare collision checking techniques, sampling techniques, and node adding techniques. The results were surprising in the sense that techniques often performed differently than claimed by the designers. The study also showed how difficult it is to evaluate the quality of the techniques. The results should help future users of the probabilistic roadmap planning approach in deciding which technique is suitable for their situation. (c) 2005 Elsevier B.V. All rights reserved.
引用
收藏
页码:165 / 173
页数:9
相关论文
共 50 条
  • [1] Adaptive Node Sampling Method for Probabilistic Roadmap Planners
    Park, Byungjae
    Chung, Wan Kyun
    [J]. 2009 IEEE-RSJ INTERNATIONAL CONFERENCE ON INTELLIGENT ROBOTS AND SYSTEMS, 2009, : 4399 - +
  • [2] The gaussian sampling strategy for probabilistic roadmap planners
    Boor, V
    Overmars, MH
    van der Stappen, AF
    [J]. ICRA '99: IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION, VOLS 1-4, PROCEEDINGS, 1999, : 1018 - 1023
  • [3] The bridge test for sampling narrow passages with probabilistic roadmap planners
    Hsu, D
    Jiang, T
    Reif, J
    Sun, Z
    [J]. 2003 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION, VOLS 1-3, PROCEEDINGS, 2003, : 4420 - 4426
  • [4] A Connectivity-Based Method for Enhancing Sampling in Probabilistic Roadmap Planners
    Rantanen, Mika T.
    [J]. JOURNAL OF INTELLIGENT & ROBOTIC SYSTEMS, 2011, 64 (02) : 161 - 178
  • [5] A Delaunay triangulation based node connection strategy for probabilistic roadmap planners
    Huang, YF
    Gupta, K
    [J]. 2004 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION, VOLS 1- 5, PROCEEDINGS, 2004, : 908 - 913
  • [6] A Connectivity-Based Method for Enhancing Sampling in Probabilistic Roadmap Planners
    Mika T. Rantanen
    [J]. Journal of Intelligent & Robotic Systems, 2011, 64 : 161 - 178
  • [7] A comparative study of probabilistic roadmap planners
    Geraerts, R
    Overmars, MH
    [J]. ALGORITHMIC FOUNDATIONS OF ROBOTICS V, 2003, 7 : 43 - 57
  • [8] Using workspace information as a guide to non-uniform sampling in probabilistic roadmap planners
    van den Berg, JP
    Overmars, MH
    [J]. 2004 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION, VOLS 1- 5, PROCEEDINGS, 2004, : 453 - 460
  • [9] Using workspace information as a guide to non-uniform sampling in probabilistic roadmap planners
    van den Berg, JP
    Overmars, MH
    [J]. INTERNATIONAL JOURNAL OF ROBOTICS RESEARCH, 2005, 24 (12): : 1055 - 1071
  • [10] On finding narrow passages with probabilistic roadmap planners
    Hsu, D
    Kavraki, LE
    Latombe, JC
    Motwani, R
    Sorkin, S
    [J]. ROBOTICS: THE ALGORITHMIC PERSPECTIVE, 1998, : 141 - 153