The Effective Pathfinding Algorithm for Gaming Maps Using Systemized Iterative Deepening A

Abstract

A * algorithm is the de facto standard used for a pathfinding search. IDA* is a space-efficient version of A * , but it suffers from CPU cycles in the search space (the price for using no storage), repeatedly visiting nodes from left to- right traversal of the search tree. To overcome these concerns, recently fringe search algorithm is launched. At some extent, fringe search algorithm performs iterations same as A * and IDA * , but still the fringe search algorithm has some drawbacks, visiting nodes that are irrelevant for the current iteration. In this paper, Systemized Iterative Deepening A * (SIDA * ) introduced to eliminate in-efficiencies such as, search space, visiting irrelevant nodes. It also detects dead ends and reachs the destination node faster than the existing pathfinding algorithms. We considered on-track strategy for accidental obstacles, in addition we include curvature information to avoid off road in static curves. Finally our experiment results performed on grid based pathfinding application between SIDA * and A * . We executed on two different platforms with and without obstacles (walls), in both different platforms SIDA * achieve 15-35% (i.e., time, length, weight, operation) faster than A * search algorithm. Evaluation results of proposed framework, On-track strategy shows effective for avoiding obstacles on static curves.