A Multi-Agent Deep Reinforcement Learning Approach for Multiple AGVs Scheduling in Automated Container Terminals

The equipment scheduling method of automated container terminals is gradually evolving towards intelligence and automation. In this paper, a novel multi-agent deep reinforcement learning algorithm called Coupling Deep Q-network (C-DQN) is proposed to address the automated guided vehicles (AGV) scheduling problem. Specifically, the sparse reward problem of the proposed algorithm model is solved by a mask. The convergence of the model is accelerated by changing the greedy rate with a fixed step size. The shape of samples in the experience replay buffer is also improved through the methods of the centralized training and decentralized execution. Furthermore, the scheduling conflict problem caused by the cooperative game is reduced, and the overall efficiency of the scheduling task is also improved. Finally, the scenario of multi-AGV scheduling is designed to verify the effectiveness and efficiency of the proposed C-DQN algorithm.

Authors

Institutions

Publication Details

Published
2024-11-01
DOI
https://doi.org/10.1109/cac63892.2024.10865584
Citations
2
Primary Topic
Advanced Manufacturing and Logistics Optimization
Type
article
Field-Weighted Citation Impact
0.70

Funders

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

A Multi-Agent Deep Reinforcement Learning Approach for Multiple AGVs Scheduling in Automated Container Terminals

Jianbin Qiu, Yannan Bi, Fei Wang, Pansheng Ding
2 citations
Advanced Manufacturing and Logistics Optimization
0.70
article

A Multi-Agent Deep Reinforcement Learning Approach for Multiple AGVs Scheduling in Automated Container Terminals

Jianbin Qiu, Yannan Bi, Fei Wang, Pansheng Ding
article en
2 citations

Abstract

The equipment scheduling method of automated container terminals is gradually evolving towards intelligence and automation. In this paper, a novel multi-agent deep reinforcement learning algorithm called Coupling Deep Q-network (C-DQN) is proposed to address the automated guided vehicles (AGV) scheduling problem. Specifically, the sparse reward problem of the proposed algorithm model is solved by a mask. The convergence of the model is accelerated by changing the greedy rate with a fixed step size. The shape of samples in the experience replay buffer is also improved through the methods of the centralized training and decentralized execution. Furthermore, the scheduling conflict problem caused by the cooperative game is reduced, and the overall efficiency of the scheduling task is also improved. Finally, the scenario of multi-AGV scheduling is designed to verify the effectiveness and efficiency of the proposed C-DQN algorithm.

Harbin Institute of Technology (CN)
National Natural Science Foundation of China
Openalex Percentile: Top 23%
Advanced Manufacturing and Logistics Optimization
0.70
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.

A Multi-Agent Deep Reinforcement Learning Approach for Multiple AGVs Scheduling in Automated Container Terminals — Jianbin Qiu, Yannan Bi, et al. · (2024) | TGRS Research Map | TGRS