Efficient Dynamic Path Planning Algorithm for ASVs Based on Transfer Reinforcement Learning
IEEE Transactions on Intelligent Transportation Systems · 2025-11 · 26 (11) · 19270-19280
DOI: 10.1109/tits.2025.3590732 ↗Kurz gefasst
Fachartikel in der Zeitschrift IEEE Transactions on Intelligent Transportation Systems, 2025-11. Verfasst von Xinli Xu und 4 weiteren Autor:innen. Die Arbeit wurde bisher 7-mal zitiert (Crossref) und nennt 24 Literaturangaben. Gefördert von: National Natural Science Foundation of China.
Abstract (Originalsprache)
Autonomous surface vessels (ASVs) play a crucial role in military, civilian and scientific research fields, and path planning technology is the foundation for ensuring the navigation of ASVs. However, reinforcement learning algorithms face challenges in path planning, such as low sample utilization efficiency and difficulties in collecting effective data. To address these issues, this paper proposes an efficient reinforcement learning path planning algorithm based on knowledge transfer. First, a state similarity model is introduced to measure the differences between source and target samples. By identifying and transferring similar samples, the learning speed for new tasks is significantly accelerated. Second, considering the complex rules of the International Regulations for Preventing Collisions at Sea (COLREGs), high-quality collision avoidance samples from the source task are selected as knowledge transfer objects, thereby reducing the failure rate of agents in the collision avoidance process. Finally, the impact of the proportion of source task samples in the total sample pool on algorithm performance is analyzed. A progressive exploration method based on sample proportion is established to mitigate the issue of negative transfer. Simulation results demonstrate that the collision avoidance success rate of the algorithm has been significantly improved, with an average success rate of 91% across five typical collision avoidance scenarios—an increase of over 30% compared to the traditional DDPG algorithm. The convergence speed of the reward value improved by 50% after 1000 training episodes. Real-world ship tests verified that it can achieve real-time collision avoidance in complex environments, with a path safety compliance rate of 100%. The algorithm effectively enhances the reliability and safety of autonomous navigation for ASVs.
Förderung
- National Natural Science Foundation of China
Zitieren
APA
Xu, X., Liu, X., Zhao, Y., Chen, Q., & Zhu, D. (2025). Efficient Dynamic Path Planning Algorithm for ASVs Based on Transfer Reinforcement Learning. IEEE Transactions on Intelligent Transportation Systems, 26(11), 19270-19280. https://doi.org/10.1109/tits.2025.3590732
Vancouver
Xu X, Liu X, Zhao Y, Chen Q, Zhu D. Efficient Dynamic Path Planning Algorithm for ASVs Based on Transfer Reinforcement Learning. IEEE Transactions on Intelligent Transportation Systems. 2025;26(11):19270-19280. doi:10.1109/tits.2025.3590732
BibTeX
@article{Xu2025,
author = {Xu, Xinli and Liu, Xinyu and Zhao, Yapeng and Chen, Qi and Zhu, Daqi},
title = {Efficient Dynamic Path Planning Algorithm for ASVs Based on Transfer Reinforcement Learning},
journal = {IEEE Transactions on Intelligent Transportation Systems},
year = {2025},
volume = {26},
number = {11},
pages = {19270--19280},
doi = {10.1109/tits.2025.3590732}
}
EUVIMED