Task Allocation Algorithm and Simulation Analysis for Multiple AMRs in Digital-Intelligent Warehouses

IF 1.5 4区 计算机科学 Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING Concurrency and Computation-Practice & Experience Pub Date : 2025-02-10 DOI:10.1002/cpe.8382
Zixia Chen, Tingquan Gu, Zelin Chen, Bingda Zhang
{"title":"Task Allocation Algorithm and Simulation Analysis for Multiple AMRs in Digital-Intelligent Warehouses","authors":"Zixia Chen,&nbsp;Tingquan Gu,&nbsp;Zelin Chen,&nbsp;Bingda Zhang","doi":"10.1002/cpe.8382","DOIUrl":null,"url":null,"abstract":"<div>\n \n <p>In digital-intelligent warehouses, the heavy handling tasks, complex algorithms with high computational demands, and vast solution spaces pose significant challenges to achieving stable, efficient, and balanced operation of multiple Autonomous Mobile Robots (AMRs) for automated cargo handling. This paper focuses on a virtual smart warehouse environment and employs Python software to conduct simulation experiments for multi-AMR task allocation. The simulated smart warehouse comprises three idle AMRs and 16 task points that require transportation. The experimental simulations demonstrate that the improved genetic algorithm can find the global optimal solution with relatively low computational cost, meeting the fast response requirements in real-world operations. It enables stable operation, high efficiency, and balanced task allocation for multiple AMRs. The simulation results validate the reliability of the proposed method, effectively addressing the issues of multi-AMR task allocation and path planning in digital-intelligent warehouses.</p>\n </div>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"37 4-5","pages":""},"PeriodicalIF":1.5000,"publicationDate":"2025-02-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Concurrency and Computation-Practice & Experience","FirstCategoryId":"94","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1002/cpe.8382","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
引用次数: 0

Abstract

In digital-intelligent warehouses, the heavy handling tasks, complex algorithms with high computational demands, and vast solution spaces pose significant challenges to achieving stable, efficient, and balanced operation of multiple Autonomous Mobile Robots (AMRs) for automated cargo handling. This paper focuses on a virtual smart warehouse environment and employs Python software to conduct simulation experiments for multi-AMR task allocation. The simulated smart warehouse comprises three idle AMRs and 16 task points that require transportation. The experimental simulations demonstrate that the improved genetic algorithm can find the global optimal solution with relatively low computational cost, meeting the fast response requirements in real-world operations. It enables stable operation, high efficiency, and balanced task allocation for multiple AMRs. The simulation results validate the reliability of the proposed method, effectively addressing the issues of multi-AMR task allocation and path planning in digital-intelligent warehouses.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
数字智能仓库中多个amr的任务分配算法及仿真分析
在数字智能仓库中,处理任务繁重、算法复杂、计算量大、求解空间大,对实现多台自主移动机器人(amr)稳定、高效、均衡的自动化货物处理提出了重大挑战。本文以虚拟智能仓库环境为研究对象,利用Python软件进行多amr任务分配的仿真实验。模拟的智能仓库包括3个闲置的amr和16个需要运输的任务点。实验仿真表明,改进的遗传算法能够以较低的计算成本找到全局最优解,满足实际操作中的快速响应要求。实现多个amr运行稳定、效率高、任务分配均衡。仿真结果验证了该方法的可靠性,有效地解决了数字智能仓库中多amr任务分配和路径规划问题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Concurrency and Computation-Practice & Experience
Concurrency and Computation-Practice & Experience 工程技术-计算机:理论方法
CiteScore
5.00
自引率
10.00%
发文量
664
审稿时长
9.6 months
期刊介绍: Concurrency and Computation: Practice and Experience (CCPE) publishes high-quality, original research papers, and authoritative research review papers, in the overlapping fields of: Parallel and distributed computing; High-performance computing; Computational and data science; Artificial intelligence and machine learning; Big data applications, algorithms, and systems; Network science; Ontologies and semantics; Security and privacy; Cloud/edge/fog computing; Green computing; and Quantum computing.
期刊最新文献
Deep Reinforcement Learning for Cloud Manufacturing Task Scheduling via Sparse-Reward Optimization MGIRN: A Mask-Guided Network for Layout-Preserving and Creative Image Regeneration Lightweight Zero-Trust Curve Protocol for Securing Resource-Constrained Devices in Edge Network MGIRN: A Mask-Guided Network for Layout-Preserving and Creative Image Regeneration Lightweight Zero-Trust Curve Protocol for Securing Resource-Constrained Devices in Edge Network
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1