Evolving the strategies of agents for the ANTS game

0Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This work studies the performance and the results of the application of Evolutionary Algorithms (EAs) for evolving the decision engine of a program, called in this context agent, which controls the player's behaviour in an real-time strategy game (RTS). This game was chosen for the Google Artificial Intelligence Challenge in 2011, and simulates battles between teams of ants in different types of maps or mazes. According to the championship rules the agents cannot save information from one game to the next, which makes impossible to implement an EA 'inside' the agent, i.e. on game time (or on-line), that is why in this paper we have evolved this engine off-line by means of an EA, used for tuning a set of constants, weights and probabilities which direct the rules. This evolved agent has fought against other successful bots which finished in higher positions in the competition final rank. The results show that, although the best agents are difficult to beat, our simple agent tuned with an EA can outperform agents which have finished 1000 positions above the untrained version. © 2013 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Carpio, J., García-Sánchez, P., Mora, A. M., Julián Merelo, J., Caraballo, J., Vaz, F., & Cotta, C. (2013). Evolving the strategies of agents for the ANTS game. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7903 LNCS, pp. 324–333). https://doi.org/10.1007/978-3-642-38682-4_35

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free