Year: 2025
Type: conference-paper
Abstract: The article analyzes an improved RRT*-Connect path planning algorithm based on MATLAB software.First, the sampling domain of the algorithm is changed to an elliptical sampling domain.Second, adaptive compensation expansion is introduced to accelerate the search speed of the path planning algorithm.Finally, the algorithm is combined with a greedy algorithm to optimize the path.Simulation results show that this algorithm significantly improves both the path length and planning time compared to the traditional RRT*-connect algorithm.
Authors: Ruofan Zhang, Miao Zhang
Institution: Tianjin University of Science and Technology
Language: English
Subfield: Computer Vision and Pattern Recognition
Field: Computer Science
Domain: Physical Sciences
Open Access status: bronze
OpenAlex ID: W4409913889