自动化集装箱码头中多agv路径规划研究

Mengting Yu, Zhiling He, Dawei Li, Liang Yin
{"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}
引用次数: 0

摘要

为了缓解自动化终端的交通拥堵,避免碰撞,提高装卸效率,本研究考虑了道路拥堵因素,提出了一种预测性两阶段路径规划算法。首先,建立了自动终端的交通流模型,设计了考虑道路拥堵的策略。其次,提出了一种改进的A*算法来寻找agv的最短路径。在此基础上,提出了一种基于时间窗的预测两阶段路径规划算法,并与动态路径规划算法比较,为每台AGV规划一条无冲突的路径。最后,通过同时模拟两种算法的装卸量、最大活动agv数量和寻路失败次数,验证了采用两阶段算法的合理性和可行性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信