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

• Published in: Artificial Intelligence for Communications and Networks pp. 497 - 505
• Main Authors: Chen, Yi, Xie, Liangbo, He, Wei, Jiang, Qing, Xu, Junxing
• Format: Book Chapter
• Language: English
• Published: Cham Springer International Publishing
• Series: Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering
• Subjects: A algorithm; Divide-and-conquer method; Golf unmanned cart; Path planning
• ISBN: 9783030229672; 303022967X
• ISSN: 1867-8211; 1867-822X
• DOI: 10.1007/978-3-030-22968-9_46

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.