An Improved A* Algorithm Based on Divide-and-Conquer Method for Golf Unmanned Cart Path Planning

Path planning based on A* algorithm has been widely used in various engineering projects, but the time cost of A* algorithm for large-scale road networks is expensive, which is proportional to the square of node N. This paper proposes an improved A* algorithm based on the divide-and-conquer method for the golf unmanned cart path planning requirements, which splits the global optimal path into several local optimal paths and greatly reduces the time cost of the traditional A* algorithm with the more data space needs. Experiment results show that the proposed algorithm can decrease the time cost by at least 46% compared with the traditional A* algorithm. The real-time performance is stronger and the global optimizing path is smoother.