Create New Account
Login
Search or Buy Articles
Browse Journals
Browse Proceedings
Submit your Paper
Submission Information
Journal Review
Recommend to Your Library
Call for Papers
IMPROVING RRT-CONNECT APPROACH FOR OPTIMAL PATH PLANNING BY UTILIZING PRIOR INFORMATION
Yuanshan Lin, Di Wu, Xin Wang, Xiukun Wang, and Shunde Gao
References
[1] S.M. LaValle, Rapidly-exploring random trees: A new tool for path planning. TR 98-11, Computer Science Depatment, Iowa State University, October 1998.
[2] S.M. LaValle and J.J. Kuffner, Rapidly-exploring random trees: Progress and prospects. In B.R. Donald, K.M. Lynch, and D. Rus (eds), Algorithmic and Computational Robotics: New Directions, (Wellesley, MA: A.K. Peters, 2001), 293–308.
[3] S.M. LaValle and J.J. Kuffner Jr., Randomized kinodynamic planning, International Journal of Robotics Research, 20(5), 2001, 378–400.
[4] J.J. Kuffner Jr. and S.M. LaValle, RRT-connect: An efficient approach to single-query path planning, IEEE International Conference on Robotics and Automation, San Francisco, CA, USA, 2000, 995–1001.
[5] A. Yershova and S.M. LaValle, Improving motion-planning algorithms by efficient nearest-neighbor searching, IEEE Transactions on Robotics, 23(1), 2007, 151–157.
[6] L. Jaillet, A. Yershova, S.M. LaValle, and T. Simeon, Adaptive tuning of the sampling domain for dynamic-domain RRTs, 2005 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2005), 2005, 2851–2856.
[7] W. Wei, L. Yan, X. Xin, and S.X. Yang, An adaptive roadmap guided Multi-RRTs strategy for single query path planning, 2010 IEEE International Conference on Robotics and Automation (ICRA), Anchorage, Alaska, 2010, 2871–2876.
[8] C. Urmson and R. Simmons, Approaches for heuristically biasing RRT growth, 2003 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2003), Las Vegas, 2003, 1178–1183.
[9] D. Ferguson and A. Stentz, Anytime RRTs, 2006 IEEE/RSJ International Conference on Intelligent Robots and Systems, Beijing, China, 2006, 5369–5375.
[10] S. Karaman and E. Frazzoli, Incremental sampling-based algorithms for optimal motion planning, Proc. Robotics: Science and Systems, 2010.
[11] S. Karaman and E. Frazzoli, Sampling-based algorithms for optimal motion planning, International Journal of Robotics Research, 30(7), 2011, 846–894.
[12] S. Karaman and E. Frazzoli, Optimal kinodynamic motion planning using incremental sampling-based methods, 2010 49th IEEE Conference on Decision and Control (CDC), 2010, 7681–7687.
[13] J. Laumond, S. Sekhavat, and F. Lamiraux, Guidelines in nonholonomic motion planning for mobile robots, Robot Motion Planning and Control, 229, 1998, 1–53.
[14] M. Kalisiak and M. Van De Panne, RRT-blossom: RRT with a local flood-fill behavior, Proc. – IEEE Int. Conf. Robotics and Automation, Orlando, FL, 2006, 1237–1242.
Important Links:
Abstract
DOI:
10.2316/Journal.206.2013.2.206-3781
From Journal
(206) International Journal of Robotics and Automation - 2013
Go Back