Optimizing Path Planning and Conflict Resolution in High-Density AS/RS With a Multishuttle Cooperative Scheduling Framework

The internal environment of a high-density automated storage and retrieval system (AS/RS) can be characterized as a grid map scenario and is highly complex, due to the narrow space for shuttle movement, restricted alleys, and the need for dynamic obstacle avoidance involving goods. Consequently, the design and optimization of the multi-shuttle scheduling system are crucial for enhancing the overall operational efficiency. Therefore, this study proposes a pioneering framework for a multi-shuttle cooperative scheduling system (MSCSS), which can serve as a widely referenced model for future research on single-shuttle path planning and multi-shuttle conflict avoidance in AS/RS. To address the issues of balancing efficiency with path length, reducing path conflicts in dense goods areas, and minimizing turning points in single-shuttle path planning, a fuzzy minority obstacle side A* (FMOSA*) algorithm is proposed, which combines minimal obstacle side considerations with turning costs. To resolve the problems caused by single avoidance rules, including poor handling of unexpected tasks and resulting shuttle idle time, an adaptive time window algorithm based on grid maps (GMATW) is proposed to improve shuttle and road utilization. Finally, the proposed MSCSS is experimentally validated in both real and simulated warehouse environments. Experimental results indicate that MSCSS not only effectively avoids densely packed goods areas and minimizes shuttle turning times but also ensures the shortest paths and enhances planning efficiency. Moreover, it comprehensively resolves various conflict types within the system, effectively handles unexpected tasks, and reduces idle time for the shuttles. The proposed scheduling system architecture addresses the cooperative scheduling of four-way shuttles in complex environments and offers insights for the development of efficient scheduling systems in high-density automated storage and retrieval systems.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Instrumentation and Measurement
Published
2025-01-01
DOI
https://doi.org/10.1109/tim.2025.3581635
Citations
1
Primary Topic
Robotic Path Planning Algorithms
Type
article
Field-Weighted Citation Impact
1.28

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Optimizing Path Planning and Conflict Resolution in High-Density AS/RS With a Multishuttle Cooperative Scheduling Framework

X. Qian, G.S. Chen, Yu Hu, Y. Y. Ji et al.
1 citations
IEEE Transactions on Instrumentation and Measurement
Robotic Path Planning Algorithms
1.28
article

Optimizing Path Planning and Conflict Resolution in High-Density AS/RS With a Multishuttle Cooperative Scheduling Framework

X. Qian, G.S. Chen, Yu Hu, Y. Y. Ji, Yongxin Cao, Xiangpeng Liu, Kang An, Yuhua Cheng, Fuqiang Wu, Yulin Peng
article en
1 citations

Abstract

The internal environment of a high-density automated storage and retrieval system (AS/RS) can be characterized as a grid map scenario and is highly complex, due to the narrow space for shuttle movement, restricted alleys, and the need for dynamic obstacle avoidance involving goods. Consequently, the design and optimization of the multi-shuttle scheduling system are crucial for enhancing the overall operational efficiency. Therefore, this study proposes a pioneering framework for a multi-shuttle cooperative scheduling system (MSCSS), which can serve as a widely referenced model for future research on single-shuttle path planning and multi-shuttle conflict avoidance in AS/RS. To address the issues of balancing efficiency with path length, reducing path conflicts in dense goods areas, and minimizing turning points in single-shuttle path planning, a fuzzy minority obstacle side A* (FMOSA*) algorithm is proposed, which combines minimal obstacle side considerations with turning costs. To resolve the problems caused by single avoidance rules, including poor handling of unexpected tasks and resulting shuttle idle time, an adaptive time window algorithm based on grid maps (GMATW) is proposed to improve shuttle and road utilization. Finally, the proposed MSCSS is experimentally validated in both real and simulated warehouse environments. Experimental results indicate that MSCSS not only effectively avoids densely packed goods areas and minimizes shuttle turning times but also ensures the shortest paths and enhances planning efficiency. Moreover, it comprehensively resolves various conflict types within the system, effectively handles unexpected tasks, and reduces idle time for the shuttles. The proposed scheduling system architecture addresses the cooperative scheduling of four-way shuttles in complex environments and offers insights for the development of efficient scheduling systems in high-density automated storage and retrieval systems.

IEEE Transactions on Instrumentation and MeasurementVol. 74
Peking University (CN), Shanghai Normal University (CN), Shanghai University of Electric Power (CN), China Electric Equipment Group (China) (CN), Institute of Microelectronics (CN), Shanghai Fudan Microelectronics (China) (CN)
National Natural Science Foundation of China
Openalex Percentile: Top 19%
Robotic Path Planning Algorithms
1.28
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.