Skip to main navigation Skip to search Skip to main content

MINER-RRT*: A Hierarchical and Fast Trajectory Planning Framework in 3D Cluttered Environments

  • Pengyu Wang
  • , Jiawei Tang
  • , Hin Wang Lin
  • , Fan Zhang
  • , Chaoqun Wang
  • , Jiankun Wang*
  • , Ling Shi*
  • , Max Q.-H. Meng*
  • *Corresponding author for this work

Research output: Contribution to journal › Journal Article › peer-review

Abstract

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 .

Original languageEnglish
Article number10845852
Pages (from-to)10973-10985
Number of pages13
JournalIEEE Transactions on Automation Science and Engineering
Volume22
DOIs
Publication statusPublished - 20 Jan 2025

Bibliographical note

Publisher Copyright:
© 2004-2012 IEEE.

Keywords

  • Robot trajectory planning
  • sampling-based algorithm
  • deep neural network

Fingerprint

Dive into the research topics of 'MINER-RRT*: A Hierarchical and Fast Trajectory Planning Framework in 3D Cluttered Environments'. Together they form a unique fingerprint.

Cite this