Improved DQN Path Planning Method Based on Transformer

Aiming at the problem that the slow convergence of Deep Q-Network (DQN) in complex path planning tasks, a DQN method based on Transformer (T-DQN) is proposed. To enhance the model's ability to capture long-range dependencies, the linear layers in DQN are replaced with a multi-head attention mechanism. The self-attention mechanism of Transformer can dynamically weight historical state information, which enables the agent to learn global path features more efficiently in complex environments. In addition, to optimize training sample utilization, accelerate key experience learning, and further improve convergence efficiency, a priority sampling strategy is employed. Finally, simulations are conducted on both simple and complex map path planning to validate the effectiveness and superiority of the proposed model. Simulation results show that the proposed T-DQN algorithm achieves faster convergence compared to the DQN algorithm.

Authors

Institutions

Publication Details

Published
2025-07-04
DOI
https://doi.org/10.1109/fasta65681.2025.11138271
Citations
1
Primary Topic
Robotic Path Planning Algorithms
Type
article
Field-Weighted Citation Impact
1.28
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Improved DQN Path Planning Method Based on Transformer

Yifei Feng, Ming-Yi Wu, Bin Feng, Weihua Fan
1 citations
Robotic Path Planning Algorithms
1.28
article

Improved DQN Path Planning Method Based on Transformer

Yifei Feng, Ming-Yi Wu, Bin Feng, Weihua Fan
article en
1 citations

Abstract

Aiming at the problem that the slow convergence of Deep Q-Network (DQN) in complex path planning tasks, a DQN method based on Transformer (T-DQN) is proposed. To enhance the model's ability to capture long-range dependencies, the linear layers in DQN are replaced with a multi-head attention mechanism. The self-attention mechanism of Transformer can dynamically weight historical state information, which enables the agent to learn global path features more efficiently in complex environments. In addition, to optimize training sample utilization, accelerate key experience learning, and further improve convergence efficiency, a priority sampling strategy is employed. Finally, simulations are conducted on both simple and complex map path planning to validate the effectiveness and superiority of the proposed model. Simulation results show that the proposed T-DQN algorithm achieves faster convergence compared to the DQN algorithm.

Nanjing University of Science and Technology (CN)
Openalex Percentile: Top 16%
Robotic Path Planning Algorithms
1.28
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Improved DQN Path Planning Method Based on Transformer — Yifei Feng, Ming-Yi Wu, et al. · (2025) | TGRS Research Map | TGRS