一种用于AGV避免死锁的条纹块搜索方法

Xinyu Chen, Tingqi Zhang, Weimin Wu, Ruifen Hu
{"title":"一种用于AGV避免死锁的条纹块搜索方法","authors":"Xinyu Chen, Tingqi Zhang, Weimin Wu, Ruifen Hu","doi":"10.1109/ICNSC52481.2021.9702207","DOIUrl":null,"url":null,"abstract":"With the increasing development of automated logistics systems, automated guided vehicles (AGVs) have been gradually deployed in various logistics systems. AGVs are mainly used to transport materials and products, which promote the efficiency greatly and provide profound flexibility and safety. The strategy to prevent AGVs from forming deadlocks is one of the fundamental and vital issues in applications. In this paper, a common type of deadlock that usually occurs in warehouses and a typical attribute of map called fringe blocks are studied thoroughly. To solve the deadlock, it’s crucial to identify fringe blocks. We first use traditional depth first search algorithm (DFS) to find out all the fringe blocks in the map. Then, confronted with the huge time complexity, we combine the DFS procedure with a high-efficiency trimming method. Finally, we run a simulation and make a comparison of both methods. The simulation results have shown that the proposed strategy will reduce computational time significantly without making false judgements.","PeriodicalId":129062,"journal":{"name":"2021 IEEE International Conference on Networking, Sensing and Control (ICNSC)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Novel Searching Method of Fringe Blocks for AGV Deadlock Avoidance\",\"authors\":\"Xinyu Chen, Tingqi Zhang, Weimin Wu, Ruifen Hu\",\"doi\":\"10.1109/ICNSC52481.2021.9702207\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"With the increasing development of automated logistics systems, automated guided vehicles (AGVs) have been gradually deployed in various logistics systems. AGVs are mainly used to transport materials and products, which promote the efficiency greatly and provide profound flexibility and safety. The strategy to prevent AGVs from forming deadlocks is one of the fundamental and vital issues in applications. In this paper, a common type of deadlock that usually occurs in warehouses and a typical attribute of map called fringe blocks are studied thoroughly. To solve the deadlock, it’s crucial to identify fringe blocks. We first use traditional depth first search algorithm (DFS) to find out all the fringe blocks in the map. Then, confronted with the huge time complexity, we combine the DFS procedure with a high-efficiency trimming method. Finally, we run a simulation and make a comparison of both methods. The simulation results have shown that the proposed strategy will reduce computational time significantly without making false judgements.\",\"PeriodicalId\":129062,\"journal\":{\"name\":\"2021 IEEE International Conference on Networking, Sensing and Control (ICNSC)\",\"volume\":\"28 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-12-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 IEEE International Conference on Networking, Sensing and Control (ICNSC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICNSC52481.2021.9702207\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 IEEE International Conference on Networking, Sensing and Control (ICNSC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICNSC52481.2021.9702207","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

随着自动化物流系统的日益发展,自动导引车(agv)已逐步应用于各种物流系统中。agv主要用于运输物料和产品,极大地提高了效率,并提供了极大的灵活性和安全性。防止agv形成死锁的策略是应用中最基本和最重要的问题之一。本文对仓库中常见的一种死锁类型和地图的一种典型属性——边缘块进行了深入的研究。要解决死锁,关键是要识别边缘块。我们首先使用传统的深度优先搜索算法(depth first search algorithm, DFS)找出地图中所有的边缘块。然后,面对巨大的时间复杂度,我们将DFS过程与一种高效的裁剪方法相结合。最后进行了仿真,并对两种方法进行了比较。仿真结果表明,该策略在不产生错误判断的情况下显著减少了计算时间。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Novel Searching Method of Fringe Blocks for AGV Deadlock Avoidance
With the increasing development of automated logistics systems, automated guided vehicles (AGVs) have been gradually deployed in various logistics systems. AGVs are mainly used to transport materials and products, which promote the efficiency greatly and provide profound flexibility and safety. The strategy to prevent AGVs from forming deadlocks is one of the fundamental and vital issues in applications. In this paper, a common type of deadlock that usually occurs in warehouses and a typical attribute of map called fringe blocks are studied thoroughly. To solve the deadlock, it’s crucial to identify fringe blocks. We first use traditional depth first search algorithm (DFS) to find out all the fringe blocks in the map. Then, confronted with the huge time complexity, we combine the DFS procedure with a high-efficiency trimming method. Finally, we run a simulation and make a comparison of both methods. The simulation results have shown that the proposed strategy will reduce computational time significantly without making false judgements.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信