Multi-AGV Path Planning Method via Reinforcement Learning and Particle Filters

TL;DR

This paper introduces a novel multi-AGV path planning method combining reinforcement learning and particle filters, significantly improving efficiency and path quality over traditional methods through iterative neural network and particle filter fusion.

Contribution

The paper proposes PF-DDQN, a new approach that integrates particle filters with double deep Q-networks to enhance convergence speed and path planning performance in multi-AGV systems.

Findings

Outperforms traditional DDQN in path quality by 92.62%.

Reduces training time by 76.88%.

Validated through multiple numerical simulations.

Abstract

Thanks to its robust learning and search stabilities,the reinforcement learning (RL) algorithm has garnered increasingly significant attention and been exten-sively applied in Automated Guided Vehicle (AGV) path planning. However, RL-based planning algorithms have been discovered to suffer from the substantial variance of neural networks caused by environmental instability and significant fluctua-tions in system structure. These challenges manifest in slow convergence speed and low learning efficiency. To tackle this issue, this paper presents a novel multi-AGV path planning method named Particle Filters - Double Deep Q-Network (PF-DDQN)via leveraging Particle Filters (PF) and RL algorithm. Firstly, the proposed method leverages the imprecise weight values of the network as state values to formulate thestate space equation.Subsequently, the DDQN model is optimized to acquire the optimal true weight values through the iterative fusion process of neural networksand PF in order to enhance the optimization efficiency of the proposedmethod. Lastly, the performance of the proposed method is validated by different numerical simulations. The simulation results demonstrate that the proposed methoddominates the traditional DDQN algorithm in terms of path planning superiority andtraining time indicator by 92.62% and 76.88%, respectively. Therefore, the proposedmethod could be considered as a vital alternative in the field of multi-AGV path planning.