Finding narrow passages with probabilistic roadmaps: The small-step retraction method

Autonomous Robots

Volumn 19, Issue 3, 2005, Pages 301-319

  Saha, Mitul ^a   Latombe, Jean Claude ^a,b   Chang, Yu Chi ^a,c   Prinz, Friedrich ^a,c,d,e,f,g  

^a Stanford University   (United States)

^b School of Engineering   (United Kingdom)

^c STANFORD UNIVERSITY   (United States)

^d Department of Engineering ^*

^e NATIONAL RESEARCH COUNCIL   (United States)

^f Japanese Technology Evaluation Center   (Japan)

^g Portuguese Science and Technology Foundation   (Portugal)

Author keywords

Motion planning; Narrow passages; Probabilistic roadmaps; Sampling strategies

Indexed keywords

NARROW PASSAGES; PROBABILISTIC ROADMAPS (PRM); ROBOT MOTIONS; SAMPLING STRATEGIES;

MOTION PLANNING; PATHOLOGY; PROBABILITY;

ROBOTS;

EID: 30344482560     PISSN: 09295593     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10514-005-4748-1     Document Type: Article

References (39)

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.
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.
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.
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.
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.
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.
7. Bohlin, R. and Kavraki, L.E. 2000. Path planning using lazy PRM. In Proc. IEEE Int. Conf. Robotics and Automation, San Francisco, CA.
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.
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. 326380.
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.
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.
12. Chang, Y.C., Pinilla, J.M., Ramaswami, K., and Prinz, F. 2004. Near parallel computation of MAT of 3D polyhedra. In preparation.
13. Cortés, J., Simeon, 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.
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.
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.
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.
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.
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.
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.
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.
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.
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.
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.
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.
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.
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.
27. Hoffman, C. 1994. How to construct the skeleton of CSG Objects. In A. Bowyer (ed.), Compute r-Aided Surface Geometry and Design, Oxford University Press, pp. 421-437.
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.
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.
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.
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, 51(1):50-60.
32. Kavraki, L.E., Svestka, P., Latombe, J.C., and Overman, M.H. 1996. Probabilistic roadmaps for path planning in high-dimensional configuration spaces. IEEE Tr. on Robotics and. Automation, 12(4):566-580.
33. LaValle, S.M. and Kuffner, JJ. 2001. Randomized kinodynamic planning. Int. J. of Robotics Research, 20(5):278-300.
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.
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.
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.
37. Quinlan, S. 1994. Efficient distance computation between nonconvex objects. In Proc. IEEE Int. Conf. On Robotics and. Automation, pp. 3324-3329.
38. Sánchez-Ante, G. and Latombe, J.C. 2002. A single-query bidirectional probabilistic roadmap planner with lazy collision checking. Int. J. of Robotics Research.
39. Wilmarth, S.A., Amato, N.M., and Stiller, PR 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.