Research On Path Planning Of Mobile Robot Based On Improved A* Algorithm

Path planning plays an essential role in mobile robot system. Aiming at the low efficiency of A* algorithm in the process of robot path finding, this paper proposes two improvement methods to solve the problem of inefficient searching of A* algorithm. The first method is to improve the distance calculation formula in A* algorithm, and the second method is to perform the evaluation function in A* algorithm. Weighted processing. Experimental data shows that the comprehensively improved A* algorithm dramatically reduces the number of useless access nodes and speeds up the time-consuming search process, which reduces the search time by about 12 similar to 14% compared to the standard A* algorithm.