基于 A*-DQN 算法的无人机动态环境路径规划研究

打开文本图片集
DOI:10.19850/j.cnki.2096-4706.2026.14.012
中图分类号:TP181
文献标识码:A
文章编号:2096-4706(2026)14-0060-04
Research on UAV Path Planning in Dynamic Environments Based on A*-DQN Algorithm
JI Feng
(Shanxi Polytechnic College, Taiyuan 030006, China)
Abstract: To address the issues of insufficient dynamic adaptability of the A* algorithm and the slow convergence and low exploration efficiency of the Deep Q-Network (DQN) algorithm in UAV path planning within complex dynamic scenarios, this study proposes an A*-DQN fusion path planning algorithm. This algorithm utilizes the static global optimal path generated by A* as guidance. It incorporates a hierarchical progressive reward mechanism combined with an adaptive weight adjustment strategy oriented toward dynamic obstacles to achieve a balance between global path optimization and dynamic obstacle avoidance. Experimental results demonstrate that, compared with the traditional DQN algorithm, the A*-DQN algorithm achieves higher convergence speed and test success rates. Furthermore, the efficiency and stability of path planning in dynamic environments are improved. This study provides a feasible technical approach for UAV path planning in dynamic environments and holds practical reference value.
Keywords: A*-DQN; UAV path planning; dynamic obstacle avoidance; reinforcement learning
0 引言
目前,无人机在应急救援、电力巡检、城市物流等领域的应用日渐成熟[1],复杂多变的现场环境对无人机路径规划在全局优化、动态实时响应、快速部署等方面提出了很高要求。(剩余9290字)