Scholarlink

<p>For the challenges of low learning efficiency, slow convergence speed and slow inference speed in robot path planning. This paper proposes an improved deep reinforcement learning algorithm for robot path planning. Firstly, the Dueling DQN network architecture is employed, combined with a priority experience replay strategy, to more effectively learn from and utilize experience data. Secondly, the mobility space of the robot is expanded, enhancing the diversity and flexibility of the action space. Additionally, in the action selection process, the Artificial Potential Field (APF) algorithm is introduced to intervene in the action selection with a certain probability, thereby accelerating the convergence process of the network. Simultaneously, the <InlineEquation ID="IEq1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10489_2024_6149_Article_IEq1.gif" Format="GIF" Height="10" Rendition="HTML" Resolution="72" Type="Linedraw" Width="11" /> </InlineMediaObject> <EquationSource Format="TEX">\(\varepsilon\)</EquationSource> <EquationSource Format="MATHML"><math> <mi>ε</mi> </math></EquationSource> </InlineEquation> -greedy strategy is employed to balance exploration and exploitation, facilitating better exploration of the environment and utilization of existing knowledge. Furthermore, this paper devises novel composite reward functions that comprehensively integrate multiple reward mechanisms to enhance the convergence performance of the algorithm and the quality of path planning. Finally, the effectiveness and superiority of the proposed method are validated through detailed comparative simulations. Compared to traditional DQN algorithms, Double DQN, and Double DQN with the APF strategy, the method proposed in this paper demonstrates higher learning efficiency and faster convergence speed, enabling more effective planning of shorter paths.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

A modified dueling DQN algorithm for robot path planning incorporating priority experience replay and artificial potential fields

  • 期刊论文

  • 发表日期：

    2025年1月22日

查看全文
  • Chang Li,
  • Xiaofeng Yue,
  • Zeyuan Liu,
  • Guoyuan Ma,
  • Hongbo Zhang,
  • Yuan Zhou,
  • Juan Zhu

摘要

For the challenges of low learning efficiency, slow convergence speed and slow inference speed in robot path planning. This paper proposes an improved deep reinforcement learning algorithm for robot path planning. Firstly, the Dueling DQN network architecture is employed, combined with a priority experience replay strategy, to more effectively learn from and utilize experience data. Secondly, the mobility space of the robot is expanded, enhancing the diversity and flexibility of the action space. Additionally, in the action selection process, the Artificial Potential Field (APF) algorithm is introduced to intervene in the action selection with a certain probability, thereby accelerating the convergence process of the network. Simultaneously, the \(\varepsilon\) ε -greedy strategy is employed to balance exploration and exploitation, facilitating better exploration of the environment and utilization of existing knowledge. Furthermore, this paper devises novel composite reward functions that comprehensively integrate multiple reward mechanisms to enhance the convergence performance of the algorithm and the quality of path planning. Finally, the effectiveness and superiority of the proposed method are validated through detailed comparative simulations. Compared to traditional DQN algorithms, Double DQN, and Double DQN with the APF strategy, the method proposed in this paper demonstrates higher learning efficiency and faster convergence speed, enabling more effective planning of shorter paths.