Target Searching of Mobile Robots Using Improved A* Searching Algorithm
Chih Hung Chang, Jie Tong Zou, Kuo Lan Su · Applied Mechanics and Materials · 2013
The paper studies motion path planning problem using improved A* searching algorithm, and implements the movement scenario using mobile robot system. Solving the shortest path problem, Dijkstra algorithm can finds the shortest path to solve the path searching problem. The searching depth is not applicable in certain circumstances to be a disadvantage. The paper proposed improved A* searching algorithm using the intelligent node judgment method, it not only be able to retain the advantages of the traditional A* algorithm but also improve the shortcomings. It programs the on-time motion path in dynamic environment; it also programs the motion path more closed to the best path. Finally, the paper uses multiple strategies to improve the searching motion path to be the best motion path, and compares with the traditional A* algorithm to reduce the searching time.