Adaptive tuning of the sampling domain for dynamic-domain RRTs

2005 IEEE/RSJ International Conference on Intelligent Robots and Systems, IROS

Volumn , Issue , 2005, Pages 2851-2856

  Jaillet, Léonard ^a   Yershova, Anna ^b   Lavalle, Steven M ^b   Siméon, Thierry ^a  

^a LAAS CNRS   (France)

^b University of Illinois at Urbana Champaign   (United States)

Author keywords

Motion planning; RRTs; Voronoi bias

Indexed keywords

INTELLIGENT ROBOTS; ITERATIVE METHODS; PLANNING;

AUTOMATIC TUNING; CLASSICAL MOTION; ITS APPLICATIONS; MOTION PLANNING PROBLEMS; PATH PLANNING PROBLEMS; RAPIDLY-EXPLORING RANDOM TREES; RRTS; VORONOI BIAS;

MOTION PLANNING;

EID: 79957989533     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IROS.2005.1545607     Document Type: Conference Paper

References (28)

1. N. M. Amato and Y. Wu. A randomized roadmap method for path and manipulation planning. In IEEE Int. Conf. Robot. & Autom., pages 113-120, 1996.
2. A. Atramentov and S. M. LaValle. Efficient nearest neighbor searching for motion planning. In Proc. IEEE Int'l Conf. on Robotics and Automation, pages 632-637, 2002. (Pubitemid 34916667)
3. R. Bohlin and L. Kavraki. Path planning using Lazy PRM. In IEEE Int. Conf. Robot. & Autom., 2000.
4. V. Boor, N. H. Overmars, and A. F. van der Stappen. The gaussian sampling strategy for probabilistic roadmap planners. In IEEE Int. Conf. Robot. & Autom., pages 1018-1023, 1999.
5. P. Choudhury and K. Lynch. Trajectory planning for second-order underactuated mechanical systems in presence of obstacles. In Proceedings of the Workshop on Algorithmic Foundations of Robotics, 2002.
6. J. Cortés and T. Siméon. Sampling-based motion planning under kinematic loop-closure constraints. In 6th International Workshop on Algorithmic Foundations of Robotics, pages 59-74, 2004.
7. E. Ferré and J.-P. Laumond. An iterative diffusion method for part disassembly. In IEEE Int. Conf. Robot. & Autom., 2004.
8. E. Frazzoli, M. A. Dahleh, and E. Feron. Real-time motion planning for agile autonomous vehicles. AIAA Journal of Guidance and Control, 25(1):116-129, 2002. (Pubitemid 34109520)
9. B. Glavina. Solving findpath by combination of goal-directed and randomized search. In IEEE Int. Conf. Robot. & Autom., pages 1718- 1723, May 1990.
10. L. Han and N. M. Amato. A kinematics-based probabilistic roadmap method for closed chain systems. In B. R. Donald, K. M. Lynch, and D. Rus, editors, Algorithmic and Computational Robotics: New Directions, pages 233-246. A K Peters, Wellesley, MA, 2001.
11. C. Holleman and L. E. Kavraki. A framework for using the workspace medial axis in PRM planners. In IEEE Int. Conf. Robot. & Autom., pages 1408-1413, 2000.
12. D. Hsu, L. E. Kavraki, J.-C. Latombe, R. Motwani, and S. Sorkin. On finding narrow passages with probabilistic roadmap planners. In et al. P. Agarwal, editor, Robotics: The Algorithmic Perspective, pages 141-154. A.K. Peters, Wellesley, MA, 1998.
13. D. Hsu, J.-C. Latombe, and R. Motwani. Path planning in expansive configuration spaces. Int. J. Comput. Geom. & Appl., 4:495-512, 1999.
14. S. Kagami, J. Kuffner, K. Nishiwaki, and K. Okada M. Inaba. Humanoid arm motion planning using stereo vision and RRT search. In IEEE/RSJ Int. Conf. on Intelligent Robots & Systems, 2003.
15. M. Kallmann, A. Aubel, T. Abaci, and D. Thalmann. Planning collision-free reaching motions for interative object manipulation and grasping. Eurographics, 22(3), 2003.
16. L. E. Kavraki, P. Svestka, J.-C. Latombe, and M. H. Overmars. Probabilistic roadmaps for path planning in high-dimensional configuration spaces. IEEE Trans. Robot. & Autom., 12(4):566-580, June 1996. (Pubitemid 126774162)
17. J. Kim and J. P. Ostrowski. Motion planning of aerial robot using rapidly-exploring random trees with dynamic constraints. In IEEE Int. Conf. Robot. & Autom., 2003.
18. F. Lamiraux, E. Ferre, and E. Vallee. Kinodynamic motion planning: connecting exploration trees using trajectory optimization methods. In IEEE Int. Conf. Robot. & Autom., pages 3987-3992, 2004.
19. S. M. LaValle. Rapidly-exploring random trees: A new tool for path planning. TR 98-11, Computer Science Dept., Iowa State University, Oct. 1998.
20. S. M. LaValle and J. J. Kuffner. Rapidly-exploring random trees: Progress and prospects. In B. R. Donald, K. M. Lynch, and D. Rus, editors, Algorithmic and Computational Robotics: New Directions, pages 293-308. A K Peters, Wellesley, MA, 2001.
21. E. Mazer, J. M. Ahuactzin, and P. Bessìere. The Ariadne's clew algorithm. J. Artificial Intell. Res., 9:295-316, November 1998. (Pubitemid 128636206)
22. G. Śanchez and J.-C. Latombe. A single-query bi-directional probabilistic roadmap planner with lazy collision checking. In Int. Symp. Robotics Research, 2001.
23. S. Sekhavat, P. Svestka, J.-P. Laumond, and M. H. Overmars. Multilevel path planning for nonholonomic robots using semiholonomic subsystems. Int. J. Robot. Res., 17:840-857, 1998. (Pubitemid 128557001)
24. T. Siméon, J.-P. Laumond., and C. Nissoux. Visibility based probabilistic roadmaps for motion planning. Advanced Robotics Journal, 14(6), 2000.
25. T. Siméon, J.P. Laumond, C. van Geem, and J. Cortés. Computer aided motion: Move3d within molog. In Proc. of IEEE Int. Conf. Robotics and Automation, 2001.
26. P. Svestka and M. H. Overmars. Coordinated motion planning for multiple car-like robots using probabilistic roadmaps. In IEEE Int. Conf. Robot. & Autom., pages 1631-1636, 1995.
27. J. Yakey, S. M. LaValle, and L. E. Kavraki. Randomized path planning for linkages with closed kinematic chains. IEEE Transactions on Robotics and Automation, 17(6):951-958, December 2001. (Pubitemid 34125094)
28. A. Yershova, L. Jaillet, T. Siméon, and S. M. LaValle. Dynamic-domain rrts: Efficient exploration by controlling the sampling domain. In Proc. of IEEE Int. Conf. Robotics and Automation, to appear, Barcelona, Spain, 2005.