{"title":"自动化集装箱码头中多agv路径规划研究","authors":"Mengting Yu, Zhiling He, Dawei Li, Liang Yin","doi":"10.1109/ICTIS.2019.8883847","DOIUrl":null,"url":null,"abstract":"In order to alleviate traffic congestion, avoid collisions and improve loading and unloading efficiency at the automated terminal, this study considers the factor of road congestion and a predictive two-stage path planning algorithm is proposed. Firstly, a traffic flow model of automatic terminal is established and the strategy of considering road congestion is designed. Secondly, an improved A* algorithm is proposed to find the shortest path of AGVs. On the basis of the above, a predictive two-stage path planning algorithm based on time window is proposed, and the dynamic path planning algorithm is used as a comparison to plan a conflict-free path for each AGV. Finally, the rationality and feasibility of using the two-stage algorithm are verified by simulating the loading and unloading amount, the maximum number of active AGVs and the number of path-finding failures of the two algorithms in the same time.","PeriodicalId":325712,"journal":{"name":"2019 5th International Conference on Transportation Information and Safety (ICTIS)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Research on multi-AGV path planning in automated container terminal\",\"authors\":\"Mengting Yu, Zhiling He, Dawei Li, Liang Yin\",\"doi\":\"10.1109/ICTIS.2019.8883847\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In order to alleviate traffic congestion, avoid collisions and improve loading and unloading efficiency at the automated terminal, this study considers the factor of road congestion and a predictive two-stage path planning algorithm is proposed. Firstly, a traffic flow model of automatic terminal is established and the strategy of considering road congestion is designed. Secondly, an improved A* algorithm is proposed to find the shortest path of AGVs. On the basis of the above, a predictive two-stage path planning algorithm based on time window is proposed, and the dynamic path planning algorithm is used as a comparison to plan a conflict-free path for each AGV. Finally, the rationality and feasibility of using the two-stage algorithm are verified by simulating the loading and unloading amount, the maximum number of active AGVs and the number of path-finding failures of the two algorithms in the same time.\",\"PeriodicalId\":325712,\"journal\":{\"name\":\"2019 5th International Conference on Transportation Information and Safety (ICTIS)\",\"volume\":\"40 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 5th International Conference on Transportation Information and Safety (ICTIS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICTIS.2019.8883847\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 5th International Conference on Transportation Information and Safety (ICTIS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICTIS.2019.8883847","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Research on multi-AGV path planning in automated container terminal
In order to alleviate traffic congestion, avoid collisions and improve loading and unloading efficiency at the automated terminal, this study considers the factor of road congestion and a predictive two-stage path planning algorithm is proposed. Firstly, a traffic flow model of automatic terminal is established and the strategy of considering road congestion is designed. Secondly, an improved A* algorithm is proposed to find the shortest path of AGVs. On the basis of the above, a predictive two-stage path planning algorithm based on time window is proposed, and the dynamic path planning algorithm is used as a comparison to plan a conflict-free path for each AGV. Finally, the rationality and feasibility of using the two-stage algorithm are verified by simulating the loading and unloading amount, the maximum number of active AGVs and the number of path-finding failures of the two algorithms in the same time.