Creating high-quality paths for motion planning

International Journal of Robotics Research

Volumn 26, Issue 8, 2007, Pages 845-863

  Geraerts, Roland ^a   Overmars, Mark H ^a  

^a UTRECHT UNIVERSITY   (Netherlands)

Author keywords

Motion planning; Path clearance; Path length; Path quality

Indexed keywords

ALGORITHMS; COLLISION AVOIDANCE; DATA STRUCTURES; MOTION PLANNING; PROBLEM SOLVING; ROBOT PROGRAMMING;

PATH CLEARANCE; PATH LENGTH; PATH QUALITY;

MOBILE ROBOTS;

EID: 34547161883     PISSN: 02783649     EISSN: 17413176     Source Type: Journal    
DOI: 10.1177/0278364907079280     Document Type: Article

References (25)

1. Amato, N.M., Bayazit, O., Dagle, L., Jones, C., and Vallejo, D. (1998). Choosing good distance metrics and local planners for probabilistic roadmap methods. IEEE International Conference on Robotics and Automation, pp. 630637.
2. Baginski, B. (1997). Efficient motion planning in high dimensional spaces: The parallelized Z3-method. International Workshop on Robotics in the Alpe-Adria-Danube Region, pp. 247252.
3. Berchtold, S. and Glavina, B. (1994). A scalable optimizer for automatically generated manipulator motions. IEEE/RSJ International Conference on Intelligent Robots and Systems, pp. 17961802.
4. van den Bergen, G. (2003). Collision Detection in Interactive 3D Environments. Morgan Kaufmann, San Francisco, CA.
5. Brock, O. and Khatib, O. (2002). Elastic strips: A framework for motion generation in human environments. International Journal of Robotics Research, 21: 1031 1052.
6. Chen, P.C. and Hwang, Y.K. (1998). SANDROS: A dynamic graph search algorithm for motion planning. IEEE Transactions on Robotics and Automation, 14: 390 403.
7. Choset, H. and Burdick, J. (2000). Sensor-based exploration: The hierarchical generalized Voronoi graph. International Journal of Robotics Research, 19: 96 125.
8. Geem, C., Simon, T., Laumond, J.-P., Bouchet, J.-L., and Rit, J.-F. (1999). Mobility analysis for feasibility studies in CAD models of industrial environments. IEEE International Conference on Robotics and Automation, pp. 1770 1775.
9. Geraerts, R. and Overmars, M.H. (2006). Creating high-quality roadmaps for motion planning in virtual environments. IEEE/RSJ International Conference on Intelligent Robots and Systems, pp. 43554361.
10. Hoff, K., Culver, T., Keyser, J., Lin, M., and Manocha, D. (2000). Interactive motion planning using hardware-accelerated computation of generalized Voronoi diagrams. IEEE International Conference on Robotics and Automation, pp. 29312937.
11. Hsu, D., Latombe, J.-C., and Sorkin, S. (1999). Placing a robot manipulator amid obstacles for optimized execution. IEEE International Symposium on Assembly and Task, pp. 280 285.
12. Isto. P. (2002). Constructing probabilistic roadmaps with powerful local planning and path optimization. IEEE/RSJ International Conference on Intelligent Robots and Systems, pp. 23232328.
13. Kavraki, L.E. and Latombe, J.-C. (1998). Probabilistic roadmaps for robot path planning. In Practical Motion Planning in Robotics: Current Approaches and Future Directions (eds K. Gupta and A. del Pobil), pp. 33 53, John Wiley.
14. Kavraki, L.E., vestka, P., Latombe, J.-C., and Overmars, M.H. (1996). Probabilistic roadmaps for path planning in high-dimensional configuration spaces. IEEE Transactions on Robotics and Automation, 12: 566 580.
15. Kim, J., Pearce, R., and Amato, N.M. (2003). Extracting optimal paths from roadmaps for motion planning. IEEE International Conference on Robotics and Automation, pp. 24242429.
16. Kuffner, J.J. and LaValle, S.M. (2000). RRT-connect: An efficient approach to single-query path planning. IEEE International Conference on Robotics and Automation, pp. 9951001.
17. LaValle, S.M. (2006). Planning Algorithms. http://planning.cs.uiuc.edu. Cambridge University Press, New York, NY.
18. Lien, J.-M., Thomas, S., and Amato, N.M. (2003). A general framework for sampling on the medial axis of the free space. IEEE International Conference on Robotics and Automation, pp. 44394444.
19. Masehianand, E., Admin-Naseri, M.R., and Khadem, S.E. (2003). Online motion planning using incremental construction of medial axis. IEEE International Conference on Robotics and Automation, pp. 29282933.
20. Snchez, G. and Latombe, J.-C. (2002). On delaying collision checking in PRM planning. Application to multi-robot coordination. International Journal of Robotics Research, 21: 5 26.
21. Sekhavat, S., vestka, P., Laumond, J.-P., and Overmars, M.H. (1998). Multilevel path planning for nonholonomic robots using semiholonomic subsystems. International Journal of Robotics Research, 17: 840 857.
22. Vleugels, J. and Overmars, M.H. (1998). Approximating Voronoi diagrams of convex sites in any dimension. International Journal of Computational Geometry and Applications, 8: 201 221.
23. vestka, P. (1997) Robot Motion Planning Using Probabilistic Road Maps. PhD thesis, Utrecht University.
24. Wein, R., van den Berg, J.P., and Halperin, D. (2005). The Visibility-Voronoi complex and its applications. Annual Symposium on Computational Geometry, pp. 6372.
25. 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. IEEE International Conference on Robotics and Automation, pp. 1024 1031.