Many pathfinding problems in real-world applications require real-time computation of the shortest path between two points in a grid-based environment. It is not a trivial task. While some shortest pathfinding algorithms may perform admissibly in one condition, they may prove inadmissible in other conditions. HPA* path finding algorithm is faster and more memory efficient than the A*algorithm in relatively large two dimensional grids, but this advantage may not apply to very small or very large grids. The paper deals with the efficiency of A* and HPA*in two-dimensional grids of different sizes. For the sake of completeness of the analysis, HPA* efficiency is measured taking into consideration the number of hierarchy levels and different cluster sizes. Both algorithms have been implemented and tests conducted. Experimental evidence is proposed to demonstrate the algorithm efficiency in various conditions.
展开▼
