Hierarchical Pathfinding and AI‐Based Learning Approach in Strategy Game Design
Author(s) -
Le Minh Duc,
Amandeep S. Sidhu,
Narendra S. Chaudhari
Publication year - 2008
Publication title -
international journal of computer games technology
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.248
H-Index - 19
eISSN - 1687-7055
pISSN - 1687-7047
DOI - 10.1155/2008/873913
Subject(s) - pathfinding , computer science , human–computer interaction , artificial intelligence , theoretical computer science , shortest path problem , graph
Strategy game and simulation application are an exciting area with many opportunities for study and research. Currently most of the existing games and simulations apply hard coded rules so the intelligence of the computer generated forces is limited. After some time, player gets used to the simulation making it less attractive and challenging. It is also costly and tedious to incorporate new rules for an existing game. The main motivation behind this research project is to improve the quality of artificial intelligence- (AI-) based on various techniques such as qualitative spatial reasoning (Forbus et al., 2002), near-optimal hierarchical pathfinding (HPA*) (Botea et al., 2004), and reinforcement learning (RL) (Sutton and Barto, 1998)
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom