An Optimized Path Planning Method for Coastal Ships Based on Improved DDPG and DP

• Published in: Journal of advanced transportation Vol. 2021; pp. 1 - 23
• Main Authors: Du, Yiquan, Zhang, Xiuguo, Cao, Zhiying, Wang, Shaobo, Liang, Jiacheng, Zhang, Fengge, Tang, Jiawei
• Format: Journal Article
• Language: English
• Published: London Hindawi 2021; John Wiley & Sons, Inc; Wiley
• Subjects: Algorithms; Analysis; Automation; Convergence; Deep learning; Energy consumption; Intelligence; Learning; Long short-term memory; Machine learning; Methods; Navigation; Neural networks; Optimization; Path planning; Planning; Reinforcement; Sailing; Ships; Transportation
• ISSN: 0197-6729; 2042-3195; 2042-3195
• DOI: 10.1155/2021/7765130

Deep Reinforcement Learning (DRL) is widely used in path planning with its powerful neural network fitting ability and learning ability. However, existing DRL-based methods use discrete action space and do not consider the impact of historical state information, resulting in the algorithm not being able to learn the optimal strategy to plan the path, and the planned path has arcs or too many corners, which does not meet the actual sailing requirements of the ship. In this paper, an optimized path planning method for coastal ships based on improved Deep Deterministic Policy Gradient (DDPG) and Douglas–Peucker (DP) algorithm is proposed. Firstly, Long Short-Term Memory (LSTM) is used to improve the network structure of DDPG, which uses the historical state information to approximate the current environmental state information, so that the predicted action is more accurate. On the other hand, the traditional reward function of DDPG may lead to low learning efficiency and convergence speed of the model. Hence, this paper improves the reward principle of traditional DDPG through the mainline reward function and auxiliary reward function, which not only helps to plan a better path for ship but also improves the convergence speed of the model. Secondly, aiming at the problem that too many turning points exist in the above-planned path which may increase the navigation risk, an improved DP algorithm is proposed to further optimize the planned path to make the final path more safe and economical. Finally, simulation experiments are carried out to verify the proposed method from the aspects of plan planning effect and convergence trend. Results show that the proposed method can plan safe and economic navigation paths and has good stability and convergence.