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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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.
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.
Bohlin R, Kavraki LE (2000) Path planning using lazy PRM. In Proc. IEEE Int. Conf. Robotics & Autom., San Francisco,CA.
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.
Casal A (2001) Reconfiguration planning for modular self-reconfigurable robots. PhD thesis, Aeronautics & Astronautics Dept., Stanford U., CA.
Gottschalk S, Lin M, Manocha D (1996) OBB-Tree: A hierarchical structure for rapid interference detection. In Proc. ACM SIGGRAPH’96, pp 171–180.
Hsu D (2000) Randomized single-query motion planning in expansive spaces. PhD thesis, Computer Science Dept., Stanford University, CA.
Hsu D, Latombe JC, Motwani R (1997) Path planning in expansive configuration spaces. In Proc. IEEE Int. Conf. Robotics & Autom., pp 2719–2726.
Kavraki LE (1994) Random networks in configuration space for fast path planning. PhD thesis, Computer Science Dept., Stanford University, CA.
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.
Kindel R (2001) Motion planning for free-flying robots in dynamic and uncertain environments. PhD thesis, Aeronaut. & Astr. Dept., Stanford University, CA.
Kuffner JJ (1999) Autonomous agents for real-time animation. PhD thesis, Computer Science Dept., Stanford University, CA.
Nielsen C, Kavraki LE (2000) A two-level fuzzy PRM for manipulation planning. In Proc. IEEE/RSJ Int. Conf. on Intelligent Robots and Systems.
Quinlan S (1994) Efficient distance computation between non-convex objects. In Proc. Int. IEEE Conf. Robotics & Autom., pp 3324–3329.
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.
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.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sánchez, G., Latombe, JC. (2003). A Single-Query Bi-Directional Probabilistic Roadmap Planner with Lazy Collision Checking. In: Jarvis, R.A., Zelinsky, A. (eds) Robotics Research. Springer Tracts in Advanced Robotics, vol 6. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36460-9_27
Download citation
DOI: https://doi.org/10.1007/3-540-36460-9_27
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00550-6
Online ISBN: 978-3-540-36460-3
eBook Packages: Springer Book Archive