On the Probabilistic Foundations of Probabilistic Roadmap Planning

  • David Hsu
  • Jean-Claude Latombe
  • Hanna Kurniawati
Conference paper
Part of the Springer Tracts in Advanced Robotics book series (STAR, volume 28)

Abstract

Why are probabilistic roadmap (PRM) planners “probabilistic”? This paper tries to establish the probabilistic foundations of PRM planning and reexamines previous work in this context. It shows that the success of PRM planning depends mainly and critically on the assumption that the configuration space C of a robot often verifies favorable “visibility” properties that are not directly dependent on the dimensionality of C. A promising way of speeding up PRM planners is to extract partial knowledge on such properties during roadmap construction and use this knowledge to adjust the sampling measure continuously. This paper also shows that the choice of the sampling source—pseudo-random or deterministic—has small impact on a PRM planner’s performance, compared to that of the sampling measure. These conclusions are supported by both theoretical arguments and empirical results.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    B. Burns and O. Brock. Sampling-based motion planning using predictive models. In Proc. IEEE Int. Conf. on Robotics & Automation, 2005.Google Scholar
  2. 2.
    V. Boor, M.H. Overmars, and A.F. van der Stappen. The Gaussian sampling strategy for probbailistic roadmap planners. Proc. IEEE Int. Conf. on Robotics & Automation, pp. 1018–1023, 1999.Google Scholar
  3. 3.
    H. Choset, K.M. Lynch, S. Hutchinson, G. Kantor, W. Burgard, L.E. Kavraki, and S. Thrun. Principles of Robot Motion: Theory, Algorithms, and Implementations, Chapter 7, MIT Press, 2005.Google Scholar
  4. 4.
    M. Foskey, M. Garber, M.C. Lin, and D. Manocha. A Voronoi-based hybrid motion planner. In Proc. IEEE/RSJ Int. Conf. on Intelligent Robots & Systems, pages 55–60, 2001.Google Scholar
  5. 5.
    L. Guibas, C. Holleman, and L.E. Kavraki. A probabilistic roadmap planner for flexible objects with a workspace medial-axis based sampling approach. In Proc. IEEE/RSJ Int. Conf. on Intelligent Robots & Systems, pages 254–260, 1999.Google Scholar
  6. 6.
    R. Geraerts and M.H. Overmars. A comparative study of probabilistic roadmap planners. In J.D. Boissonnat et al. (eds.), Algorithmic Foundations of Robotics V, pp. 43–57, Springer, 2004.Google Scholar
  7. 7.
    D. Hsu, T. Jiang, J. Reif, and Z. Sun. The bridge test for sampling narrow passages with probabilistic roadmap planners. In Proc. IEEE Int. Conf. on Robotics & Automation, pages 4420–4426, 2003.Google Scholar
  8. 8.
    D. Hsu, L.E. Kavraki, J.C. Latombe, R. Motwani, and S. Sorkin. On finding narrow passages with probabilistic roadmap planners. In P.K. Agarwal et al., editors, Robotics: The Algorithmic Perspective: 1998 Workshop on the Algorithmic Foundations of Robotics, pages 141–154. A. K. Peters, Wellesley, MA, 1998.Google Scholar
  9. 9.
    D. Hsu, J.C. Latombe, and R. Motwani. Path planning in expansive configuration spaces. In Proc. IEEE Int. Conf. on Robotics & Automation, pp. 2219–2226, 1997.Google Scholar
  10. 10.
    D. Hsu, G. Sánchez-Ante, and, Z. Sun. Hybrid PRM sampling with a cost-sensitive adaptive strategy. In Proc. IEEE Int. Conf. on Robotics & Automation, 2005.Google Scholar
  11. 11.
    L.E. Kavraki, J.C. Latombe, R. Motwani, and P. Raghavan. Randomized query processing in robot motion planning. In Proc. ACM Symp. on Theory of Computing (STOC), pp. 353–362, 1995.Google Scholar
  12. 12.
    L.E. Kavraki, P. Švestka, J.C. Latombe, M.H. Overmars, Probabilistic roadmaps for path planning in high-dimensional configuration spaces. IEEE Trans. on Robotics & Automation, 12:566–580, 1996.CrossRefGoogle Scholar
  13. 13.
    S.M. LaValle, M.S. Branicky, and S.R. Lindermann. On the relationship between classical grid search and probabilistic roadmaps. Int. J. of Robotics Research, 23(7–8):673–692, 2004.CrossRefGoogle Scholar
  14. 14.
    P. Leven and S. Hutchinson. Using manipulability to bias sampling during the construction of probabilistic roadmaps. In Proc. IEEE Int. Conf. on Robotics & Automation, pages 2134–2140, 2002.Google Scholar
  15. 15.
    S.R. Lindemann and S.M. LaValle. Incremental low-discrepancy lattice methods for motion planning. In Proc. IEEE Int. Conf. on Robotics & Automation, pages 2920–2927, 2003.Google Scholar
  16. 16.
    M. Lin and D. Manocha. Collision and proximity queries. In J.E. Goodman and J. O’Rourke, editors, Handbook of Discrete and Computational Geometry, chapter 35. CRC Press, 2004.Google Scholar
  17. 17.
    J. Matousek. Geometric Discrepancy. Springer-Verlag, Berlin, 1999.MATHGoogle Scholar
  18. 18.
    M. Saha and J.C. Latombe. Finding narrow passages with probabilistic roadmaps: The small step retraction method. In Proc. IEEE/RSJ Int. Conf. on Intelligent Robots & Systems, 2005.Google Scholar
  19. 19.
    T. Siméon, J.P. Laumond, and C. Nissoux. Visibility-based probabilistic roadmaps for motion planning. J. of Advanced Robotics, 14(6):477–494, 2000.CrossRefGoogle Scholar
  20. 20.
    Y. Yang and O. Brock. Adapting the Sampling Distribution in PRM Planners Based on an Approximated Medial Axis. In Proc. IEEE Int. Conf. on Robotics & Automation, 2004.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • David Hsu
    • 1
    • 2
  • Jean-Claude Latombe
    • 3
  • Hanna Kurniawati
    • 1
  1. 1.Department of Computer ScienceNational University of SingaporeSingapore
  2. 2.Singapore MIT AllianceSingapore
  3. 3.Department of Computer ScienceStanford UniversityStanfordUSA

Personalised recommendations