Autonomous Robots

, Volume 19, Issue 3, pp 301–319 | Cite as

Finding Narrow Passages with Probabilistic Roadmaps: The Small-Step Retraction Method

  • Mitul Saha
  • Jean-Claude Latombe
  • Yu-Chi Chang
  • Friedrich Prinz

Abstract

Probabilistic Roadmaps (PRM) have been successfully used to plan complex robot motions in configuration spaces of small and large dimensionalities. However, their efficiency decreases dramatically in spaces with narrow passages. This paper presents a new method—small-step retraction—that helps PRM planners find paths through such passages. This method consists of slightly “fattening” robot's free space, constructing a roadmap in fattened free space, and finally repairing portions of this roadmap by retracting them out of collision into actual free space. Fattened free space is not explicitly computed. Instead, the geometric models of workspace objects (robot links and/or obstacles) are “thinned” around their medial axis. A robot configuration lies in fattened free space if the thinned objects do not collide at this configuration. Two repair strategies are proposed. The “optimist” strategy waits until a complete path has been found in fattened free space before repairing it. Instead, the “pessimist” strategy repairs the roadmap as it is being built. The former is usually very fast, but may fail in some pathological cases. The latter is more reliable, but not as fast. A simple combination of the two strategies yields an integrated planner that is both fast and reliable. This planner was implemented as an extension of a pre-existing single-query PRM planner. Comparative tests show that it is significantly faster (sometimes by several orders of magnitude) than the pre-existing planner.

Keywords

