Global Path Search based on A* Algorithm
Xiaoyan Guo, Xun Luo
Available Online December 2018.
- https://doi.org/10.2991/tlicsc-18.2018.59How to use a DOI?
- A* algorithm; heuristic; shortest path search; terrain environment; diagonal distance metric.
- In the field of games and GIS development, the shortest path search is often involved, and the A* algorithm with heuristic functions is one of the more commonly used search algorithms. By studying the path search algorithm, on the basis of the simulation of the theory, combined with different heuristic algorithms to achieve the path planning strategy. Taking the terrain environment designed by self-design as the experimental platform, the path search algorithm is studied and the four measurement methods are compared. The final experimental results show that the path finding with the diagonal distance as the heuristic function is better reduced. The scope and scale of the algorithm search effectively improve the operational efficiency of the A* algorithm.
- Open Access
- This is an open access article distributed under the CC BY-NC license.
Cite this article
TY - CONF AU - Xiaoyan Guo AU - Xun Luo PY - 2018/12 DA - 2018/12 TI - Global Path Search based on A* Algorithm PB - Atlantis Press SP - 369 EP - 374 SN - 1951-6851 UR - https://doi.org/10.2991/tlicsc-18.2018.59 DO - https://doi.org/10.2991/tlicsc-18.2018.59 ID - Guo2018/12 ER -