Sampling and node adding in probabilistic roadmap planners

Robotics and Autonomous Systems

Volumn 54, Issue 2, 2006, Pages 165-173

  Geraerts, Roland ^a,b   Overmars, Mark H ^a,b  

^a UTRECHT UNIVERSITY   (Netherlands)

^b Utrecht University in the Netherlands ^*  (Netherlands)

Author keywords

Comparative study; Motion planning; Node adding techniques; PRM; Sampling techniques

Indexed keywords

COMPARATIVE STUDY; NODE ADDING TECHNIQUES; PRM; SAMPLING TECHNIQUES;

ARTIFICIAL INTELLIGENCE; COLLISION AVOIDANCE; INDUSTRIAL ROBOTS; STATISTICAL METHODS;

MOTION PLANNING;

EID: 30944454079     PISSN: 09218890     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.robot.2005.09.026     Document Type: Conference Paper

References (42)

1. N.M. Amato, O. Bayazit, L. Dale, C. Jones, D. Vallejo, Choosing good distance metrics and local planners for probabilistic roadmap methods, in: IEEE Int. Conf. on Robotics and Automation, 1998, pp. 630-637
2. N.M. Amato, O. Bayazit, L. Dale, C. Jones, D. Vallejo, OBPRM: An obstacle-based PRM for 3D workspaces, in: Workshop on the Algorithmic Foundations of Robotics, 1998, pp. 155-168
3. N.M. Amato, Y. Wu, A randomized roadmap method for path and manipulation planning, in: IEEE Int. Conf. on Robotics and Automation, 1996, pp. 113-120
4. J. Barraquand, L.E. Kavraki, J.-C. Latombe, T.-Y. Li, R. Motwani, and P. Raghavan A random sampling scheme for path planning International Journal of Robotics Research 16 1997 759 774
5. R. Bohlin, Motion planning for industrial robots. Ph.D. Thesis, Göteborg University, 1999
6. R. Bohlin, L.E. Kavraki, Path planning using lazy PRM, in: IEEE Int. Conf. on Robotics and Automation, 2000, pp. 521-528
7. M. Branicky, S. LaValle, K. Olson, L. Yang, Quasi-randomized path planning, in: IEEE Int. Conf. on Robotics and Automation, 2001, pp. 1481-1487
8. B. Chazelle The Discrepancy Method 2000 Cambridge University Press Cambridge
9. J. Cortes, T. Simeon, J.P. Laumond, A random loop generator for planning the motions of closed kinematic chains using PRM methods, in: IEEE Int. Conf. on Robotics and Automation, 2002, pp. 2141-2146
10. L. Dale, Optimization techniques for probabilistic roadmaps. Ph.D. Thesis, Texas A&M University, 2000
11. L. Dale, N.M. Amato, Probabilistic roadmaps-putting it all together, in: IEEE Int. Conf. on Robotics and Automation, 2001, pp. 1940-1947
12. R. Geraerts, M.H. Overmars, A comparative study of probabilistic roadmap planners, in: Workshop on the Algorithmic Foundations of Robotics, 2002, pp. 43-57
13. L. Han, N.M. Amato, A kinematics-based probabilistic roadmap method for closed chain systems, in: Algorithmic and Computational Robotics: New Directions. The Fourth Workshop on the Algorithmic Foundations of Robotics, 2000, pp. 233-245
14. C. Holleman, L.E. Kavraki, J. Warren, Planning paths for a flexible surface patch, in: IEEE Int. Conf. on Robotics and Automation, 1998, pp. 21-26
15. D. Hsu, T. Jiang, J. Reif, Z. Sun, The bridge test for sampling narrow passages with probabilistic roadmap planners, in: IEEE Int. Conf. on Robotics and Automation, 2003, pp. 4420-4426
16. D. Hsu, T. Jiang, J. Reif, Z. Sun, On addressing the run-cost variance in randomized motion planners, in: IEEE Int. Conf. on Robotics and Automation, 2003, pp. 2934-2939
17. D. Hsu, L.E. Kavraki, J.-C. Latombe, R. Motwani, S. Sorkin, On finding narrow passages with probabilistic roadmap planners, in: Robotics: The Algorithmic Perspective. The Third Workshop on the Algorithmic Foundations of Robotics, 1998, pp. 141-154
18. D. Hsu, Z. Sun, Adaptive hybrid sampling for probabilistic roadmap planning, Technical Report TRA5/04, National University of Singapore, 2004
19. L.E. Kavraki, Random networks in configuration space for fast path planning, Ph.D. Thesis, Stanford University, 1995
20. L.E. Kavraki, J.-C. Latombe, Randomized preprocessing of configuration space for fast path planning, in: IEEE Int. Conf. on Robotics and Automation, 1994, pp. 2138-2145
21. L.E. Kavraki, P. S̃vestka, J.-C. Latombe, and M. Overmars Probabilistic roadmaps for path planning in high-dimensional configuration spaces IEEE Transactions on Robotics and Automation 12 1996 566 580
22. J.J. Kuffner, Effective sampling and distance metrics for 3D rigid body path planning, in: IEEE Int. Conf. on Robotics and Automation, 2004, pp. 3993-3998
23. J.J. Kuffner, S.M. LaValle, RRT-connect: An efficient approach to single-query path planning, in: IEEE Conf. on Robotics and Automation, 2000, pp. 995-1001
24. F. Lamiraux, and L. Kavraki Planning paths for elastic objects under manipulation constraints International Journal of Robotics Research 20 3 2001 188 208
25. J.-C. Latombe Robot Motion Planning 1991 Kluwer
26. J.-C. Latombe Motion planning: A journey of robots, molecules, digital actors, and other artifacts International Journal of Robotics Research 18 1999 1119 1128
27. S.M. LaValle Planning Algorithms http://msl.cs.uiuc.edu/planning 2004
28. M. Matsumoto, and T. Nishimura Mersenne twister: A 623-dimensionally equidistributed uniform pseudorandom number generator Transactions on Modelling and Computer Simulation 8 1998 3 30
29. D. Nieuwenhuisen, M.H. Overmars, Using cycles in probabilistic roadmap graphs, in: IEEE Int. Conf. on Robotics and Automation, 2004, pp. 446-452
30. C. Nissoux, T. Siméon, J.-P. Laumond, Visibility based probabilistic roadmaps. in: IEEE Int. Conf. on Intelligent Robots and Systems, 1999, pp. 1316-1321
31. M.H. Overmars, A random approach to motion planning, Technical Report RUU-CS-92-32, Utrecht University, 1992
32. B. Salomon, M. Garber, M.C. Lin, D. Manocha, Interactive navigation in complex environments using path planning, in: Symposium on Interactive 3D Graphics, 2003, pp. 41-50
33. G. Sánchez, J.-C. Latombe, A single-query bi-directional probabilistic roadmap planner with lazy collision checking, in: Int. Symposium on Robotics Research, 2001, pp. 403-418
34. G. Sánchez, and J.-C. Latombe On delaying collision checking in PRM planning - application to multi-robot coordination International Journal of Robotics Research 21 1 2002 5 26
35. T. Simeon, J. Cortes, A. Sahbani, J.P. Laumond, A manipulation planner for pick and place operations under continuous grasps and placements, in: IEEE Int. Conf. on Robotics and Automation, 2002, pp. 2022-2027
36. P. S̃vestka, Robot motion planning using probabilistic road maps. Ph.D. Thesis, Utrecht University, 1997
37. G. van den Bergen, Collision Detection in Interactive 3D Environments, Morgan Kaufmann, 2003
38. P. Švestka, and M.H. Overmars Motion planning for car-like robots, a probabilistic learning approach International Journal of Robotics Research 16 1997 119 143
39. P. Švestka, and M.H. Overmars Coordinated path planning for multiple robots Robotics and Autonomous Systems 23 1998 125 152
40. S.A. Wilmarth, N.M. Amato, P.F. Stiller, MAPRM: A probabilistic roadmap planner with sampling on the medial axis of the free space, in: IEEE Int. Conf. on Robotics and Automation, 1999, pp. 1024-1031
41. X. Hickernell, and F, J. Wang Randomized Halton sequences Mathematical and Computer Modelling 32 2000 887 899
42. A. Yershova, S.M. Lavalle, Deterministic sampling methods for spheres and S O (3 ), in: IEEE Int. Conf. on Robotics and Automation, 2004, pp. 3974-3980