Path planning of mobile robot based on improved DDQN

摘要

Abstract Aiming at the problem of overestimation and sparse rewards of deep Q network algorithm in mobile robot path planning in reinforcement learning, an improved algorithm HERDDQN is proposed. Through the deep convolutional neural network model, the original RGB image is used as input, and it is trained through an end-to-end method. The improved deep reinforcement learning algorithm and the deep Q network algorithm are simulated in the same two-dimensional environment. The experimental results show that the HERDDQN algorithm solves the problem of overestimation and sparse reward better than the DQN algorithm in terms of success rate and reward convergence speed, Which shows that the improved algorithm finds a better strategy than the DQN algorithm.