A combined path planning algorithm based on artificial potential field algorithm and A* algorithm

In order to ensure that mobile robots perform various tasks correctly, the research on efficient and practical path planning algorithms is of great significance. For the Artificial Potential Field algorithm, it is easy to fall into local minimums, the target points are unreachable, and the A* algorithm search time is long when planning the moving path. The speed is slow, the planned path is not smooth enough and it is not the optimal path. This paper proposes a mobile robot combined path planning algorithm based on the APF algorithm and the A* algorithm. This algorithm can solve the local oscillation problem while reducing the problem. Obstacle avoidance time, improve the efficiency of the navigation algorithm. From the results of MATLAB Simulation, it can be seen that the algorithm can complete path planning accurately and efficiently. The mobile robot can bypass the local minimum point and successfully reach the target point, achieving the expected path planning effect.