TY - JOUR
T1 - MINER-RRT*
T2 - A Hierarchical and Fast Trajectory Planning Framework in 3D Cluttered Environments
AU - Wang, Pengyu
AU - Tang, Jiawei
AU - Wang Lin, Hin
AU - Zhang, Fan
AU - Wang, Chaoqun
AU - Wang, Jiankun
AU - Shi, Ling
AU - Meng, Max Q.H.
N1 - Publisher Copyright:
© 2004-2012 IEEE.
PY - 2025
Y1 - 2025
N2 - Trajectory planning for quadrotors in cluttered environments has been challenging in recent years. While many trajectory planning frameworks have been successful, there still exists potential for improvements, particularly in enhancing the speed of generating efficient trajectories. In this paper, we present a novel hierarchical trajectory planning framework to reduce computational time and memory usage called MINER-RRT*, which consists of two main components. First, we propose a sampling-based path planning method boosted by neural networks, where the predicted heuristic region accelerates the convergence of rapidly-exploring random trees. Second, we utilize the optimal conditions derived from the quadrotor’s differential flatness properties to construct polynomial trajectories that minimize control effort in multiple stages. Extensive simulation and real-world experimental results demonstrate that, compared to several state-of-the-art (SOTA) approaches, our method can generate high-quality trajectories with better performance in 3D cluttered environments .
AB - Trajectory planning for quadrotors in cluttered environments has been challenging in recent years. While many trajectory planning frameworks have been successful, there still exists potential for improvements, particularly in enhancing the speed of generating efficient trajectories. In this paper, we present a novel hierarchical trajectory planning framework to reduce computational time and memory usage called MINER-RRT*, which consists of two main components. First, we propose a sampling-based path planning method boosted by neural networks, where the predicted heuristic region accelerates the convergence of rapidly-exploring random trees. Second, we utilize the optimal conditions derived from the quadrotor’s differential flatness properties to construct polynomial trajectories that minimize control effort in multiple stages. Extensive simulation and real-world experimental results demonstrate that, compared to several state-of-the-art (SOTA) approaches, our method can generate high-quality trajectories with better performance in 3D cluttered environments .
KW - Robot trajectory planning
KW - deep neural network
KW - sampling-based algorithm
UR - https://www.webofscience.com/wos/woscc/full-record/WOS:001463995900048
UR - https://openalex.org/W4406610082
UR - https://www.scopus.com/pages/publications/105003033794
U2 - 10.1109/TASE.2025.3531504
DO - 10.1109/TASE.2025.3531504
M3 - Journal Article
SN - 1545-5955
VL - 22
SP - 10973
EP - 10985
JO - IEEE Transactions on Automation Science and Engineering
JF - IEEE Transactions on Automation Science and Engineering
ER -