Informed Anytime Fast Marching Tree for Asymptotically Optimal Motion Planning
- 12 May 2020
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Electronics
- Vol. 68 (6) , 5068-5077
Abstract
No abstract availableKeywords
Funding Information
- National Natural Science Foundation of China (51805078, 51374063)
- National Key Research and Development Program of China Stem Cell and Translational Research (2017YFB0304200)
This publication has 30 references indexed in Scilit:
- An asymptotically-optimal sampling-based algorithm for Bi-directional motion planning2015
- Fast marching tree: A fast marching sampling-based method for optimal motion planning in many dimensionsThe International Journal of Robotics Research, 2015
- Optimal sampling-based motion planning under differential constraints: The driftless case2015
- Asymptotically-optimal Motion Planning using lower bounds on cost2015
- Batch Informed Trees (BIT*): Sampling-based optimal planning via the heuristically guided search of implicit random geometric graphs2015
- Sampling-Based Robot Motion Planning: A ReviewIEEE Access, 2014
- CHOMP: Covariant Hamiltonian optimization for motion planningThe International Journal of Robotics Research, 2013
- Sampling-based algorithms for optimal motion planningThe International Journal of Robotics Research, 2011
- Randomized Kinodynamic PlanningThe International Journal of Robotics Research, 2001
- Probabilistic roadmaps for path planning in high-dimensional configuration spacesIEEE Transactions on Robotics and Automation, 1996