A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is
Improved path planning algorithm for mobile robots
Path planning is an NP-hard problem in road network environments. Considering that the existing path planning algorithms mainly have the problems of low smoothness and low search efficiency in generating paths in large-scale complex environments, an improved rapidly exploring random tree (RRT) algorithm is proposed in this paper. First, the grid method is applied to model the road network environment, and the RRT algorithm based on adjacency expansion is proposed to search the initial path.doi:10.21203/rs.3.rs-315604/v1 fatcat:pjdocuewkbg7bn5jyuvip74afm