Video Game Pathfinding and Improvements to Discrete Search on Grid-based Maps

Abstract

The most basic requirement for any computer controlled game agent in a video game is to be able to successfully navigate the game environment. Pathfinding is an essential component of any agent navigation system. Pathfinding is, at the simplest level, a search technique for finding a route between two points in an environment. The real-time multi-agent nature of video games places extremely tight constraints on the pathfinding problem. This study aims to provide the first complete review of the current state of video game pathfinding both in regards to the graph search algorithms employed as well as the implications of pathfinding within dynamic game environments. Furthermore this thesis presents novel work in the form of a domain specific search algorithm for use on grid-based game maps: the spatial grid A* algorithm which is shown to offer significant improvements over A* within the intended domain.

75 Figures and Tables

Cite this paper

@inproceedings{Anguelov2011VideoGP, title={Video Game Pathfinding and Improvements to Discrete Search on Grid-based Maps}, author={Bobby Anguelov and Albert B. Einstein}, year={2011} }