Evolving Coordination for Real-Time Strategy Games
Created by W.Langdon from
gp-bibliography.bib Revision:1.8028
- @Article{Keaveney:2011:ieeeTCIAIG,
-
author = "David Keaveney and Colm O'Riordan",
-
title = "Evolving Coordination for Real-Time Strategy Games",
-
journal = "IEEE Transactions on Computational Intelligence and AI
in Games",
-
year = "2011",
-
month = jun,
-
volume = "3",
-
number = "2",
-
pages = "155--167",
-
abstract = "The aim of this work is to show that evolutionary
computation techniques (genetic programming in this
case) can be used to evolve coordination in real-time
strategy games. An abstract real-time strategy game is
used for our experiments, similar to a board game but
with many of the properties that define real-time
strategy games. We develop an automated player that
uses a progressive refinement planning technique when
determining its next immediate turn in our abstract
real-time strategy game. We describe two types of
coordination which we believe are important in the game
and then define measurements for both. We perform
twenty co-evolutionary runs for our automated player
and then analyse the history of each run with respect
to the success of the solutions found and their level
of coordination. We wish to show that as the
evolutionary process progresses both the quality and
the level of coordination in the solutions found
increases.",
-
keywords = "genetic algorithms, genetic programming, abstract
real-time strategy game, automated player, board game,
evolutionary computation, progressive refinement
planning, real-time strategy games, computer games,
evolutionary computation",
-
DOI = "doi:10.1109/TCIAIG.2011.2146783",
-
ISSN = "1943-068X",
-
notes = "Also known as \cite{5755185}",
- }
Genetic Programming entries for
David Keaveney
Colm O'Riordan
Citations