Neural RRT*: Learning-Based Optimal Path Planning

Chinese University of Hong Kong · Soochow University

Indexed incrossref

Abstract

Rapidly random-exploring tree (RRT) and its variants are very popular due to their ability to quickly and efficiently explore the state space. However, they suffer sensitivity to the initial solution and slow convergence to the optimal solution, which means that they consume a lot of memory and time to find the optimal path. It is critical to quickly find a short path in many applications such as the autonomous vehicle with limited power/fuel. To overcome these limitations, we propose a novel optimal path planning algorithm based on the convolutional neural network (CNN), namely the neural RRT* (NRRT*). The NRRT* utilizes a nonuniform sampling distribution generated from a CNN model. The model is trained using…

Citation impact

532
total citations
FWCI
22.17
Percentile
100%
References
38
Citations per year

Authors

5

Topics & keywords

Keywords
  • Motion planning
  • Computer science
  • Path (computing)
  • Convergence (economics)
  • Mathematical optimization
  • Convolutional neural network
  • Metric (unit)
  • Any-angle path planning
No related works found for this paper.

Funding