Simulation of AGV Airport Path Planning Based on Improved Breadth-First Search Algorithm

Aiming at the problems of incomplete search and low efficiency of traditional breadth-first search algorithm in path planning with grid obstacles, an improved breadth-first search algorithm is proposed. To solve the problem of incomplete search, the traversal direction has been improved by extending the original four directional traversal to omnidirectional traversal; at the same time, considering that the internal road network of the airport may become impassable over time, an optimization objective function was set to compare the travel time of different shortest paths in order to select the optimal path. The simulation experiment results show that in the grid map environment of passable and non passable runways starting from (39, 3), the improved BFS algorithm reduces the path length by 26.47%, and 18.18% respectively, and the search time by 13.68%, and 4.35% respectively compared to the traditional BFS algorithm. The improved BFS algorithm can effectively improve the efficiency of automatic guided vehicle path planning. The comprehensive performance indicators indicate that this algorithm is superior to traditional algorithms and has significant engineering practical value and theoretical research significance.