2.50
Hdl Handle:
http://hdl.handle.net/2436/31520
Title:
Efficient path finding for 2D games
Authors:
Kumar, Pawan; Bottaci, Len; Mehdi, Qasim; Gough, Norman; Natkin, Stephane
Other Titles:
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
Publisher:
University of Wolverhampton, School of Computing and Information Technology
Issue Date:
2004
URI:
http://hdl.handle.net/2436/31520
Additional Links:
http://www.cgames.org/; http://www.wlv.ac.uk/Default.aspx?page=14750
Type:
Meetings and Proceedings
Language:
en
ISBN:
0-9549016-0-6
Appears in Collections:
Game Simulation and Artificial Intelligence Centre (GSAI)

Full metadata record

DC FieldValue Language
dc.contributor.authorKumar, Pawan-
dc.contributor.authorBottaci, Len-
dc.contributor.authorMehdi, Qasim-
dc.contributor.authorGough, Norman-
dc.contributor.authorNatkin, Stephane-
dc.date.accessioned2008-07-10T14:20:25Z-
dc.date.available2008-07-10T14:20:25Z-
dc.date.issued2004-
dc.identifier.citationIn: 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 UKen
dc.identifier.isbn0-9549016-0-6-
dc.identifier.urihttp://hdl.handle.net/2436/31520-
dc.description.abstractIn 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.en
dc.language.isoenen
dc.publisherUniversity of Wolverhampton, School of Computing and Information Technologyen
dc.relation.urlhttp://www.cgames.org/en
dc.relation.urlhttp://www.wlv.ac.uk/Default.aspx?page=14750en
dc.subjectPath findingen
dc.subjectA staren
dc.subjectPath searchingen
dc.subjectHeuristicsen
dc.subjectGames-
dc.titleEfficient path finding for 2D gamesen
dc.title.alternativeProceedings of CGAIDE’2004en
dc.typeMeetings and Proceedingsen
All Items in WIRE are protected by copyright, with all rights reserved, unless otherwise indicated.