Loading...
Efficient path finding for 2D games
Kumar, Pawan Bottaci, Len Mehdi, Quasim Gough, Norman Natkin, Stephane
Kumar, Pawan
Bottaci, Len
Mehdi, Quasim
Gough, Norman
Natkin, Stephane
Editors
Other contributors
Affiliation
Epub Date
Issue Date
2004
Submitted date
Subjects
Alternative
Proceedings of CGAIDE’2004
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.
Citation
In: Mehdi, Q. and Gough, N. (Eds.), Proceedings of CGAIDE’2004. 5th Game-On International Conference on Computer Games: Artificial Intelligence, Design and Education, 8-10 November, 2004, Microsoft Academic Campus, Reading UK
Journal
Research Unit
DOI
PubMed ID
PubMed Central ID
Embedded videos
Additional Links
Type
Conference contribution
Language
en
Description
Series/Report no.
ISSN
EISSN
ISBN
0-9549016-0-6