Open AccessNovel optimization using hierarchical Path finding A* (HPA*) algorithm for strategic gaming setup
Author(s) -
Aqsa Zafar,
Krishna Kant Agrawal
Publication year - 2018
Publication title -
international journal of engineering and technology
Language(s) - English
Resource type - Journals
ISSN - 2227-524X
DOI - 10.14419/ijet.v7i2.6.10067
Subject(s) - path (computing) , shortest path problem , computer science , yen's algorithm , algorithm , widest path problem , mathematical optimization , shortest path faster algorithm , constrained shortest path first , fast path , longest path problem , a* search algorithm , k shortest path routing , theoretical computer science , mathematics , dijkstra's algorithm , graph , programming language
In game Industry, the most trending research area is shortest path finding. There are many video games are present who are facing the problem of path finding and there is various algorithms are present to solve this problem. In this paper brief introduction is given in the most using algorithm for path finding and A* algorithm has been proved the best algorithm for resolving the problem of shortest path finding in games. It provides the optimal solution for path finding as compare to other search algorithm. At the start of the paper, brief introduction about the path finding is given. Then the reviews of different search algorithm are presented on the basis of path finding. After that information of A* algorithm and optimization techniques are described. In the last, application and examples how the path finding techniques are used in the game is addressed and future work and conclusion are drawn.