Abstract
Due to the complexity of map modeling, the massive computation and high redundancy of the traditional A* algorithm will greatly reduce the efficiency of pathfinding, resulting in huge performance consumption. Meanwhile, limited by neighborhood search strategy in grid map, the traditional A* algorithm is actually unable to achieve the optimal path in the global sense. To solve these problems, this paper proposes an improved A* algorithm based on graph preprocessing. First, the free space on the map was decomposed into several polygon regions using the improved convex decomposition method based on Maklink. Then, each region was coded into feature nodes according to A* algorithm. Finally, an optimal region passage was found based on the principle of A* algorithm, in which the global optimal path solution was obtained. Compared with the traditional A* algorithm and other classical path planning algorithms, the proposed algorithm has significant advantages in planning speed, path cost, stability, and completeness.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Transactions of the Institute of Measurement and Control
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
