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

Yang Yang

doi:10.1049/trit.2020.0024

Return

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

2020-08-03

125

Yang Yang

Juntao Li *

Lingling Peng

DOI：10.1049/trit.2020.0024

Original

Save

View PDF

Abstract

En 中文

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.

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.