Using workspace information as a guide to non-uniform sampling in probabilistic roadmap planners

International Journal of Robotics Research

Volumn 24, Issue 12, 2005, Pages 1055-1071

  Van Den Berg, Jur P ^a   Overmars, Mark H ^a  

^a UTRECHT UNIVERSITY   (Netherlands)

Author keywords

Narrow passage problem; Path planning; Probabilistic roadmaps

Indexed keywords

DEGREES OF FREEDOM (MECHANICS); MOTION PLANNING; PROBABILITY; PROBLEM SOLVING; ROBOTS; SAMPLING;

CELL DECOMPOSITION METHODS; NARROW-PASSAGE PROBLEM; PROBABILISTIC ROADMAPS (PRM); PROBABILISTIC SAMPLING;

PROBABILISTIC LOGICS;

EID: 29144459602     PISSN: 02783649     EISSN: None     Source Type: Journal    
DOI: 10.1177/0278364905060132     Document Type: Article

References (29)

1. Amato, N. and Wu, Y. 1996. A randomized roadmap method for path and manipulation planning. Proceedings of the IEEE International Conference on Robotics and Automation, Minneapolis, MN, April, pp. 113-120.
2. Amato, N., Bayazit, O., Dale, L., Jones, C., and Vallejo, D. 1998. OBPRM: an obstacle-based PRM for 3D workspaces. Robotics: The Algorithmic Perspective, P. K. Agarwal, L. E. Kavraki, and M. T. Mason, editors, A. K. Peters, Wellesley, MA, pp. 155-168.
3. Barraquand, J., Kavraki, L., 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.
4. Brock, O. and Kavraki, L. E. 2001. Decomposition-based motion planning: a framework for real-time motion planning in high-dimensional configuration spaces. Proceedings of the IEEE International Conference on Robotics and Automation, Seoul, Korea, May 21-26, pp. 1469-1474.
5. de Berg, M., van Krefeld, M., Overmars, M., and Schwarzkopf, O. 2000. Computational Geometry, Algorithms and Applications, Springer-Verlag, Berlin.
6. Boor, V., Overmars, M. H., and van der Stappen, A. F. 1999. The Gaussian sampling strategy for probabilistic roadmap planners. Proceedings of the IEEE International Conference on Robotics and Automation, 1999, pp. 1018-1023.
7. Branicky, M., LaValle, S., Olson, K., and Yang, L. 2001. Quasi-randomized path planning. Proceedings of the IEEE International Conference on Robotics and Automation, Seoul, Korea, May 21-26, pp. 1481-1487.
8. Geraerts, R. and Overmars, M. H. 2004a. A comparative study of probabilistic roadmap planners. Algorithmic Foundations of Robotics V, J.-D. Boissonnat, J. Burdich, K. Goldberg, S. Hutchinson, editors, Springer-Verlag Berlin, pp. 43-57.
9. Geraerts, R. and Overmars, M. H. 2004b. Sampling techniques for probabilistic roadmap planners. Proceedings of the Conference on Intelligent Autonomous Systems, Amsterdam, the Netherlands, March 10-13, pp. 600-609.
10. Glavina, B. 1990. Solving findpath by combination of goal-directed and randomized search. Proceedings of the IEEE International Conference on Robotics and Automation, Cincinnati, OH, pp. 1718-1723.
11. Holleman, C. and Kavraki, L. E. 2000. A framework for using the workspace medial axis in prm planners. Proceedings of the IEEE International Conference on Robotics and Automation, San Francisco, CA, April 24-28, pp. 1408-1413.
12. Hsu, D., Kavraki, L., Latombe, J.-C., Motwani, R., and Sorkin, S. 1998. On finding narrow passages with probabilistic roadmap planners. Robotics: The Algorithmic Perspective, P. K. Agarwal, L. E. Kavraki, and M. T. Mason, editors, A. K. Peters, Wellesley, MA, pp. 141-154.
13. Hsu, D., Jiang, T., Reif, J., and Sun, Z. 2003. The bridge test for sampling narrow passages with probabilistic roadmap planners. Proceedings of the IEEE International Conference on Robotics and Automation, Taipei, Taiwan, September 14-19, pp. 4420-4426.
14. Kavraki, L. 1995. Random networks in configuration space for fast path planning. Ph.D. Thesis, Stanford University.
15. Kavraki, L. and Latombe, J.-C. 1994. Randomized preprocessing of configuration space for fast path planning. Proceedings of the IEEE International Conference on Robotics and Automation, San Diego, CA, May, pp. 2138-2145.
16. Kavraki, L. and Latombe, J.-C. 1998. Probabilistic roadmaps for robot path planning, Practical Motion Planning in Robotics: Current Approaches and Future Directions, K. Gupta and A. del Pobil, editors, Wiley, New York, pp. 33-53.
17. Kavraki, L., Š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.
18. Kurniawati, H. and Hsu, D. 2004. Workspace importance sampling for probabilistic roadmap planning. Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems, Sendai, Japan, September 28-October 2, pp. 1618-1623.
19. Latombe, J.-C. 1991. Robot Motion Planning, Kluwer Academic, Boston.
20. LaValle, S. M., Branicky, M. S., and Lindemann, S. R. 2004. On the relationship between classical grid search and probabilistic roadmaps. International Journal of Robotics Research 23(7-8):673-692.
21. Leven, P. and Hutchinson, S. 2002. A framework for real-time path planning in changing environments. International Journal of Robotics Research 21(12):999-1030.
22. Lindemann, S. R. and LaValle, S. M. 2003. Current issues in sampling-based motion planning. Proceedings of the International Symposium on Robotics Research, Sienna, Italy, November.
23. Overmars, M. H. 1992. A random approach to motion planning. Technical Report RUU-CS-92-32, Department of Computer Science, Utrecht University, Utrecht, the Netherlands, October.
24. Pisula, C., Hoff, K., Lin, M. C., and Manocha, D. 2000. Randomized path planning for a rigid body based on hardware accelerated Voronoi sampling. Proceedings of the 4th Workshop on the Algorithmic Foundation of Robotics (WAFR), Hanover, NH, March 16-18.
25. Švestka, P. 1997. Robot motion planning using probabilistic roadmaps. Ph.D. Thesis, Utrecht University.
26. van den Berg, J. P. and Overmars, M. H. 2004. Using workspace information as a guide to non-uniform sampling in probabilistic roadmap planners. Proceedings of the IEEE International Conference on Robotics and Automation, New Orleans, LA, pp. 453-460.
27. van den Bergen, G. 2004. Collision Detection in Interactive 3D Environments, Morgan Kaufmann, San Francisco.
28. Vincent, L. and Soille, P. 1991. Watersheds in digital spaces: an efficient algorithm based on immersion simulations. IEEE Transactions on Pattern Analysis and Machine Intelligence 13:583-598.
29. 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. Proceedings of the IEEE International Conference on Robotics and Automation, Detroit, MI, pp. 1024-1031.