Work

An Improved Fast Search Algorithm Based on A* Algorithm

Year: 2025
Type: conference-paper
Abstract: A* algorithm is a path planning algorithm widely used in various traffic carriers. However, in complex environment, it needs to plan the path in real time, which puts higher requirements on the efficiency of the algorithm. This paper presents an improved A* algorithm, which can greatly improve the planning efficiency of A* algorithm without increasing the path step size. First, allow and give priority to search the diagonal direction of the region, then improve the heuristic function, combine the linear distance and diagonal distance, make the cost value close to the real distance, and use the dynamic weight to adjust. Under the same conditions, the traditional A* algorithm and the improved A* algorithm are simulated and compared by Matlab, and the real scene is simulated and tested to verify the effectiveness of the improved A* algorithm. Simulation results show that compared with the traditional A* algorithm, the improved algorithm can not only find the optimal global path, but also has higher search efficiency, which is conducive to improving the efficiency of path planning, and can meet the requirements of real-time path planning in complex scenarios.
Language: English
Open Access status: hybrid
OpenAlex ID: W7124728111
FWCI: 1.312
Cites: 5
Cited by: 2
Related to: 10