On delaying collision checking in PRM planning: Application to multi-robot coordination

International Journal of Robotics Research

Volumn 21, Issue 1, 2002, Pages 5-26

  Sánchez, Gildardo ^a   Latombe, Jean Claude ^b  

^a SCHOOL OF ENGINEERING AND SCIENCES   (Mexico)

^b Stanford University   (United States)

Author keywords

Lazy collision checking; Motion planning; Multi robot coordination; Probabilistic roadmaps

Indexed keywords

ALGORITHMS; COLLISION AVOIDANCE; MOTION PLANNING; SAMPLING;

PROBABLISTIC ROADMAP (PRM);

MOBILE ROBOTS;

EID: 0036458038     PISSN: 02783649     EISSN: None     Source Type: Journal    
DOI: 10.1177/027836402320556458     Document Type: Article

References (92)

1. Agarwal, P.K. 1997. Range searching. In Handbook of Discrete and Computational Geometo, ed. J.E. Goodman and J. O'Rourke, 575-598. CRC Press.
2. Ahuactzin, J.M. 1994. Le Fil d'Ariane. Une méthode de planification générale. Application à la planification de trajectoires. PhD Thesis, National Polytechnic Institute of Grenoble, France.
3. 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.
4. Alami, R., Robert, F., Ingrand, F.F., and Suzuki, S. 1995. Multi-robot cooperation through incremental planmerging. Proc. IEEE Int. Conf. on Robotics and Automation, Nagoya, Japan, pp. 2573-2578.
5. Amato, N.M., Bayazit, O.B., Dale, L.K., Jones, C., and Vallejo, D. 1998. OBPRM: An obstacle-based PRM for 3D workspace. In Robotics: The Algorithmic Perspective, eds. P.K. Agarwal et al., 155-168. Natick, MA: A.K. Peters.
6. Amato, N.M., Bayazit, O.B., Dale, L.K., Jones, C., and Vallejo, D. 2000. Choosing good distance metrics and local planners for probabilistic roadmap methods. IEEE Tr. on Robotics and Automation 16(4):442-447.
7. Amato, N.M., and Wu, Y. 1996. A randomized roadmap method for path and manipulation planning. Proc. IEEE Int. Conf. on Robotics and Automation, Minneapolis, MN, pp. 113-120.
8. Apaydin, M.S., Brutlag, D., Guestrin, C., Hsu, D., and Latombe, J.C. 2002. Stochastic roadmap simulation: An efficient representation and algorithm for analyzing molecular motion. Proc. 6th Annual Conf. on Research in Computational Molecular Biology (RECOMB'02), Washington D.C., pp. 12-21.
9. Aronov, B., De Berg, M., Van der Stappen, A.F., Švestka, P., and Vleugels, J. 1999. Motion planning for multiple robots. Discrete and Computational Geometry 22:505-525.
10. Baginski, B. 1996. The Z3-method for fast path planning in dynamic environments. Proc. IASTED Conf. Applications of Control and Robotics, Orlando, FL, pp. 47-52.
11. Baginski, B. 1997. Local motion planning for manipulators based on shrinking and growing geometry models. Proc. IEEE Int. Conf. on Robotics and Automation, Minneapolis, MN, pp. 3303-3308.
12. Baraff, D. 1990. Curved surfaces and coherence of non-penetrating rigid body simulation. ACM Computer Graphics 24(4): 19-28.
13. Barraquand, J., Kavraki, L.E., Latombe, J.C., Li, T.Y., Motwani, R., and Raghavan, P. 1997. A random sampling scheme for path planning. International Journal of Robotics Research 16(6):759-774.
14. Barraquand, J., and Latombe, J.C. 1991. Robot motion planning: A distributed representation approach. International Journal of Robotics Research 10(6):628-649.
15. Barraquand, J., Langlois, B., and Latombe, J.C. 1992. Numerical potential field techniques for robot path planning. IEEE Tr. on Systems, Man, and Cybernetics 22(2):224-241.
16. Bohlin, R., and Kavraki, L.E. 2000. Path planning using lazy PRM. Proc. IEEE International Conf. Robotics and Automation, San Francisco, CA.
17. Bonert, M., Shu, L.H., and Benhabib, B. 1999. Motion planning for multi-robot assembly systems. Proc. ASME Design Engineering Technical Conf., Las Vegas, NE.
18. Boor, V., Overmars, M.H., van der Strappen, A.F. 1999. The Gaussian sampling strategy for probabilistic roadmap planners. Proc. IEEE Int. Conf. on Robotics and Automation, Detroit, MI, pp. 1018-1023.
19. Buckley, S.J. 1989. Fast motion planning for multiple moving robots. Proc. IEEE Int. Conf. on Robotics and Automation, Scottsdale, AZ, pp. 1419-1424.
20. Casal, A. 2001. Reconfiguration Planning for Modular Self Reconfigurable Robots. PhD Thesis and Aeronautics & Astronautics Dept., Stanford University, Stanford, CA.
21. Chang, H., and Li, T.Y. 1995. Assemblability and maintainability study with motion planning. Proc. IEEE Int. Conf. on Robotics and Automation, pp. 1012-1019.
22. Choi, M.G., Lee, J., and Shin, S.Y. 2000. A Probabilistic Approach to Planning Biped Locomotion with Prescribed Motions. Tech. Rep. CS-TR-2000-162, Computer Science Dept., Korea Advanced Institute of Science & Technology.
23. Cohen, J., Lin, M., Manocha, D., and Ponamgi, M. 1995. I-collide: An interactive and exact collision detection system for large scale environments. Proc. ACM Interactive 3D Graphics Conf, pp. 189-196.
24. Erdmann, M.A., and Lozano-Perez, T. 1987. On multiple moving objects. Algorithmica 2(4):477-521.
25. Faverjon, B. 1989. Hierarchical object models for efficient anti-collision algorithms. Proc. IEEE Int. Conf. on Robotics and Automation, Scottsdale, AZ, pp. 333-340.
26. Frazzoli, E., Dahieh, M.A., and Feron, E. 2000. Real-time motion planning for agile autonomous vehicles. Proc. 2000 AIAA Conf. on Guidance, Navigation and Control, Paper AIAA 2000-4056, Denver, CO.
27. Gottschalk, S., Lin M., and Manocha, D. 1996. OBB-tree: A hierarchical structure for rapid interference detection. Proc. ACM Siggraph'96, pp. 171-180.
28. Guibas, L., Holleman, C., and Kavraki, L. 1999. A probabilistic roadmap planner for flexible objects with a workspace medial-axis based sampling approach. Proc. IEEE International Conf. on Intelligent Robots and Systems.
29. Han, L., and Amato, N.M. 2001. A kinematics-based probabilistic roadmap method for closed chain systems. In Algorithmic and Computational Robotics: New Directions, eds. B.R. Donald, K.M. Lynch, and D. Rus, pp. 233-246. Natick, MA: A.K. Peters.
30. 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. Proc. IEEE Int. Conf. on Robotics and Automation, San Francisco, CA.
31. Holleman, C., and Kavraki, L. 2000. A framework for using the workspace medial axis in PRM planners, Proc. IEEE Int. Conf. on Robotics and Automation, San Francisco, CA, pp. 1408-1413.
32. Holleman, C., KavraKi, L., and Warren, J. 1998. Planning paths for a flexible surface patch. Proc. IEEE Int. Conf. on Robotics and Automation, pp. 21-26.
33. Horsch, T., Schwarz, E., and Tolle, H. 1994. Motion planning for many degrees of freedom-random reflections at C-space obstacles. Proc. IEEE Int. Conf on Robotics and Automation, pp. 3318-3323.
34. Hsu, D. 2000. Randomized Single-Query Motion Planning in Expansive Spaces. PhD Thesis, Computer Science Dept., Stanford University, Stanford, CA.
35. Hsu, D., Kavraki, L., Latombe, J.C., Motwani, R., and Sorkin, S. 1998. On finding narrow passages with probabilistic roadmap planners. In Robotics: The Algorithmic Perspective, eds. P.K. Agarwal et al., 151-153. Natick, MA: A.K. Peters.
36. Hsu, D., Latombe, J.C., and Motwani, R. 1997, 1999. Path planning in expansive configuration spaces. Proc. IEEE Int. Conf. Robotics and Automation, pp. 2719-2726. A revised version of this paper can be found in Int. J. of Computational Geometry and Applications 9(4-5):495-512.
37. Hsu, D., Latombe, J.C., and Motwani, R. 1997, 1999. Path planning in expansive configuration spaces. Proc. IEEE Int. Conf. Robotics and Automation, pp. 2719-2726. A revised version of this paper can be found in Int. J. of Computational Geometry and Applications 9(4-5):495-512.
38. Hsu, D., Latombe, J.C., Motwani, R., and Kavraki, L.E. 1999. Capturing the connectivity of high-dimensional geometric spaces by parallelizable random sampling techniques. In Advances in Randomized Parallel Computing, eds. P.M. Pardalos and S. Rajasekaran, pp. 159-182, Combinatorial Optimization Series, Boston, MA: Kluwer.
39. Hsu, D., Latombe, J.C., and Sorkin, S. 1999. Placing a robot manipulator amid obstacles for optimized execution. Proc. IEEE Int. Symp. on Assembly and Task Planning (ISATP'99), Porto, Portugal, pp. 280-285.
40. Hwang, Y.K., Xavier, P.G., Chen, P.C., and Wattergerg, P.A. 1998. Motion planning with SANDROS and the configuration space toolkit. In Practical Motion Planning in Robotics, eds. K.K. Gupta and A.P. del Pobil, pp. 55-77, John Wiley & Sons.
41. Hubbard, P.M. 1995. Collision Detection for Interactive Graphics Applications. PhD Thesis, Computer Science Dept., Brown University, Providence, RI.
42. Ji, X., and Xiao, J. 2001. Planning motion compliant to complex contact states. Proc. 2001 IEEE Int. Conf. on Robotics and Automation, Seoul, Korea.
43. Kant, K.G., and Zucker, S.W. 1986. Toward efficient trajectory planning: path velocity decomposition. International Journal of Robotics Research 5:72-89.
44. Kavraki, L.E. 1994. Random Networks in Configuration Space for Fast Path Planning. PhD Thesis, Computer Science Dept., Stanford University, Stanford, CA.
45. 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.
46. 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.
47. Kindel, R. 2001. Motion Planning for Free-Flying Robots in Dynamic and Uncertain Environments. PhD Thesis, Aeronautics & Astronautics Dept., Stanford University, Stanford, CA.
48. Kindel, R., Hsu, D., Latombe, J.C., Rock, S. 2000. Kinodynamic motion planning amidst moving obstacles. Proc. IEEE Int. Conf. on Robotics and Automation, San Francisco, CA, pp. 537-543.
49. Klosowski, J., Held, M., Mitchell, J.S.B., Sowizral, H., and Zikan, K. 1998. Efficient collision detection using bounding volume hierarchies of k-dops. IEEE Trans. On Visualization and Computer Graphics 4(1): 21-37.
50. Koga, Y., Kondo, K., Kuffner, J., and Latombe, J.C. 1994. Planning motions with intentions. Proc. Siggraph'94, pp. 395-408.
51. Koga, Y., and Latombe, J.C. 1994. On multi-arm manipulation planning. Proc. IEEE Int. Conf on Robotics and Automation, San Diego, CA, pp. 945-952.
52. Krishnan, S., Pattekar, A., Lin, M., and Manocha, D. 1998. Spherical shell: A higher order bounding volume for fast proximity queries. In Robotics: The Algorithmic Perspective, eds. P.K. Agarwal et al., pp. 177-190. Natick, MA: A.K. Peters.
53. Kuffner, J.J. Jr. 1999. Autonomous Agents for Real-Time Animation. PhD Thesis, Computer Science Dept., Stanford University, Stanford, CA.
54. Kuffner, J.J., Nishiwaki, K., Kagami, S., Inaba, M., and Inoue, H. 2001. Motion planning for humanoid robots under obstacle and dynamic balance constraints. Proc. IEEE 2001 Int. Conf. on Robotics and Automation, Seoul, Korea.
55. Ladd, A., and Kavraki, L.E. 2002. A Measure Theoretic Analysis of PRM. Manuscript.
56. Lamiraux, F., and Kavraki, L.E. 2001. Planning paths for elastic objects under manipulation constraints, International Journal of Robotics Research 20(3): 188-208.
57. Latombe, J.C. 1991. Robot Motion Planning. Boston, MA: Kluwer.
58. Laumond, J.P., and Siméon, T. 2001. Notes on visibility roadmaps and path planning. In Algorithmic and Computational Robotics: New Directions, eds. B.R. Donald, K.M. Lynch, and D. Rus, pp. 317-328. Natick, MA: A.K. Peters.
59. LaValle, S.M., and Kuffner, J.J. 1999. Randomized kinodynamic planning. Proc. IEEE Int. Conf on Robotics and Automation, Detroit, MI, pp. 473-479.
60. LaValle, S.M., and Kuffner, J.J. 2001. Randomized kinodynamic planning. International Journal of Robotics Research 20(5):278-300.
61. LaValle, S.M., Yakey, J., and Kavraki, L. 1999. A probabilistic roadmap approach for systems with closed kinematic chains. Proc. IEEE Int. Conf. on Robotics and Automation, Detroit, MI, pp. 151-156.
62. Leroy, S., Laumond, J.P., and Siméon, T. 1999. Multiple path coordination for mobile robots: A geometric algorithm. Proc. 16th Int. Joint Conf on Artificial Intelligence, Stockholm, Sweden.
63. Lin, M.C. 2000. Fast and accurate collision detection for virtual environments. Proc. IEEE Scientific Visualization Conf.
64. Lin, M.C., and Canny, J. 1991. A fast algorithm for incremental distance calculation. Proc. IEEE Int. Conf. on Robotics and Automation, pp. 1008-1014.
65. Mirtich, B. 1998. V-clip: Fast and robust polyhedral collision detection. ACM Tr. on Graphics 17(3):177-208.
66. Nielsen, C., and Kavraki, L. 2000. A two-level fuzzy PRM for manipulation planning. Proc. IEEE/RSJ Int. Conf. on Intelligent Robots and Systems.
67. Nissoud, C., Simeon, T., and Laumond, J.P. 1999. Visibility based probabilistic roadmaps. Proc. IEEE Int. Conf. on Intelligent Robots and Systems, Detroit, MI, pp. 1316-1321.
68. O'Donnell, P.A., and Lozano-Perez, T. 1989. Deadlock-free and collision-free coordination of two robot manipulators. Proc. IEEE Int. Conf. Robotics and Automation, pp. 484-489.
69. Overmars, M. 1992. A Random Approach to Motion Planning. Tech. Rep. RUU-CS-92-32. Computer Science Dept., TB Utrecht, The Netherlands.
70. Palmer, L.J., and Grimsdale, R.L. 1995. Collision detection for animation using sphere-trees. Computer Graphics Forum 14(2): 105-116.
71. Del Pobil, A.P., Serna, M.A., and Iovet, J. 1992. A new representation for collision avoidance and detection. Proc. IEEE Int. Conf. On Robotics and Automation, pp. 246-251.
72. Quinlan, S. 1994. Efficient distance computation between non-convex objects. Proc. IEEE Int. Conf. On Robotics and Automation, pp. 3324-3329.
73. Sánchez-Ante, G. 2002. Single-Query Bi-Directional Motion Planning with Lazy Collision Checking, PhD Thesis, ITESM, Campus Cuernavaca, Mexico.
74. Sánchez-Ante, G., and Latombe, J.C. 2001. Single-query bi-directional motion planning with lazy collision checking. Proc. 10th Int. Symp. On Robotics Research, Lorne, Australia.
75. Sánchez-Ante, G., and Latombe, J.C. 2002. Using a PRM planner to compare centralized and decoupled planning for multi-robot systems. Proc. IEEE Int. Conf. on Robotics and Automation, Washington D.C.
76. Schwartz, J.T., and Sharir, M. 1983. In the piano mover's problem: III. Coordinating the motion of several independent bodies: The special case of circular bodies moving amidst polygonal barriers. International Journal of Robotics Research 2(3):46-75.
77. Sekhavat, S., Švetska, P., Laumond, J.P., and Overmars, M. 1998. Multilevel path planning for nonholonomic robots using semiholonomic subsystems. International Journal of Robotics Research 17:840-857.
78. Simeon, T., Laumond, J.P., and Lamiraux, F. 2001. Move3D: A generic platform for motion planning. Proc. IEEE Int. Symp. on Assembly and Task Planning.
79. Singh, A.P., Latombe, J.C., and Brutlag, D.L. 1999. A motion planning approach to flexible ligand binding. Proc. 7th Int. Conf. on Intelligent Systems for Molecular Biology (ISMB) pp. 252-261. Menlo Park, CA: AAAI Press.
80. Song, G., and Amato, N.M. 2001. Using motion planning to study protein folding pathways. Proc. 5th International Conf. on Computational Molecular Biology (RECOMB'01), pp. 287-296.
81. Song, G., Miller, S., and Amato, N. 2001. Customizing PRM roadmaps at query time. Proc. IEEE Int. Conf. On Robotics and Automation, Seoul, Korea.
82. Spitz, S.N., and Requicha, A.A.G. 2000. Multiple-goals path planning for coordinate measuring machines. Proc. IEEE Int. Conf. On Robotics and Automation, San Francisco, CA.
83. Van der Stappen, A.F., Halperin, D., and Overmars, M.H. 1993. The complexity of the free space for a robot moving amidst fat obstacles. Computational Geometry: Theory and Applications 3:353-373.
84. Sundaram, S., Remmler, I., and Amato, N.M. 2001. Disassembly sequencing using a motion planning approach. Proc. IEEE Int. Conf. on Robotics and Automation, pp. 1475-1480.
85. Švetska, P. 1997. Robot Motion Planning Using Probabilistic Roadmaps, PhD Thesis, Utrecht University.
86. Švetska, P., and Overmars, M. 1995. Coordinated motion planning for multiple car-like robots using probabilistic roadmaps. Proc. IEEE Int. Conf. Robotics and Automation, Nagoya, Japan, pp. 1631-1636.
87. Tombropoulos, R.Z., Adler, J.R., and Latombe, J.C. 1999, CARABEAMER: A treatment planner for a robotic radiosurgical system with general kinematics. Medical Image Analysis 3(3):237-264.
88. Tournassoud, P. 1986. A strategy for obstacle avoidance and its application to multi-robot systems. Proc. IEEE Int. Conf. on Robotics and Automation, San Francisco, CA, pp. 1224-1229.
89. Vallejo, D., Remmler, I., Amato, N.M. 2001. An adaptive framework for "single shot" motion planning: A self-tuning system for rigid and articulated robots. Proc. IEEE Int. Conf. on Robotics and Automation, Seoul, Korea, pp. 21-26.
90. Warren, C.W. 1990. Multiple robot path coordination using artificial potential fields, Proc. IEEE Int. Conf. on Robotics and Automation, Cincinnati, OH, pp. 500-505.
91. 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.
92. Wuril, C., Henrich, D., and Worn, H. 1999. Multi-goal path planning for industrial robots. Proc. Int. Conf. Robotics and Application, Santa Barbara, CA.