Multi-robot path planning based on a deep reinforcement learning DQN algorithm

CAAI Transactions on Intelligence Technology

article

Yang Yang¹  Li Juntao²  Peng Lingling² 

[1] School of Management, China University of Mining and Technology (Beijing);School of Information, Beijing Wuzi University

关键词: multi-robot systems;    mobile robots;    learning (artificial intelligence);    path planning;    scheduling system algorithm;    warehouse picking operation;    handling robot;    unmanned warehouse dispatching system;    path-planning problems;    classic deep reinforcement learning algorithm;    improved DQN algorithm converges;    algorithmic process;    robot path-planning problem;    multirobot path planning;    volume-based technology;    Q-learning algorithm;    deep Q-network algorithm;   

DOI  :  10.1049/trit.2020.0024

学科分类：数学（综合）

来源: Wiley

【 摘 要 】

The unmanned warehouse dispatching system of the ‘goods to people’ model uses a structure mainly based on a handling robot, which saves considerable manpower and improves the efficiency of the warehouse picking operation. However, the optimal performance of the scheduling system algorithm has high requirements. This study uses a deep Q-network (DQN) algorithm in a deep reinforcement learning algorithm, which combines the Q-learning algorithm, an empirical playback mechanism, and the volume-based technology of productive neural networks to generate target Q -values to solve the problem of multi-robot path planning. The aim of the Q-learning algorithm in deep reinforcement learning is to address two shortcomings of the robot path-planning problem: slow convergence and excessive randomness. Preceding the start of the algorithmic process, prior knowledge and prior rules are used to improve the DQN algorithm. Simulation results show that the improved DQN algorithm converges faster than the classic deep reinforcement learning algorithm and can more quickly learn the solutions to path-planning problems. This improves the efficiency of multi-robot path planning.

【 授权许可】

CC BY|CC BY-ND|CC BY-NC|CC BY-NC-ND