{"title":"Research on multi-AGV scheduling for intelligent storage based on improved genetic algorithm","authors":"Haowen Sun, Liming Zhao","doi":"10.1109/PRMVIA58252.2023.00041","DOIUrl":null,"url":null,"abstract":"Intelligent storage has become an important part of various logistics industries, and task assignment of multi-mobile robots is an important part of intelligent storage. In this paper, the robot transport cost and no-load operation cost and task completion time cost and task assignment balance are used as optimization objectives. An improved genetic algorithm is proposed for the optimization of task assignment of multi-mobile robots. By establishing a mathematical model; adaptively adjusting the crossover probability and the fitness function of the improved genetic algorithm are used to improve the convergence speed and convergence of the population. Example simulations show that the improved genetic algorithm converges faster and has a better assignment.","PeriodicalId":221346,"journal":{"name":"2023 International Conference on Pattern Recognition, Machine Vision and Intelligent Algorithms (PRMVIA)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2023-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2023 International Conference on Pattern Recognition, Machine Vision and Intelligent Algorithms (PRMVIA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PRMVIA58252.2023.00041","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
Intelligent storage has become an important part of various logistics industries, and task assignment of multi-mobile robots is an important part of intelligent storage. In this paper, the robot transport cost and no-load operation cost and task completion time cost and task assignment balance are used as optimization objectives. An improved genetic algorithm is proposed for the optimization of task assignment of multi-mobile robots. By establishing a mathematical model; adaptively adjusting the crossover probability and the fitness function of the improved genetic algorithm are used to improve the convergence speed and convergence of the population. Example simulations show that the improved genetic algorithm converges faster and has a better assignment.