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

作　　者：Shi Deng Di Wu 

机构地区：[1]Beijing Huahang Weishi Robot Technology Co.,Ltd.,Shanghai Branch,Shanghai 201700,China [2]Gu Fang(Shanghai)Software Technology Studio(Limited Partnership),Shanghai 211206,China

出　　处：《Journal of Electronic Research and Application》2024年第3期78-82,共5页电子研究与应用

摘　　要：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.

关 键 词：AGV Path planning AGV scheduling system BFS algorithm 

分 类 号：TP3[自动化与计算机技术—计算机科学与技术]