Document Type
Article
Publication Date
6-2009
Abstract
This paper is the summary of a study done to assess the efficiency of three different pathfinding algorithms in a game-like environment. “Efficiency” is, in this case, defined as finding the shortest path possible in the least amount of time possible, and is tracked using a number of metrics, including the number of visitations made by a particular algorithm to any node in the graph tree, and the physical length of the traversable path in the game world. The three algorithms were tested using randomly generated sets of nodes in three different navigable environments in order to assess if any patterns appeared based on the operation of a particular pathfinding algorithm in a particular kind of environmental layout.
Recommended Citation
Krishnaswamy, Nikhil. (2009) Comparison of Efficiency in Pathfinding Algorithms in Game Development.
https://via.library.depaul.edu/tr/10