Informed anytime Bi-directional Fast Marching Tree for optimal motion planning in complex cluttered environments
Authors:
- Kuan WangKWKuan Wang
- Jing XuJXJing Xu
- Kechen SongKSKechen Song
- Yunhui YanYYYunhui Yan
- Yihang PengYPYihang Peng
- 16 November 2022
- journal article
- research article
- Published by Elsevier in Expert Systems with Applications
- Vol. 215
Abstract
No abstract availableKeywords
Funding Information
- National Natural Science Foundation of China
This publication has 28 references indexed in Scilit:
- Path planning for mobile robots using Bacterial Potential Field for avoiding static and dynamic obstaclesExpert Systems with Applications, 2015
- Fast marching tree: A fast marching sampling-based method for optimal motion planning in many dimensionsThe International Journal of Robotics Research, 2015
- Asymptotically-optimal Motion Planning using lower bounds on cost2015
- Sparse roadmap spanners for asymptotically near-optimal motion planningThe International Journal of Robotics Research, 2014
- Sampling-based algorithms for optimal motion planningThe International Journal of Robotics Research, 2011
- On Delaying Collision Checking in PRM Planning: Application to Multi-Robot CoordinationThe International Journal of Robotics Research, 2002
- 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
- Real-Time Obstacle Avoidance for Manipulators and Mobile RobotsThe International Journal of Robotics Research, 1986
- A note on two problems in connexion with graphsNumerische Mathematik, 1959