On the probabilistic foundations of probabilistic roadmap planning

International Journal of Robotics Research

Volumn 25, Issue 7, 2006, Pages 627-643

  Hsu, David ^a   Latombe, Jean Claude ^b   Kurniawati, Hanna ^a  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^b Stanford University   (United States)

Author keywords

Motion planning; Pandomized algorithm; Probabilistic roadmap planning; Random sampling; Robotics

Indexed keywords

ALGORITHMS; INDUSTRIAL ROBOTS; INFORMATION ANALYSIS; KNOWLEDGE ACQUISITION; MOTION PLANNING; RANDOM PROCESSES;

PANDOMIZED ALGORITHM; PROBABILISTIC ROADMAP PLANNING; RANDOM SAMPLING;

PROBABILISTIC LOGICS;

EID: 33745294939     PISSN: 02783649     EISSN: 17413176     Source Type: Journal    
DOI: 10.1177/0278364906067174     Document Type: Article

References (51)

1. Akinc, M., Bekris, K. E., Chen, B. Y., Ladd, A. M., Plaku, E., and Kavraki, L. E. 2004. Probabilistic roadmaps of trees for parallel computation of multiple query roadmaps. Algorithmic Foundations of Robotics VI, M. Erdmann et al. (eds), Springer-Verlag, pp. 80-89.
2. Amato, N. M., Bayazit, O. B., Dale, L. K., Jones, C., and Vallejo, D. 1998. OBPRM: An obstacle-based PRM for 3D workspaces. Robotics: The Algorithmic Perspective: 1998 Workshop on the Algorithmic Foundations of Robotics, P. Agarwal et al. (eds), A. K. Peters, Wellesley, MA, pp. 155-168.
3. Bohlin, R. and Kavraki, L. E. 2000. Path planning using lazy PRM. Proceedings of IEEE International Conference on Robotics and Automation, pp. 521-528.
4. Boor, V., Overmars, M. H., and van der Stappen, F. 1999. The Gaussian sampling strategy for probabilistic roadmap planners. Proceedings of IEEE International Conference on Robotics and Automation, pp. 1018-1023.
5. Branden, C.-I. and Tooze, J. 1999. Introduction to Protein Structure. Garland Publishing.
6. Burns, B. and Brock, O. 2005. Toward optimal configuration space sampling. Proceedings of Robotics: Science and Systems I, Cambridge, MA. Retrieved from http://www.roboticsproceedings.org/rss01/p15.html.
7. Casal, A. and Yim, M. 1999. Self-reconfiguration planning for a class of modular robots. Proceedings of SPIE Symposium on Intelligent Systems and Advanced Manufacturing, Vol. 3839, pp. 246-255.
8. Chaudhuri, S. and Koltun, V. 2006. Smoothed analysis of probabilistic roadmaps. Unpublished manuscript.
9. Cheng, H.-L., Hsu, D., Latombe, J.-C., and Sánchez-Ante, G. 2006. Multi-level free-space dilation for sampling narrow passages in PRM planning. Proceedings of IEEE International Conference on Robotics and Automation. To appear.
10. Choset, H., Lynch, K. M., Hutchinson, S., Kantor, G., Burgard, W., Kavraki, L. E., and Thrun, S. 2005. Principles of Robot Motion: Theory, Algorithms, and Implementations, Chapter 7. MIT Press.
11. Foskey, M., Garber, M., Lin, M. C., and Manocha, D. 2001. A Voronoi-based hybrid motion planner. Proceedings of IEEE/RSJ International Conference on Intelligent Robots and Systems, pp. 55-60.
12. Geraerts, R. and Overmars, M. H. 2002. A comparative study of probabilistic roadmap planners. Algorithmic Foundations of Robotics V, J. Boissonnat et al. (eds), Springer, pp. 43-59.
13. Geraerts, R. and Overmars, M. H. 2005a. Creating small roadmaps for solving motion planning problems. IEEE International Confernece on Methods and Models in Automation and Robotics, pp. 531-536.
14. Geraerts, R. and Overmars, M. H. 2005b. Reachability analysis of sampling based planners. Proceedings of IEEE International Conference on Robotics and Automation, pp. 406-412.
15. Guibas, L., Holleman, C., and Kavraki, L. E. 1999. A probabilistic roadmap planner for flexible objects with a workspace medial-axis based sampling approach. Proceedings of IEEE/RSJ International Conference on Intelligent Robots and Systems, pp. 254-260.
16. Hauser, K., Bretl, T., and Latombe, J. C. 2005. Learning-assisted multi-step planning. Proceedings of IEEE International Conference on Robotics and Automation.
17. Hirsch, S. and Halperin, D. 2002. Hybrid motion planning: Coordinating two discs moving among polygonal obstacles in the plane. Algorithmic Foundations of Robotics V, J. Boissonnat et al. (eds), Springer, pp. 239-256.
18. Hoff, K. E., III, Culver, T., Keyser, J., Lin, M., and Manocha, D. 2000. Interactive motion planning using hardware-accelerated computation of generalized Voronoi diagrams. Proceedings of IEEE International Conference on Robotics and Automation, pp. 2931-2937.
19. Hsu, D., Jiang, T., Reif, J., and Sun, Z. 2003. The bridge test for sampling narrow passages with probabilistic roadmap planners. Proceedings of IEEE International Conference on Robotics and Automation, pp. 4420-4426.
20. Hsu, D., Kavraki, L. E., Latombe, J. C., Motwani, R., and Sorkin, S. 1998. On finding narrow passages with probabilistic roadmap planners. Robotics: The Algorithmic Perspective: 1998 Workshop on the Algorithmic Foundations of Robotics, P. Agarwal et al. (eds), A. K. Peters, Wellesley, MA, pp. 141-154.
21. Hsu, D., Latombe, J. C., and Motwani, R. 1997. Path planning in expansive configuration spaces. Proceedings of IEEE International Conference on Robotics and Automation, pp. 2719-2726.
22. Hsu, D., Sánchez-Ante, G., and Sun, Z. 2005. Hybrid PRM sampling with a cost-sensitive adaptive strategy. Proceedings of IEEE International Conference on Robotics and Automation, pp. 3885-3891.
23. Indyk, P. 2004. Nearest neighbors in high-dimensional spaces. Handbook of Discrete and Computational Geometry, 2nd edition, Chapter 39, CRC Press, pp. 877-892.
24. Isto, P. 2002. Constructing probabilistic roadmaps with powerful local planning and path optimization. Proceedings of IEEE/RSJ International Conference on Intelligent Robots and Systems, pp. 2323-2328.
25. Kavraki, L. E., Kolountzakis, M. N., and Latombe, J. C. 1998. Analysis of probabilistic roadmaps for path planning. IEEE Transactions on Robotics and Automation 14 (1). 166-171.
26. Kavraki, L. E., Latombe, J. C., Motwani, R., and Raghavan, P. 1995. Randomized query processing in robot path planning. Proceedings of ACM Symposium on Theory of Computing, pp. 353-362.
27. Kavraki, L. E., Švestka, P., Latombe, J. C., and Overmars, M. H. 1996. Probabilistic roadmaps for path planning in high-dimensional configuration space. IEEE Transactions on Robotics and Automation 12 (4). 566-580.
28. Kearns, M. J. and Vazirani, U. V. 1994. An Introduction to Computational learning Theory. MIT Press, Cambridge, MA.
29. Knuth, D. VE. 1997. Art of Computer Programming, Volume 2: Seminumerical Algorithms. Addison-Wesley Professional, 3rd edition.
30. Kotay, K., Rus, D., Vona, M., and McGray, C. 1998. The self-reconfiguring robotic molecule: Design and control algorithms. Robotics: The Algorithmic Perspective: 1998 Workshop on the Algorithmic Foundations of Robotics, P. K. Agarwal et al. (eds), A. K. Peters, Wellesley, MA, pp. 375-386.
31. Kurniawati, H. and Hsu, D. 2004. Workspace importance sampling for probabilistic roadmap planning. Proceedings of IEEE/RSJ International Conference on Intelligent Robots and Systems, pp. 1618-1623.
32. Ladd, A. M. and Kavraki, L. E. 2004. Measure theoretic analysis of probabilistic path planning. IEEE Transactions on Robotics and Automation 20 (2). 229-242.
33. 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.
34. LaValle, S. M. and Kuffner, J. J. 1999. Randomized kinodynamic planning. Proceedings of IEEE International Conference on Robotics and Automation, pp. 473-479.
35. Leven, P. and Hutchinson, S. 2002. Using manipulability to bias sampling during the construction of probabilistic roadmaps. Proceedings of IEEE International Conference on Robotics and Automation, pp. 2134-2140.
36. Lin, M. and Manocha, D. 2004. Collision and proximity queries. Handbook of Discrete and Computational Geometry, J. Goodman and J. O'Rourke (eds), Chapter 35. CRC Press.
37. Lindemann, S. R. and LaValle, S. M. 2003. Incremental low-discrepancy lattice methods for motion planning. Proceedings of IEEE International Conference on Robotics and Automation, pp. 2920-2927.
38. Matoušek, J. 1999. Geometric Discrepancy. Springer-Verlag.
39. Morales A., M. A., Pearce, R., and Amato, N. M. 2006. Metrics for analyzing the evolution of c-space models. Proceedings of IEEE International Conference on Robotics and Automation.
40. Morales A., M. A., Tapia, L., Pearce, R., Rodriguez, S., and Amato, N. M. 2004. A machine learning approach for feature-sensitive motion planning. Algorithmic Foundations of Robotics VI, M. Erdmann et al. (eds), Springer-Verlag, pp. 361-376.
41. Moro, B. 1995. The full Monte. Risk 8 (2). 53-57.
42. Niederreiter, H. 1992. Random Number Generation and Quasi-Monte Carlo Methods. Society for Industrial and Applied Mathematics.
43. Pamecha, A., Ebert-Uphoff, I., and Chirikjian, G. S. 1997. Useful metrics for modular robot motion planning. IEEE Transactions on Robotics and Automation 13 (4). 531-545.
44. Saha, M., Latombe, J. C., Chang, Y. C., and Prinz, F. 2005. Finding narrow passages with probabilistic roadmaps: The small-step retraction method. Autonomous Robots 19 (3). 301-319.
45. Sánchez-Ante, G. and Latombe, J. C. 2002. On delaying collision checking in PRM planning - application to multi-robot coordination. International Journal of Robotics Research 21 (1). 5-26.
46. Siméon, T., Laumond, J. P., and Nissoux, C. 2000. Visibility-based probabilistic roadmaps for motion planning. Journal of Advanced Robotics 14 (6). 477-494.
47. Spielman, D. A. and Teng, S. 2004. Smoothed analysis: Why the simplex algorithm usually takes polynomial time. Journal of the ACM 51 (3). 385-463.
48. Švestka, P. 1996. On probabilistic completeness and expected complexity for probabilistic path planning. Technical Report UU-CS-1996-08, Utrecht University, Department of Information and Computing Sciences, Utrecht, the Netherlands.
49. van den Berg, J. P. and Overmars, M. H. 2005. Using workspace information as a guide to non-uniform sampling in probabilistic roadmap planners. International Journal of Robotics Research 24 (12). 1055-1071.
50. Yang, Y. and Brock, O. 2004. Adapting the sampling distribution in PRM planners based on an approximated medial axis. Proceedings of IEEE International Conference on Robotics and Automation.
51. Yershova, A. and Lavalle, S. M. 2002. Efficient nearest neighbor searching for motion planning. Proceedings of IEEE International Conference on Robotics and Automation, pp. 632-637.