LGOAP: Adaptive layered planning for real-time videogames
- 1 August 2013
- conference paper
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE) in 2013 IEEE Conference on Computational Inteligence in Games (CIG)
Abstract
One of the main aims of game AI research is the building of challenging and believable artificial opponents that act as if capable of strategic thinking. In this paper we describe a novel mechanism that successfully endows NPCs in real-time games with strategic planning capabilities. Our approach creates adaptive behaviours that take into account long-term and short term consequences. Our approach is unique in that: (i) it is sufficiently fast to be used for hundreds of agents in real time; (ii) it is flexible in that it requires no previous knowledge of the playing field; and (iii) it allows customization of the agents in order to generate differentiated behaviours that derive from virtual personalities.Keywords
This publication has 9 references indexed in Scilit:
- Writing Real-Time .Net Games in CasanovaLecture Notes in Computer Science, 2012
- Generating complete all-day activity plans with genetic algorithmsTransportation, 2005
- Efficient fixpoint computation in linear tablingPublished by Association for Computing Machinery (ACM) ,2003
- Planning as heuristic searchArtificial Intelligence, 2001
- HCSMACM Transactions on Modeling and Computer Simulation, 1995
- Conception, evolution, and application of functional programming languagesACM Computing Surveys, 1989
- Depth-first iterative-deepening: An optimal admissible tree searchArtificial Intelligence, 1985
- Strips: A new approach to the application of theorem proving to problem solvingArtificial Intelligence, 1972
- Pattern Classification by Iteratively Determined Linear and Piecewise Linear Discriminant FunctionsIEEE Transactions on Electronic Computers, 1966