{"title":"Collaborative Path Planning Algorithm for Multiple AGVs","authors":"Yiming Chen, Mingxin Yuan, M. Cong, Dong Liu","doi":"10.1109/ICRAI57502.2023.10089588","DOIUrl":null,"url":null,"abstract":"Aiming at the problem of material distribution in industrial production workshops, this paper proposes a multi AGVs collaborative path planning method based on genetic algorithm (GA) to improve its logistics management level and production efficiency. The improvement of the algorithm is to “explore” as many paths as possible. It uses information entropy to measure the diversity of the group and the constraints within the space to set the rewards and punishments. According to the set cooperation mechanism, it reduces the standby state of the robot without tasks, balances the workload of each robot, and finally realizes the goal of shortening the system running time on the basis of ensuring the safe operation of the system. The advantages and disadvantages of the algorithm are measured by the number of iterations and rewards when the algorithm tends to be stable. The effectiveness of the optimization algorithm is finally proved.","PeriodicalId":447565,"journal":{"name":"2023 International Conference on Robotics and Automation in Industry (ICRAI)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2023 International Conference on Robotics and Automation in Industry (ICRAI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICRAI57502.2023.10089588","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
Aiming at the problem of material distribution in industrial production workshops, this paper proposes a multi AGVs collaborative path planning method based on genetic algorithm (GA) to improve its logistics management level and production efficiency. The improvement of the algorithm is to “explore” as many paths as possible. It uses information entropy to measure the diversity of the group and the constraints within the space to set the rewards and punishments. According to the set cooperation mechanism, it reduces the standby state of the robot without tasks, balances the workload of each robot, and finally realizes the goal of shortening the system running time on the basis of ensuring the safe operation of the system. The advantages and disadvantages of the algorithm are measured by the number of iterations and rewards when the algorithm tends to be stable. The effectiveness of the optimization algorithm is finally proved.