Research on UAV Path Planning Algorithm Based on Improved DQN
To address the issues of insufficient exploration capability and long training times in the classic DQN algorithm for UAV path planning, an improved DQN path planning algorithm is proposed. This algorithm optimizes the reward function by redefining the reward signals, enabling the UAV to more intelligently perceive the environment and task requirements. To enhance the UAV's exploration ability, the algorithm also introduces an adaptive epsilon adjustment mechanism, allowing the UAV to automatically adjust its exploration strategy according to the environment and task. In simulation experiments, the average path planning time was only 0.09s, and the path length was only 50m. The training time of the algorithm was reduced from 12 hours to 4 hours.
Authors
- Dongchun Wu
- Ti Wang (ORCID: https://orcid.org/0000-0002-6828-7277)
- Shan Yang (ORCID: https://orcid.org/0000-0001-6914-676X)
- Haina Ye
- Zhongyan Du
- Xinwei Wang (ORCID: https://orcid.org/0000-0001-5393-1931)
- Xiaobo Wang (ORCID: https://orcid.org/0009-0006-1514-7867)
Institutions
- Zhejiang University of Science and Technology (CN)
- China United Network Communications Group (China) (CN)
Publication Details
- Published
- 2024-11-22
- DOI
- https://doi.org/10.1109/ifeea64237.2024.10878744
- Primary Topic
- Robotic Path Planning Algorithms
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- National Key Research and Development Program of China