LWith the increasing maturity of RRT algorithm, more and more fields are starting to use this algorithm. For example, in path planning problems, this algorithm has been well applied because it has good performance and real-time performance. The RRT algorithm is a path planning algorithm based on tree structure. It continuously explores unknown regions, finds feasible paths, and ultimately connects the starting point and target point by randomly expanding the nodes of the tree. The RRT algorithm has good fast exploration ability and low computational complexity, making it suitable for path planning problems in various environments. This article focuses on studying the parameters in various RRT algorithms. Through analysis and comparison, more reasonable parameters were ultimately found. This article also involves optimizing and improving the RRT algorithm using the RRT * algorithm. The research in this article can further understand the application scenarios of the RRT algorithm. It is expected that this algorithm will be better applied in the field of autonomous driving in the future.