Abstract
In large-scale scenes, how to quickly obtain paths while ensuring the shortest possible path length is a key issue. Rapidly-exploring Random Tree (RRT) have the characteristic of quickly exploring the state space, but it is often difficult to obtain a short path. To overcome this problem, this paper proposes an improved RRT algorithm based on equidistance retention strategy and A* local search(ERRRT-A*). First, RRT is used for large-step global fast exploration to obtain approximate paths. Then, an equidistance retention strategy is used to discard most of the points and retain a small number of key points. Finally, A* is used to search between each segment to obtain a new path. The ERRRT-A* algorithm is compared with other commonly used algorithms on maps of different size in terms of path length and planning time. Simulation results indicate that compared with other algorithms, this algorithm achieves fast planning in large-scale scenes while obtaining short path length, which can effectively balance the path length and planning time.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have