Research on Static/Dynamic Global Path Planning Based on Improved A<a:math xmlns:a="http://www.w3.org/1998/Math/MathML" id="M1"> <a:msup> <a:mrow/> <a:mi>∗</a:mi> </a:msup> </a:math> Algorithm for Mobile Robots

Abstract

In view of the problems of A <a:math xmlns:a="http://www.w3.org/1998/Math/MathML" id="M2"> <a:msup> <a:mrow/> <a:mi>∗</a:mi> </a:msup> </a:math> algorithm in path planning, such as collision risk, the path is not necessarily optimal, and there are numerous turning nodes. Therefore, this study proposes an improved A <c:math xmlns:c="http://www.w3.org/1998/Math/MathML" id="M3"> <c:msup> <c:mrow/> <c:mi>∗</c:mi> </c:msup> </c:math> algorithm to improve the quality of the planned path. First, the 8-neighborhood children of the parent node are generated, and the security of the planned path is improved by further investigating the properties of the neighbors of these children one by one to reasonably set virtual obstacles. Second, the heuristic function of A <e:math xmlns:e="http://www.w3.org/1998/Math/MathML" id="M4"> <e:msup> <e:mrow/> <e:mi>∗</e:mi> </e:msup> </e:math> algorithm is ameliorated to make it closer to the actual cost, so as to enhance the accuracy of the planned path; finally, the planned path is smoothed by using the cubic uniform B-spline curve to eliminate corner sharp points in the path. The simulation results show that the improved A <g:math xmlns:g="http://www.w3.org/1998/Math/MathML" id="M5"> <g:msup> <g:mrow/> <g:mi>∗</g:mi> </g:msup> </g:math> algorithm can not only ensure the safety and smoothness of the planned path but also obtain the shortest planned path in the static environment with different obstacle rates. In addition, we combine the improved A <i:math xmlns:i="http://www.w3.org/1998/Math/MathML" id="M6"> <i:msup> <i:mrow/> <i:mi>∗</i:mi> </i:msup> </i:math> algorithm with the dynamic window algorithm to enable mobile robots to realize real-time dynamic obstacle avoidance while ensuring the optimality of global path planning.