Useful cycles in probabilistic roadmap graphs

Proceedings - IEEE International Conference on Robotics and Automation

Volumn 2004, Issue 1, 2004, Pages 446-452

  Nieuwenhuisen, Dennis ^a   Overmars, Mark H ^a  

^a UTRECHT UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ANIMATION; AUTOMATION; COMPUTER AIDED DESIGN; GRAPH THEORY; PROBLEM SOLVING; ROBOTICS;

COMPUTER GAMES; PROBABILISTIC ROADMAP GRAPHS;

MOTION PLANNING;

EID: 3042524189     PISSN: 10504729     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/robot.2004.1307190     Document Type: Conference Paper

References (24)

1. N. Amato, O. Bayazit, L. Dale, C. Jones, D. Vallejo, OBPRM: AB obstacle-based PRM for 3D workspaces, in: P.K. Agarwal, L.E. Kavraki, M.T. Mason (eds.), Robotics: The algorithmic perspective, A.K. Peters, Natick, 1998, pp. 155-168.
2. N. Amato, O. Bayazit, L. Dale, C. Jones, D. Vallejo, Choosing good distance metrics and local planners for probabilistic roadmap methods, Proc. IEEE Int. Conf. on Robotics and Automation, 1998, pp. 630-637.
3. N. Amato, Y. Wu, A randomized roadmap method for path and manipulation planning, Proc. IEEE Int. Conf. on Robotics and Automation, 1996, pp. 113-120.
4. J. Barraquand, L. Kavraki, J.-C. Latombe, T.-Y. Li, R. Motwani, P. Raghavan, A random sampling scheme for path planning, Int. Journal of Robotics Research 16 (1997), pp. 759-774.
5. G. van den Bergen, Collision Detection in Interactive 3D Environments, Morgan Kaufmann In press 2003.
6. M. Branicky and S. Lavalle and K. Olson and L. Yang, Quasi randomized palh planning, IEEE Int. Conf. on Robotics and Automation, 2001.
7. V. Boor, M.H. Overmars, A.F. van der Stoppen, The Gaussian sampling strategy for probabilistic roadmap planners, Proc. IEEE Int. Conf. on Robotics and Automation, 1999, pp. 1018-1023.
8. R. Bohlin, L.E. Kavraki, Path planning using lazy PRM, Proc. IEEE Int. Conf. on Robotics and Automation, 2000, pp. 521-528.
9. C. Demetrescu, G.F. Italiano, Fully Dynamic All Pairs Shortest Paths with Real Edge Weights, IEEE Symp. on Foundations of Computer Science, 2001. pp. 260-267.
10. C. Demetrescu, G.F. Italiano, A New Approach to Dynamic All Pairs Shortest Paths, Proc. 35th Annual ACM Symposium on Theory of Computing 2003.
11. Roland Geraerts, Mark H. Overmars, A Comparative Study of Probabilistic Roadmap Planners, Proceedings WAFR 2002-2003 2002, pp. 4054.
12. David Hsu and Tingting Jiang and John Reif and Zheng Sun, The Bridge Test for Sampling Narrow Passages with Probabilistic Roadmap Planners, Proc. IEEE Int. Conf. on Robotics and Automation, 2003.
13. D. Hsu, L. Kavraki, J.C. Latombe, R. Motwani, S. Sorkin, On finding narrow passages with probabilistic roadmap planners, in: P.K. Agarwal, L.E. Kavraki, M.T. Mason (eds.), Robotics: The algorithmic perspective, A.K. Peters, Natick, 1998, pp. 141-154.
14. P. Isto, Constructing Probabilistic Roadmaps with Powerful Local Planning and Path Optimization, IEEE/RSJ Int. Conf. on Intelligent Robots and Systems, 2002, pp. 2323-2328.
15. L. Kavraki, Random networks in configuration space for fast path planning, PhD thesis, Stanford University, 1995.
16. L. Kavraki, J.C. Latombe, Randomized preprocessing of configuration space for fast path planning, Proc. IEEE Int. Conf. on Robotics and Automation, 1994, pp. 2138-2145.
17. J. Kim, R. Pearce, N. Amato, Extracting optimal paths from roadmaps for motion planning, unpublished.
18. J. C. Latombe, Robot motion planning, Kluwer Academic Publishers, Boston, 1991.
19. C. Nissoux, T. Siméon, J.-P. Laumond, Visibility based probabilistic roadmaps, Proc. IEEE Int. Conf. on Intelligent Robots and Systems, 1999, pp. 1316-1321.
20. M.H. Overmars, A random approach to motion planning, Technical Report RUU-CS-92-32, Dept. Comput. Sci., Utrecht Univ., Utrecht, the Netherlands, 1992.
21. E. Schmitzberger, J.-L. Bouchet, M. Dufaut, W. Didier, R. Husson, Capture of homotopy classes with probabilistic road map, IEEE/RSJ Int. Conf. on Intelligent Robots and Systems, 2002.
22. G. Song, Shawna Miller, N. M. Amato, Customizing PRM Roadmaps at Query time, Proc. IEEE Int. Conf. on Robot. Autom. (ICRA) 1999, pp. 2958-2963.
23. P. Švestka, Robot motion planning using probabilistic roadmaps, PhD thesis, Utrecht Univ., 1997.
24. S.A. Wilmarth, N.M. Amato, P.F. Stiller, MAPRM: A probabilistic roadmap planner with sampling on the medial axis of the free space, Proc. IEEE Int. Conf. on Robotics and Automation, 1999, pp. 1024-1031.