A Survey of Motion Planning Algorithms Based on Fast Searching Random Tree

Abstract

The article summarizes the improvement of fast search random tree path planning algorithm in recent years. Firstly, the article explains the model of the original fast search random tree; secondly, the advantages and disadvantages of the RRT algorithm is discussed based on the simulation experiments.As a comparison, the improved RRT-based algorithm is introduced. Finally, the article summarizes the current researching challenges and proposes relevant suggestions and ideas.