Efficient path finding for 2D games

Abstract

In this paper we investigate different methods and algorithms from artificial intelligence that can be used for achieving efficient path finding within games and virtual environments. Path finding is a computationally expensive problem that is solved by searching. We investigate different optimization techniques and further develop techniques which can be incorporated within the existing algorithms to make path finding for 2D static environments faster, computationally less expensive and requiring minimum use of resources.