Task Allocation Algorithm and Simulation Analysis for Multiple <scp>AMRs</scp> in Digital‐Intelligent Warehouses

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.

Authors

Institutions

Publication Details

Journal
Concurrency and Computation Practice and Experience
Published
2025-02-10
DOI
https://doi.org/10.1002/cpe.8382
Citations
2
Primary Topic
Scheduling and Optimization Algorithms
Type
article
Field-Weighted Citation Impact
2.48
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

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

Zixia Chen, Bingda Zhang, T. Gu, Zelin Chen
2 citations
Concurrency and Computation Practice and Experience
Scheduling and Optimization Algorithms
2.48
article

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

Zixia Chen, Bingda Zhang, T. Gu, Zelin Chen
article en
2 citations

Abstract

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.

Concurrency and Computation Practice and ExperienceVol. 37(4-5)
DigiLens (United States) (US)
Openalex Percentile: Top 12%
Scheduling and Optimization Algorithms
2.48
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.