motion planning probabilistic roadmaps narrow passages sampling strategies 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Akinc, M., Bekris, K.E., Chen, B.Y., Ladd, A.M., Plaku, E., and Kavraki, L.E. 2003. Probabilistic Roadmaps of Trees for Parallel Computation of Multiple Query Roadmaps. In Proc 11th Int. Symp. on Robotics Research, Siena, Italy, pp. 19–22.Google Scholar
  2. Amato, N.M., Bayazit, O.B., Dale, L.K., Jones, C., and Vallejo, D. 1998. OBPRM: An obstacle-based PRM for 3D workspace. In P.K. Agarwal et al. (eds.), Robotics: The Algorithmic Perspective, A K Peters, Natick, MA, pp. 155–168.Google Scholar
  3. Amenta, N., Choi, S., and Kolluri, R. 2001. The power crust. In Proc. 6th ACM Symp. on Solid Modeling and Applications, pp. 249–260.Google Scholar
  4. Ahuactzin, J.M. and Gupta, K.K. 1999. The kinematic roadmap: A Motion Planning Based Global Approach for Inverse Kinematics of Redundant Robots. IEEE Tr. on Robotics and Automation, 15(4):653–669.Google Scholar
  5. Amato, N.M. and Wu, Y. 1996. A Randomized Roadmap Method for Path and Manipulation Planning. In Proc. IEEE Int. Conf. on Robotics and Automation, Minneapolis, MN, pp. 113–120.Google Scholar
  6. Baginski, B. 1997. Local Motion Planning for Manipulators Based on Shrinking and Growing Geometry Models. In Proc. IEEE Int. Conf. on Robotics and Automation, Minneapolis, MN, pp. 3303–3308.Google Scholar
  7. Bohlin, R. and Kavraki, L.E. 2000. Path planning using lazy PRM. In Proc. IEEE Int. Conf. Robotics and Automation, San Francisco, CA.Google Scholar
  8. Bretl, T., Latombe, J.C., and Rock, S. 2003. Toward Autonomous Free-Climbing Robots. In 11th Int. Symp. on Robotics Research, Siena, Italy, pp. 19–22.Google Scholar
  9. Blum, H. 1967. A Transformation for Extracting New Descriptors of Shape. In W. Wathen-Dunn (ed.), Models for the Perception of Speech and Visual Form, MIT Press, Cambridge, MA, pp. 326–380.Google Scholar
  10. Boor, V., Overmars, M.H., and van der Strappen, A.F. 1999. The Gaussian Sampling Strategy for Probabilistic Roadmap Planners. In Proc. IEEE Int. Conf. on Robotics and Automation, Detroit, MI. pp. 1018–1023.Google Scholar
  11. Cohen, J., Lin, M., Manocha, D., and Ponamgi, M. 1995. I-Collide: An Interactive and Exact Collision Detection System for Large Scale Environments. In Proc. ACM Interactive 3D Graphics Conf., pp. 189–196.Google Scholar
  12. Chang, Y.C., Pinilla, J.M., Ramaswami, K., and Prinz, F. 2004. Near parallel computation of MAT of 3D polyhedra. In preparation.Google Scholar
  13. Cortés, J., Siméon, T., and Laumond, J.P. 2002. A Random Loop Generator for Planning the Motions of Closed Kinematic Chains Using PRM methods. In Proc. IEEE Int. Conf. on Robotics and Automation, pp. 2141–2146.Google Scholar
  14. Danner, T. and Kavraki, L.E. 2000. Randomized Planning for Short Inspection Paths. In Proc. IEEE Int. Conf. on Robotics and Automation, San Fransisco, CA, pp. 971–976.Google Scholar
  15. Dey, T.K. and Zhao, W. 2002. Approximate medial axis as a voronoi subcomplex. In Proc. 7th ACM Symp. on Solid Modeling and Applications, pp. 356–366.Google Scholar
  16. Foskey, M., Lin, M., and Manocha, D. 2003. Efficient computation of a simplified medial axis. In Proc. ACM Symposium on Solid Modeling and Applications.Google Scholar
  17. Guibas, L., Holleman, C., and Kavraki, L. 1999. A Probabilistic Roadmap Planner for Flexible Objects with a Workspace Medial-Axis Based Sampling Approach. In Proc. IEEE Int. Conf. on Intelligent Robots and Systems.Google Scholar
  18. Gottschalk, S., Lin, M., and Manocha, D. 1996. OBB-Tree: A Hierarchical Structure for Rapid Interference Detection. In Proc. ACM SIGGRAPH'96, pp. 171–180.Google Scholar
  19. Han, L. and Amato, N.M. 2001. A Kinematics-Based Probabilistic Roadmap Method for Closed Chain Systems. In B.R. Donald, K.M. Lynch, and D. Rus (eds.), Algorithmic and Computational Robotics: New Directions, A K Peters, Natick, MA, pp. 233–246.Google Scholar
  20. Hoff, K., Culver, T., Keyser, J., Lin, M., and Manocha, D. 1999. Fast Computation of Generalized Voronoi Diagrams Using Graphics Hardware. In Proc. SIGGRAPH '99, pp. 277–286.Google Scholar
  21. Hoff III, K.E., Culver, T., Keyser, J., Lin, M., and Manocha, D. 2000. Interactive Motion Planning Using Hardware-Accelerated Computation of Generalized Voronoi Diagrams. In Proc. IEEE Int. Conf. on Robotics and Automation, San Francisco, CA.Google Scholar
  22. Hsu, D., Jiang, T., Reif, J., and Sun, Z. 2003. The Bridge Test for Sampling Narrow Passages with Probabilistic Roadmap Planners. In Proc. IEEE Int. Conf. on Robotics and Automation, pp. 4420–4426.Google Scholar
  23. Holleman, C. and Kavraki, L. 2000. A Framework for Using the Workspace Medial Axis in PRM planners. In Proc. IEEE Int. Conf. on Robotics and Automation, San Francisco, CA, pp. 1408–1413.Google Scholar
  24. Hsu, D., Kavraki, L., Latombe, J.C., Motwani, R., and Sorkin, S. 1998. On Finding Narrow Passages with Probabilistic Roadmap Planners. In P.K. Agarwal et al. (eds.), Robotics: The Algorithmic Perspective, A K Peters, Natick, MA, pp. 151–153.Google Scholar
  25. Hsu, D., Kindel, R., Latombe, J.C., and Rock, S. 2002. Randomized Kinodynamic Motion Planning with Moving Obstacles. Int. J. of Robotics Research, 21(3):233-255.Google Scholar
  26. Hsu, D., Latombe, J.C., and Motwani, R. 1999. Path Planning in Expansive Configuration Spaces. Int. J. of Computational Geometry and Applications, 9(4/5):495–512.MathSciNetGoogle Scholar
  27. Hoffman, C. 1994. How to construct the skeleton of CSG Objects. In A. Bowyer (ed.), Computer-Aided Surface Geometry and Design, Oxford University Press, pp. 421–437.Google Scholar
  28. Isto, P. 2002. Constructing Probabilistic Roadmaps with Powerful Local Planning and Path Optimization. In Proc. IEEE/RSJ Int. Conf. on Intelligent Robots and Systems, pp. 2323–2328.Google Scholar
  29. Ji, X. and Xiao, J. 2001. Planning Motion Compliant to Complex Contact States. In Proc. 2001 IEEE Int. Conf. on Robotics and Automation, Seoul, Korea.Google Scholar
  30. Kavraki, L.E., Kolountzakis, M., and Latombe, J.C. 1998. Analysis of Probabilistic Roadmaps for Path Planning. IEEE Tr. on Robotics and Automation, 14(1):166–171.Google Scholar
  31. Kavraki, L.E., Latombe, J.C., Motwani, R., and Raghavan, P. 1998. Randomized Query Processing in Robot Motion Planning. Journal of Computer and System Sciences, 57(1):50–60.CrossRefMathSciNetGoogle Scholar
  32. Kavraki, L.E., Svestka, P., Latombe, J.C., and Overmars, M.H. 1996. Probabilistic Roadmaps for Path Planning in High-Dimensional Configuration Spaces. IEEE Tr. on Robotics and Automation, 12(4):566–580.Google Scholar
  33. LaValle, S.M. and Kuffner, J.J. 2001. Randomized kinodynamic planning. Int. J. of Robotics Research, 20(5):278–300.Google Scholar
  34. Lin, M. and Manocha, D. 2004. Collision and proximity queries. In J.E. Goodman and J. O'Rourke (eds.), Handbook of Discrete and Computational Geometry, Chapman&Hall/CRC, 2nd edition, Chapter 35, pp. 787–807.Google Scholar
  35. Lien, J.M., Thomas, S.L., and Amato, N.M. 2003. A General Framework for Sampling on the Medial Axis of the Free Space. In Proc. IEEE Int. Conf. on Robotics and Automation.Google Scholar
  36. LaValle, S.M., Yakey, J., and Kavraki, L. 1999. A Probabilistic Roadmap Approach for Systems with Closed Kinematic Chains. In Proc. IEEE Int. Conf. on Robotics and Automation, Detroit, MI, pp. 151–156.Google Scholar
  37. Quinlan, S. 1994. Efficient Distance Computation Between Non-Convex Objects. In Proc. IEEE Int. Conf. On Robotics and Automation, pp. 3324–3329.Google Scholar
  38. Sánchez-Ante, G. and Latombe, J.C. 2002. A single-query bi-directional probabilistic roadmap planner with lazy collision checking. Int. J. of Robotics Research.Google Scholar
  39. Wilmarth, S.A., Amato, N.M., and Stiller, P.F. 1999. MAPRM: A Probabilistic Roadmap Planner with Sampling on the Medial Axis of the Free Space. Proc. IEEE Int. Conf. on Robotics and Automation Detroit, MI, pp. 1024–1031.Google Scholar

Copyright information

© Springer Science + Business Media, Inc. 2005

Authors and Affiliations

  • Mitul Saha
    • 1
  • Jean-Claude Latombe
    • 1
  • Yu-Chi Chang
    • 2
  • Friedrich Prinz
    • 2
  1. 1.Computer Science DepartmentStanford UniversityStanfordUSA
  2. 2.Department of Mechanical EngineeringStanford UniversityStanfordUSA

Personalised recommendations