Reachability-based analysis for Probabilistic Roadmap planners

Robotics and Autonomous Systems

Volumn 55, Issue 11, 2007, Pages 824-836

  Geraerts, Roland ^a   Overmars, Mark H ^a  

^a UTRECHT UNIVERSITY   (Netherlands)

Author keywords

Motion planning; Node adding; Potential field local planner; prm; Reachability; Sampling

Indexed keywords

FAILURE ANALYSIS; MOTION PLANNING; PROBABILITY; PROBLEM SOLVING;

NODE ADDING; POTENTIAL FIELD LOCAL PLANNER; ROADMAP PLANNERS;

ROADS AND STREETS;

EID: 35348850870     PISSN: 09218890     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.robot.2007.06.002     Document Type: Article

References (24)

1. J. Reif, Complexity of the mover's problem and generalizations, in: IEEE Symposium on Foundations of Computer Science, 1979, pp. 421-427
2. Schwartz J., and Sharir M. On the Piano Movers' Problem II (1987), Ablex Publishing Corporation, Norwood, NJ
3. Ben-Or M., Kozen D., and Reif J. The complexity of elementary algebra and geometry. Computer and Systems Sciences 32 (1986) 251-264
4. Canny J. The Complexity of Robot Motion Planning (1988), MIT Press
5. J. Barraquand, Automatic motion planning for complex articulated bodies, Tech. Rep., Paris Research Laboratory, 1991
6. Barraquand J., Kavraki L., Latombe J.-C., Li T.-Y., Motwani R., and Raghavan P. A random sampling scheme for path planning. International Journal of Robotics Research 16 (1997) 744-759
7. Kavraki L., Švestka P., Latombe J.-C., and Overmars M. Probabilistic roadmaps for path planning in high-dimensional configuration spaces. IEEE Transactions on Robotics and Automation 12 (1996) 566-580
8. M. Overmars, A random approach to motion planning, Tech. Rep. RUU-CS-92-32, Utrecht University, 1992
9. Geraerts R., and Overmars M. Sampling and node adding in probabilistic roadmap planners. Robotics and Autonomous System 54 (2006) 165-173
10. Latombe J.-C. Robot Motion Planning (1991), Kluwer
11. L. Kavraki, M. Kolountzakis, J.-C. Latombe, Analysis of probabilistic roadmaps for path planning, in: IEEE International Conference Robotics and Automation, 1996, pp. 3020-3025
12. R. Geraerts, M. Overmars, Creating high-quality roadmaps for motion planning in virtual environments, in: IEEE/RSJ International Conference on Intelligent Robots and Systems, 2006, pp. 4355-4361
13. J. Kuffner, S. LaValle, RRT-connect: An efficient approach to single-query path planning, in: IEEE International Conference on Robotics and Automation, 2000, pp. 995-1001
14. C. Nielsen, L. Kavraki, A two level fuzzy prm for manipulation planning, in: IEEE/RSJ International Conference on Intelligent Robots and Systems, 2000, pp. 1716-1721
15. Bergen G. Collision Detection in Interactive 3D Environments (2003), Morgan Kaufmann
16. M. Branicky, S. LaValle, K. Olson, L. Yang, Quasi-randomized path planning, in: IEEE International Conference on Robotics and Automation, 2001, pp. 1481-1487
17. V. Boor, M. Overmars, A. Stappen, The Gaussian sampling strategy for probabilistic roadmap planners, in: IEEE International Conference on Robotics and Automation, 1999, pp. 1018-1023
18. N. Amato, O. Bayazit, L. Dale, C. Jones, D. Vallejo, OBPRM: An obstacle-based PRM for 3D workspaces, in: International Workshop on the Algorithmic Foundations of Robotics, 1998, pp. 155-168
19. D. Hsu, T. Jiang, J. Reif, Z. Sun, The bridge test for sampling narrow passages with probabilistic roadmap planners, in: IEEE International Conference on Robotics and Automation, 2003, pp. 4420-4426
20. D. Hsu, G. Sánchez-Ante, Z. Sun, Hybrid PRM sampling with a cost-sensitive adaptive strategy, in: IEEE International Conference on Robotics and Automation, 2005, pp. 3885-3891
21. Chazelle B. The Discrepancy Method (2000), Cambridge University Press, Cambridge
22. Wang X., and Hickernell F. Randomized Halton sequences. Mathematics and Computer Modeling 32 (2000) 887-899
23. Nissoux C., Siméon T., and Laumond J.-P. Visibility based probabilistic roadmaps. Advanced Robotics Journal 14 (2000) 477-493
24. R. Geraerts, M. Overmars, Creating small roadmaps for solving motion planning problems, in: IEEE International Conference on Methods and Models in Automation and Robotics, 2005, pp. 531-536