A Comparative Study of Probabilistic Roadmap Planners

  • Roland Geraerts
  • Mark H. Overmars
Part of the Springer Tracts in Advanced Robotics book series (STAR, volume 7)

Abstract

The probabilistic roadmap approach is one of the leading motion planning techniques. Over the past eight years 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, basic sampling techniques, and node adding techniques. The results should help future users of the probabilistic roadmap planning approach to choose the correct techniques.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    N. Amato, O. Bayazit, L. Dale, C. Jones, D. Vallejo, OBPRM: An obstacle-based PRM for 3D workspaces, in: P.K. Agarwal, L.E. Kavraki, M.T. Mason (eds.), Robotics: The algorithmic perspective, A.K. Peters, Natick, 1998, pp. 155–168.Google Scholar
  2. 2.
    N. Amato, O. Bayazit, L. Dale, C. Jones, D. Vallejo, Choosing good distance metrics and local planners for probabilistic roadmap methods, Proc. IEEE Int. Conf. on Robotics and Automation, 1998, pp. 630–637.Google Scholar
  3. 3.
    N. Amato, Y. Wu, A randomized roadmap method for path and manipulation planning, Proc. IEEE Int. Conf. on Robotics and Automation, 1996, pp. 113–120.CrossRefGoogle Scholar
  4. 4.
    J. Barraquand, L. Kavraki, J.-C. Latombe, T.-Y. Li, R. Motwani, P. Raghavan, A random sampling scheme for path planning, Int. Journal of Robotics Research 16 (1997), pp. 759–774.CrossRefGoogle Scholar
  5. 5.
    G. van den Bergen, Collision detection in interactive 3D computer animation, PhD thesis, Eindhoven University, 1999.MATHGoogle Scholar
  6. 6.
    R. Bohlin, L.E. Kavraki, Path planning using lazy PRM, Proc. IEEE Int. Conf. on Robotics and Automation, 2000, pp. 521–528.Google Scholar
  7. 7.
    V. Boor, M.H. Overmars, A.F. van der Stappen, The Gaussian sampling strategy for probabilistic roadmap planners, Proc. IEEE Int. Conf. on Robotics and Automation, 1999, pp. 1018–1023.Google Scholar
  8. 8.
    M. Branicky, S. LaValle, K. Olson, L. Yang, Quasi-randomized path planning, Proc. IEEE Int. Conf. on Robotics and Automation, 2001, pp. 1481–1487.Google Scholar
  9. 9.
    B. Chazelle, The discrepancy method, Cambridge University Press, Cambridge, 2000.CrossRefMATHGoogle Scholar
  10. 10.
    J. Cortes, T. Simeon, J.P. Laumond, A random loop generator for planning the motions of closed kinematic chains using PRM methods, Proc. IEEE Int. Conf. on Robotics and Automation, 2002, pp. 2141–2146.Google Scholar
  11. 11.
    L. Dale, Optimization techniques for probabilistic roadmaps, PhD thesis, Texas A&M University, 2000.Google Scholar
  12. 12.
    L. Dale, N. Amato, Probabilistic roadmaps–Putting it all together, Proc. IEEE Int. Conf. on Robotics and Automation, 2001, pp. 1940–1947.Google Scholar
  13. 13.
    L. Han, N. Amato, A kinematics-based probabilistic roadmap method for closed chain systems, Proc. Workshop on Algorithmic Foundations of Robotics (WAFR’00) 2000, pp. 233–246.Google Scholar
  14. 14.
    O. Hofstra, D. Nieuwenhuisen, M.H. Overmars, Improving the path quality for probabilistic roadmap planners, to appear.Google Scholar
  15. 15.
    C. Holleman, L. Kavraki, J. Warren, Planning paths for a flexible surface patch, Proc. IEEE Int. Conf. on Robotics and Automation, 1998, pp. 21–26.Google Scholar
  16. 16.
    D. Hsu, L. Kavraki, J.C. Latombe, R. Motwani, S. Sorkin, On finding narrow passages with probabilistic roadmap planners, in: P.K. Agarwal, L.E. Kavraki, M.T. Mason (eds.), Robotics: The algorithmic perspective, A.K. Peters, Natick, 1998, pp. 141–154.Google Scholar
  17. 17.
    L. Kavraki, Random networks in configuration space for fast path planning, PhD thesis, Stanford University, 1995.Google Scholar
  18. 18.
    L. Kavraki, J.C. Latombe, Randomized preprocessing of configuration space for fast path planning, Proc. IEEE Int. Conf. on Robotics and Automation, 1994, pp. 2138–2145.Google Scholar
  19. 19.
    L. Kavraki, P. Svestka, J-C. Latombe, M.H. Overmars, Probabilistic roadmaps for path planning in high-dimensional configuration spaces, IEEE Trans, on Robotics and Automation 12 (1996), pp. 566–580.CrossRefGoogle Scholar
  20. 20.
    F. Lamiraux, L.E. Kavraki, Planning paths for elastic objects under manipulation constraints, Int. Journal of Robotics Research 20 (2001), pp. 188–208.CrossRefGoogle Scholar
  21. 21.
    J-C. Latombe, Robot motion planning, Kluwer Academic Publishers, Boston, 1991.CrossRefGoogle Scholar
  22. 22.
    C. Nissoux, T. Siméon, J.-P. Laumond, Visibility based probabilistic roadmaps, Proc. IEEE Int. Conf. on Intelligent Robots and Systems, 1999, pp. 1316–1321.Google Scholar
  23. 23.
    M.H. Overmars, A random approach to motion planning, Technical Report RUU-CS-92–32, Dept. Comput. Sei., Utrecht Univ., Utrecht, the Netherlands, October 1992.Google Scholar
  24. 24.
    G. Sanchez, J.-C. Latombe, A single-query bi-directional probabilistic roadmap planner with lazy collision checking, Int. Journal of Robotics Research, 2002, to appear.Google Scholar
  25. 25.
    E. Schmitzberger, Probabilistic approach to list all non homotopic solutions of a motion planning problem, unpublished notes, 2002.Google Scholar
  26. 26.
    S. Sekhavat, P. Svestka, J.-P. Laumond, M.H. Overmars, Multilevel path planning for nonholonomic robots using semiholonomic subsystems, Int. Journal of Robotics Research 17 (1998), pp. 840–857.CrossRefGoogle Scholar
  27. 27.
    T. Simeon, J. Cortes, A. Sahbani, J.P. Laumond, A manipulation planner for pick and place operations under continuous grasps and placements, Proc. IEEE Int. Conf. on Robotics and Automation, 2002, pp. 2022–2027.Google Scholar
  28. 28.
    P. Svestka, Robot motion planning using probabilistic roadmaps, PhD thesis, Utrecht Univ. 1997.Google Scholar
  29. 29.
    P. Svestka, M.H. Overmars, Motion planning for car-like robots, a probabilistic learning approach, Int. Journal of Robotics Research 16 (1997), pp. 119–143.CrossRefGoogle Scholar
  30. 30.
    P. Svestka, M.H. Overmars, Coordinated path planning for multiple robots, Robotics and Autonomous Systems 23 (1998), pp. 125–152.CrossRefGoogle Scholar
  31. 31.
    S.A. Wilmarth, N.M. Amato, P.F. Stiller, MAPRM: A probabilistic roadmap planner with sampling on the medial axis of the free space, Proc. IEEE Int. Conf. on Robotics and Automation, 1999, pp. 1024–1031.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Roland Geraerts
    • 1
  • Mark H. Overmars
    • 1
  1. 1.Institute of Information and Computing SciencesUtrecht UniversityTB UtrechtThe Netherlands

Personalised recommendations