Research on Shortest Path BFS Strategy in Multi-AGV Scheduling System

作     者：Shi Deng Di Wu 

作者机构：Beijing Huahang Weishi Robot Technology Co.Ltd.Shanghai BranchShanghai 201700China Gu Fang(Shanghai)Software Technology Studio(Limited Partnership)Shanghai 211206China 

出 版 物：《Journal of Electronic Research and Application》 (电子研究与应用)

年 卷 期：2024年第8卷第3期

页      面：78-82页

学科分类：08[工学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

主　　题：AGV Path planning AGV scheduling system BFS algorithm 

摘      要：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 *** 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 *** optimization using the breadth-first search(BFS)algorithm,efficient scheduling of multiple AGVs in complex environments is *** addition,this paper validated the effectiveness of the proposed method in a production workshop *** 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.