Global Path Search based on A* Algorithm

DOI

10.2991/tlicsc-18.2018.59How to use a DOI?

Keywords

A* algorithm; heuristic; shortest path search; terrain environment; diagonal distance metric.

Abstract

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.

Copyright

© 2018, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Xiaoyan Guo
AU  - Xun Luo
PY  - 2018/12
DA  - 2018/12
TI  - Global Path Search based on A* Algorithm
BT  - Proceedings of the 2018 International Conference on Transportation & Logistics, Information & Communication, Smart City (TLICSC 2018)
PB  - Atlantis Press
SP  - 369
EP  - 374
SN  - 1951-6851
UR  - https://doi.org/10.2991/tlicsc-18.2018.59
DO  - 10.2991/tlicsc-18.2018.59
ID  - Guo2018/12
ER  -