[1]WEN Jiayan,WANG Yibo,XIN Huajian,et al.Intelligent connected vehicle path planning based on optimized deep Q-network[J].CAAI Transactions on Intelligent Systems,2026,21(1):226-235.[doi:10.11992/tis.202502010]
Copy
CAAI Transactions on Intelligent Systems[ISSN 1673-4785/CN 23-1538/TP] Volume:
21
Number of periods:
2026 1
Page number:
226-235
Column:
吴文俊人工智能科学技术奖论坛
Public date:
2026-03-05
- Title:
-
Intelligent connected vehicle path planning based on optimized deep Q-network
- Author(s):
-
WEN Jiayan1; 2; WANG Yibo1; 2; XIN Huajian3; XIE Guangming4
-
1. School of Automation, Guangxi University of Science and Technology, Liuzhou 545616, China;
2. The Research Center for Intelligent Cooperation and Cross-application, Guangxi University of Science and Technology, Liuzhou 545616, China;
3. Guangxi Vocational and Technical College of Industry, Nanning 530001, China;
4. College of Engineering, Peking University, Beijing 100871, China
-
- Keywords:
-
intelligent connected vehicles; path planning; unstructured environment; attention mechanism; experience replay; obstacle avoidance; deep Q-network; deep reinforcement learning
- CLC:
-
TP183;TP2
- DOI:
-
10.11992/tis.202502010
- Abstract:
-
Aiming at the path planning problem of intelligent connected vehicles in unstructured environment, the traditional deep Q-network (DQN) algorithm has problems such as low planning efficiency, slow convergence speed, poor generalization, etc. This paper proposes a DQN planning method combining attention mechanism and empirical classification. The experience playback pool is designed by combining the attention mechanism, and the multi-objective optimization conflict is solved by dynamic weight allocation, so as to improve the experience utilization rate in similar environments, reduce the planning time, and accelerate the convergence; Build non sparse reward constraints, and optimize the state space in combination with the characteristics of the traffic environment, so as to adapt to multi-objective scenarios and achieve multi scenario generalization. The simulation shows that the average planning speed of the optimized algorithm is increased by 28.6%, and the travel distance is shortened by 25.2% compared with that before optimization. In addition, the time for the first successful planning is shortened by 32.8% by loading training data in different scenarios.