Advertisement

A Single-Query Bi-Directional Probabilistic Roadmap Planner with Lazy Collision Checking

  • Gildardo Sánchez
  • Jean-Claude Latombe
Conference paper
Part of the Springer Tracts in Advanced Robotics book series (STAR, volume 6)

Abstract

This paper describes a new probabilistic roadmap (PRM) path planner that is: (1) single-query — instead of pre-computing a roadmap covering the entire free space, it uses the two input query configurations as seeds to explore as little space as possible; (2) bidirectional — it explores the robot’s free space by concurrently building a roadmap made of two trees rooted at the query configurations; (3) adaptive — it makes longer steps in opened areas of the free space and shorter steps in cluttered areas; and (4) lazy in checking collision — it delays collision tests along the edges of the roadmap until they are absolutely needed. Experimental results show that this combination of techniques drastically reduces planning times, making it possible to handle difficult problems, including multi-robot problems in geometrically complex environments.

Keywords

Path Planning Path Planner Local Path Candidate Path Collision Check 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Amato NM, Bayazit OB, Dale LK, Jones C, Vallejo D (2002) OBPRM: An obstacle-based PRM for 3D workspace. In Robotics: The Algorithmic Perspective, pp 155–168. A.K. Peters, Natick, MA.Google Scholar
  2. Barraquand J, Kavraki LE, Latombe JC, Li TY, Motwani R, Raghavan P (1997) A random sampling scheme for path planning. Int. J. of Robotics Research, 16(6):759–774.CrossRefGoogle Scholar
  3. Bohlin R, Kavraki LE (2000) Path planning using lazy PRM. In Proc. IEEE Int. Conf. Robotics & Autom., San Francisco,CA.Google Scholar
  4. Boor V, Overmars MH, van der Strappen AF (1999) The gaussian sampling strategy for probabilistic roadmap planners. In IEEE Int. Conf. Robotics & Autom., pp 1018–1023, Detroit, MI.Google Scholar
  5. Casal A (2001) Reconfiguration planning for modular self-reconfigurable robots. PhD thesis, Aeronautics & Astronautics Dept., Stanford U., CA.Google Scholar
  6. Gottschalk S, Lin M, Manocha D (1996) OBB-Tree: A hierarchical structure for rapid interference detection. In Proc. ACM SIGGRAPH’96, pp 171–180.Google Scholar
  7. Hsu D (2000) Randomized single-query motion planning in expansive spaces. PhD thesis, Computer Science Dept., Stanford University, CA.Google Scholar
  8. Hsu D, Latombe JC, Motwani R (1997) Path planning in expansive configuration spaces. In Proc. IEEE Int. Conf. Robotics & Autom., pp 2719–2726.Google Scholar
  9. Kavraki LE (1994) Random networks in configuration space for fast path planning. PhD thesis, Computer Science Dept., Stanford University, CA.Google Scholar
  10. Kavraki LE, Svestka P, Latombe JC, Overmars MH (1996) Probabilistic roadmaps for path planning in high-dimensional configuration spaces. IEEE Trans. Robotics & Autom., 12 (4):566–580.CrossRefGoogle Scholar
  11. Kindel R (2001) Motion planning for free-flying robots in dynamic and uncertain environments. PhD thesis, Aeronaut. & Astr. Dept., Stanford University, CA.Google Scholar
  12. Kuffner JJ (1999) Autonomous agents for real-time animation. PhD thesis, Computer Science Dept., Stanford University, CA.Google Scholar
  13. Nielsen C, Kavraki LE (2000) A two-level fuzzy PRM for manipulation planning. In Proc. IEEE/RSJ Int. Conf. on Intelligent Robots and Systems.Google Scholar
  14. Quinlan S (1994) Efficient distance computation between non-convex objects. In Proc. Int. IEEE Conf. Robotics & Autom., pp 3324–3329.Google Scholar
  15. Sánchez G, Latombe JC (2002a) On delaying collision checking in PRM planning-application to multi-robot coordination. To appear in Int. J. of Robotics Research.Google Scholar
  16. Sánchez G, Latombe JC (2002b) Using a PRM planner to compare centralized and decoupled planning for multi-robot systems. In Proc. Int. IEEE Conf. Robotics & Autom., Washington, D.C.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Gildardo Sánchez
    • 1
  • Jean-Claude Latombe
    • 2
  1. 1.ITESMCuernavacaMexico
  2. 2.Computer Science DepartmentStanford UniversityStanfordUSA

Personalised recommendations