With the increasing maturity of automated guided vehicles(AGV)technology and the widespread application of flexible manufacturing systems,enhancing the efficiency of AGVs in complex environments has become crucial.Thi...With the increasing maturity of automated guided vehicles(AGV)technology and the widespread application of flexible manufacturing systems,enhancing the efficiency of AGVs in complex environments has become crucial.This paper analyzes the challenges of path planning and scheduling in multi-AGV systems,introduces a map-based path search algorithm,and proposes the BFS algorithm for shortest path planning.Through optimization using the breadth-first search(BFS)algorithm,efficient scheduling of multiple AGVs in complex environments is achieved.In addition,this paper validated the effectiveness of the proposed method in a production workshop experiment.The experimental results show that the BFS algorithm can quickly search for the shortest path,reduce the running time of AGVs,and significantly improve the performance of multi-AGV scheduling systems.展开更多
文摘With the increasing maturity of automated guided vehicles(AGV)technology and the widespread application of flexible manufacturing systems,enhancing the efficiency of AGVs in complex environments has become crucial.This paper analyzes the challenges of path planning and scheduling in multi-AGV systems,introduces a map-based path search algorithm,and proposes the BFS algorithm for shortest path planning.Through optimization using the breadth-first search(BFS)algorithm,efficient scheduling of multiple AGVs in complex environments is achieved.In addition,this paper validated the effectiveness of the proposed method in a production workshop experiment.The experimental results show that the BFS algorithm can quickly search for the shortest path,reduce the running time of AGVs,and significantly improve the performance of multi-AGV scheduling systems.
