Paper
8 June 2024 Multidomain A* algorithm research
Peitao Guo, Zhihong Xi, Guanhua Wang, Fenghao Zheng, Kexin Zhang
Author Affiliations +
Proceedings Volume 13171, Third International Conference on Algorithms, Microchips, and Network Applications (AMNA 2024); 131710N (2024) https://doi.org/10.1117/12.3031937
Event: 3rd International Conference on Algorithms, Microchips and Network Applications (AMNA 2024), 2024, Jinan, China
Abstract
Aiming at the problems of traditional A* algorithm with many inflection points, long paths and low efficiency, this paper proposes a multi-domain A* algorithm. Firstly, it improves the obstacle search method and node passable discrimination method, and optimizes the path generation process of the algorithm. Then study the effect of different neighborhood search matrices on the algorithm's path nodes and path length, and select the optimal neighborhood search matrix. Since the improved A* algorithm has a larger neighborhood and more choices than the traditional A* algorithm, compared with the traditional A* algorithm the path length is reduced by 7.2%, the path nodes are reduced by 47.4%, and the search time is reduced by 82.6%, in addition, the path of the improved A* algorithm is smoother.
(2024) Published by SPIE. Downloading of the abstract is permitted for personal use only.
Peitao Guo, Zhihong Xi, Guanhua Wang, Fenghao Zheng, and Kexin Zhang "Multidomain A* algorithm research", Proc. SPIE 13171, Third International Conference on Algorithms, Microchips, and Network Applications (AMNA 2024), 131710N (8 June 2024); https://doi.org/10.1117/12.3031937
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Matrices

Mathematical optimization

Safety

Computer simulations

Autonomous driving

Communication engineering

Engineering

Back to Top