Path planning using Lazy PRM

Proceedings-IEEE International Conference on Robotics and Automation

Volumn 1, Issue , 2000, Pages 521-528

  Bohlin, Robert ^a   Kavraki, Lydia E ^b  

^a CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

^b Rice University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARIADNE CLEW ALGORITHM; COLLISION CHECKS; GENETIC OPTIMIZATION; PROBABILISTIC ROADMAP PLANNERS;

ALGORITHMS; COLLISION AVOIDANCE; OPTIMIZATION; PROBABILITY; PROBLEM SOLVING; QUERY LANGUAGES; ROBOTICS; TREES (MATHEMATICS);

MOTION PLANNING;

EID: 0033705173     PISSN: 10504729     EISSN: None     Source Type: Journal    
DOI: 10.1109/ROBOT.2000.844107     Document Type: Article

References (29)

1. N.M. Amato, O.B. Bayazit, L.K. Dale, C. Jones, and D. Vallejo. Choosing good distance metrics and local planners for probabilistic roadmap methods. In Proc. IEEE Int. Conf., on Rob. & Aut., 1998.
2. N.M. Amato, O.B. Bayazit, L.K. Dale, C. Jones, and D. Vallejo. OBPRM: An obstacle-based PRM for 3D workspaces. In P. K. Agarwal, L. E. Kavraki, and M. Mason, editors, Robotics: The Algorithmic Perspective, pages 630-637. AK Peters, 1998.
3. N.M. Amato and Y. Wu. A randomized roadmap method for path and manipulation planning. In Proc. IEEE Int. Conf. on Rob. & Aut, pages 113-120, 1996.
4. J. Barraquand and J.C. Latombe. Robot motion planning: A distributed representation approach. Int. J. of Rob. Research, 10:628-649, 1991.
5. R. Bohlin. Motion Planning for Industrial Robots. Licentiate thesis, Chalmers University of Technology, 1999.
6. V. Boor, M.H. Overmars, and F. van der Stappen. The Gaussian sampling strategy for probabilistic roadmap planners. In Proc. IEEE Int. Conf. on Rob. & Aut., pages 1018-1023, 1999.
7. S. Cameron. Enhancing GJK: Computing minimum distance and penetration distanses between convex polyhedra. In Proc. IEEE Int. Conf. on Rob. & Aut, pages 3112-3117, 1997.
8. J.F. Canny. The Complexity of Robot Motion Planning. MIT Press, Cambridge, MA, 1988.
9. B. Glavina. Solving findpath by combination of goal-directed and randomized search. In Proc. IEEE Int. Conf. on Rob. & Aut., pages 1718-1723, 1990.
10. K. Gupta and A. P. del Pobil. Practical Motion Planning in Robotics. John Wiley, West Sussex, England, 1998.
11. T. Horsch, F. Schwarz, and H. Tolle. Motion planning for many degrees of freedom-random reflections at C-space obstacles. In Proc. IEEE Int. Conf. on Rob. & Aut., pages 3318-3323, 1994.
12. D. Hsu, L.E. Kavraki, J.C. Latombe, R. Motwani, and S. Sorkin. On finding narrow passages with probabilistic roadmap planners. In P. Agarwal, L. Kavraki, and M. Mason, editors, Robotics: The Algorithmic Perspective, pages 141-154. A K Peters, 1998.
13. D. Hsu, J. C. Latombe, and R. Motwani. Path planning in expansive configuration spaces. In Proc. IEEE Int. Conf. on Rob. & Aut., pages 2719-2726, 1997.
14. Y.K. Hwang and N. Ahuja. Gross motion planning-a survey. ACM Comp. Surveys, 24(3):219-291, 1992.
15. P. Isto. A two-level search algorithm for motion planning. In Proc. IEEE Int. Conf. on Rob. & Aut., pages 2025-2031, 1997.
16. R.A. Johnson and D.W. Wichern. Applied Multivariate Statistical Analysis. Prentice Hall, New Jersey, 1998.
17. L.E. Kavraki and J.C. Latombe. Randomized preprocessing of configuration space for fast path planning. In Proc. IEEE Int. Conf. on Rob. & Aut., pages 21382145, 1994.
18. L.E. Kavraki, P. Svestka, J.C. Latombe, and M. Over-mars. Probabilistic roadmaps for fast path planning in high dimensional configuration spaces. IEEE Tr. on Rob. & Aut., 12:566-580, 1996.
19. Y. Koga, K. Kondo, J. Kuffner, and J.C. Latombe. Planning motions with intentions. Computer Graphics (SIGGRAPH'94), pages 395-408, 1994.
20. J.C. Latombe. Robot Motion Planning. Kluwer, Boston, MA, 1991.
21. J.C. Latombe. Motion planning: A journey of robots, molecules, digital actors, and other artifacts. Int. J. of Rob. Research, 18(11):1119-1128, 1999
22. S.M. LaValle and J.J. Kuffner. Randomized kinody-namic planning. In Proc. IEEE Int. Conf. on Rob. & Aut., pages 473-479, 1999.
23. M.C. Lin and J.F. Canny. A fast algorithm for incremental distance computation. In Proc. IEEE Int. Conf. on Rob. & Aut., pages 1008-1014, 1991.
24. E. Mazer, J.M. Ahuactzin, and P. Bessiere. The Ariadne's clew algorithm. J. of Art. Intelligence Research, 9:295-316, 1998.
25. C. L. Nielsen and L.E. Kavraki. A two level fuzzy PRM for manipulation planning. Technical Report TR2000-365, Rice University, 2000.
26. M. Overmars. A random approach to motion planning. Technical Report RUU-CS-92-32, Utrecht University, the Netherlands, 1992.
27. M. Overmars and P. Svestka. A probabilistic learning approach to motion planning. In K.Y. Goldberg, D. Halperin, J.C. Latombe, and R.H. Wilson, editors, Algorithmic Foundations of Robotics, pages 19-37. A K Peters, 1995.
28. F.Thomas and C. Torras. Interference detection between non-convex polyhedra revisited with a practical aim. In Proc. IEEE Int. Conf. on Rob. & Aut, 1994.
29. S.A. Wilmarth, N.M. Amato, and P.F. Stiller. MAPRM: A probabilistic roadmap planner with sampling on the medial axis of the free space. In Proc. IEEE Int. Conf. on Rob. & Aut, pages 1024-1031, 1999.