TY - GEN
T1 - DRL-Based Adaptive Dynamic Window Approach for Path Planning of UAV in Dynamic Environments
AU - Meng, Kai
AU - Wu, Binghong
AU - Chen, Chen
N1 - Publisher Copyright:
© 2025 IEEE.
PY - 2025
Y1 - 2025
N2 - The path planning and obstacle avoidance in dy-namic environments are crucial challenges for UAV autonomous navigation. While the dynamic window approach (DWA) is widely used for such tasks, it suffers from poor robustness and a high dependency on parameter tuning. To overcome these limitations, we propose DBADWA, an adaptive algorithm that integrates deep reinforcement learning with DWA to dynamically predict optimal weighting parameters, enhancing local navigation. In DBADWA, the action space is restructured using key parameters of DWA, including target heading deviation, distance to the nearest obstacle, and velocity. To address the issue of sparse rewards, we enhance the reward function of the advantage actor-critic model by incorporating the distance to obstacles alongside DWA's metrics, such as distance, velocity, and heading. Exper-imental results across various dynamic scenarios demonstrate that DBADWA significantly reduces path length, shortens arrival times, and improves adaptability, outperforming existing methods in complex environments.
AB - The path planning and obstacle avoidance in dy-namic environments are crucial challenges for UAV autonomous navigation. While the dynamic window approach (DWA) is widely used for such tasks, it suffers from poor robustness and a high dependency on parameter tuning. To overcome these limitations, we propose DBADWA, an adaptive algorithm that integrates deep reinforcement learning with DWA to dynamically predict optimal weighting parameters, enhancing local navigation. In DBADWA, the action space is restructured using key parameters of DWA, including target heading deviation, distance to the nearest obstacle, and velocity. To address the issue of sparse rewards, we enhance the reward function of the advantage actor-critic model by incorporating the distance to obstacles alongside DWA's metrics, such as distance, velocity, and heading. Exper-imental results across various dynamic scenarios demonstrate that DBADWA significantly reduces path length, shortens arrival times, and improves adaptability, outperforming existing methods in complex environments.
KW - dy-namic environments
KW - dynamic window approach
KW - path planning
KW - sparse reward
UR - https://www.scopus.com/pages/publications/105013958956
U2 - 10.1109/CCDC65474.2025.11091120
DO - 10.1109/CCDC65474.2025.11091120
M3 - Conference contribution
AN - SCOPUS:105013958956
T3 - Proceedings of the 37th Chinese Control and Decision Conference, CCDC 2025
SP - 6117
EP - 6122
BT - Proceedings of the 37th Chinese Control and Decision Conference, CCDC 2025
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 37th Chinese Control and Decision Conference, CCDC 2025
Y2 - 16 May 2025 through 19 May 2025
ER -