Path planning for service robot based on improved A* algorithm

Aiming at the problems of high memory occupancy and too many inflection points and search points of A* algorithm in large-scale environment, an improved A* algorithm is proposed. Firstly, the adaptive adjustment of the heuristic function is realized by introducing dynamic weights to obtain the optimal path, and secondly, the cubic Bezier curve is used to smooth the path to reduce the number of inflection points. The simulation results show that the improved A* algorithm can significantly improve the path planning efficiency of service robots and reduce the task time of service robots.