Study on the efficiency of A, IDA, and JPS algorithm
Chenhao Nie, Ningwei Bai, Yijia Luo · 2022
Different path-finding algorithms are chosen in different environments, according to their advantages and disadvantages. This study investigates the characteristics of three of the popular heuristic path-finding algorithms — A*, IDA* and JPS. The investigation focuses on their performance of time efficiency, memory efficiency and performance on whether could give out optimal solution, and was carried out in 2D orthogonal grids. These algorithms are shown to be affected by density of barriers in grids, complexity of routes, map size and whether the map has boundary. This study analyzed the data of performance of three algorithms based on these aspects and concluded the environments that are suitable for each algorithm. In general, A* was found to be more universal when navigating, JPS was less universal and IDA* has the most limited universality.