Scholarlink

<p>The A* algorithm plays an important role in global path planning for robots, but it faces challenges such as redundant nodes and large search spaces. This paper proposes the Obstacle Density-based Dynamic Exponential A* (ODDEA*) algorithm. The ODDEA* algorithm adjusts the weights of the heuristic function based on the density of the surrounding obstacles. It uses the improved heuristic function to guide the robot toward areas with low obstacle density, employing a local dynamic penalty. The computational experiments compare the proposed ODDEA* algorithm with the Theta*, A*, and BA* algorithms, involving small-size (20<InlineEquation ID="IEq1"> <EquationSource Format="TEX">\(\times\)</EquationSource> </InlineEquation>20), medium-size (40<InlineEquation ID="IEq2"> <EquationSource Format="TEX">\(\times\)</EquationSource> </InlineEquation>40), and large-size (60<InlineEquation ID="IEq3"> <EquationSource Format="TEX">\(\times\)</EquationSource> </InlineEquation>60) grid maps, as well as 50 random medium-size maps. The proposed ODDEA* algorithm uses fewer expanded nodes and less planning time than the other algorithms. Compared with the A* algorithm, it achieves 46.96% of the planning time and 20.33% of the search space on the three fixed grid maps.</p>

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

Self-adaptive search algorithm for path planning based on the A* algorithm

  • 期刊论文

  • 出版模式：

    开放获取

  • 发表日期：

    2025年12月29日

查看全文
  • Shiwei Lin,
  • Xiangxi Fan,
  • Zhixuan Xie,
  • Yundong Wu,
  • Hongwu Yang

摘要

The A* algorithm plays an important role in global path planning for robots, but it faces challenges such as redundant nodes and large search spaces. This paper proposes the Obstacle Density-based Dynamic Exponential A* (ODDEA*) algorithm. The ODDEA* algorithm adjusts the weights of the heuristic function based on the density of the surrounding obstacles. It uses the improved heuristic function to guide the robot toward areas with low obstacle density, employing a local dynamic penalty. The computational experiments compare the proposed ODDEA* algorithm with the Theta*, A*, and BA* algorithms, involving small-size (20 \(\times\) 20), medium-size (40 \(\times\) 40), and large-size (60 \(\times\) 60) grid maps, as well as 50 random medium-size maps. The proposed ODDEA* algorithm uses fewer expanded nodes and less planning time than the other algorithms. Compared with the A* algorithm, it achieves 46.96% of the planning time and 20.33% of the search space on the three fixed grid maps.