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

Chen, Yi and Xie, Liangbo and He, Wei and Jiang, Qing and Xu, Junxing (2019) An Improved A* Algorithm Based on Divide-and-Conquer Method for Golf Unmanned Cart Path Planning. In: Artificial Intelligence for Communications and Networks. First EAI International Conference, AICON 2019, Harbin, China, May 25–26, 2019, Proceedings, Part I.

[thumbnail of 32687.pdf] PDF
32687.pdf

Download (704kB)

Abstract

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.

Item Type: Conference or Workshop Item (UNSPECIFIED)
Date Deposited: 04 Mar 2026 12:13
Last Modified: 20 Nov 2026 11:47
URI: https://eprints.eai.eu/id/eprint/23437

Actions (login required)

View Item
View Item