.png){kind=icon}
.png){kind=icon}
Return
A path planning method based on noisy D3QN algorithm with N-step updates
.png){kind=icon}
OA
AI
DOI：10.1016/j.asej.2025.103826.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
To address the issues of unstable Q-value estimation and insufficient exploration during the early training stage of the Dueling Double Deep Q Network (D3QN), an N-step and Noisy D3QN algorithm is proposed. First, an N-step update strategy is designed, in which multi-step cumulative rewards replace single-step rewards. Second, learnable exploration noise is incorporated into the neural network so that each action selection of the mobile robot depends not only on the Q-value but also on stochastic perturbations, thereby enhancing exploration ability. Finally, ablation studies are conducted to quantify the incremental contributions of each component. Across multiple simulation environments with both static and dynamic obstacles, the proposed algorithm outperforms DDQN, D3QN, SAE-DDQN, and D3QN-PER in terms of average path length, average number of steps, and average traversal time. Furthermore, experiments in real-world environments verify the feasibility and robustness of the proposed method.
Keywords:
Path Planning
D3QN
N-Step Update Strategy
Mobile Robot
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
5.9
Papers:
3.4K
Citations:
1.2W
View more organizations