Pathfinding Algorithm Efficiency Analysis in 2D Grid
Imants Zarembo, Sergejs Kodors · Environment Technology Resources Proceedings of the International Scientific and Practical Conference · 2015
The main goal of this paper is to collect information about pathfinding algorithms A*, BFS, Dijkstra's algorithm, HPA* and LPA*, and compare them on different criteria, including execution time and memory requirements. Work has two parts, the first being theoretical and the second practical. The theoretical part details the comparison of pathfinding algorithms. The practical part includes implementation of specific algorithms and series of experiments using algorithms implemented. Such factors as various size two dimensional grids and choice of heuristics were taken into account while conducting experiments.