Learning to Select Mates in Evolving Non-playable Characters

Procedural content generation (PCG) is an active area of research with the potential to significantly reduce game development costs as well as create game experiences meaningfully personalized to each player. Evolutionary methods are a promising method of generating content procedurally. In particular asynchronous evolution of AI agents in an artificial life (A-life) setting is notably similar to the online evolution of non-playable characters in a video game. In this paper, we are concerned with improving the efficiency of evolution via more effective mate selection. In the spirit of PCG, we genetically encode each agent’s preference for mating partners and thereby allowing the mate-selection process to evolve. We evaluate this approach in a simple predator-prey A-life environment and demonstrate that the ability to evolve a per-agent mate-selection preference function indeed significantly increases the extinction time of the population. Additionally, an inspection of the evolved preference function parameters shows that agents evolve to favor mates who have survival traits.

[1]  A. Gray,et al.  I. THE ORIGIN OF SPECIES BY MEANS OF NATURAL SELECTION , 1963 .

[2]  Julian Togelius,et al.  Search-Based Procedural Content Generation: A Taxonomy and Survey , 2011, IEEE Transactions on Computational Intelligence and AI in Games.

[3]  Julian Togelius,et al.  Procedural Content Generation: Goals, Challenges and Actionable Steps , 2013, Artificial and Computational Intelligence in Games.

[4]  Moreno Marzolla,et al.  Netlogo , 2019, Economics for a Fairer Society.

[5]  Michael Buro,et al.  Real-Time Strategy Games: A New AI Research Challenge , 2003, IJCAI.

[6]  Sebastian Risi,et al.  Breeding a diversity of Super Mario behaviors through interactive evolution , 2016, 2016 IEEE Conference on Computational Intelligence and Games (CIG).

[7]  Risto Miikkulainen,et al.  Evolving Neural Networks through Augmenting Topologies , 2002, Evolutionary Computation.

[8]  Vadim Bulitko,et al.  Learning to select mates in artificial life , 2019, GECCO.

[9]  Frederico G. Guimarães,et al.  Procedural generation of non-player characters in massively multiplayer online strategy games , 2017, Soft Comput..

[10]  Peter M. Todd,et al.  Too many love songs: Sexual selection and the evolution of communication , 1997 .

[11]  Vadim Bulitko,et al.  Evolving NPC Behaviours in A-life with Player Proxies , 2018, AIIDE Workshops.

[12]  Terence Soule,et al.  Darwin's Demons: Does Evolution Improve the Game? , 2017, EvoApplications.

[13]  Giorgio Coricelli,et al.  Partner Selection in Public Goods Experiments , 2003 .

[14]  Vadim Bulitko,et al.  Towards Positively Surprising Non-Player Characters in Video Games , 2017, AIIDE Workshops.

[15]  Joel Lehman,et al.  Petalz: Search-Based Procedural Content Generation for the Casual Gamer , 2016, IEEE Transactions on Computational Intelligence and AI in Games.

[16]  Master Gardener,et al.  Mathematical games: the fantastic combinations of john conway's new solitaire game "life , 1970 .

[17]  Peter Dayan,et al.  Q-learning , 1992, Machine Learning.

[18]  Stephen Wolfram,et al.  A New Kind of Science , 2003, Artificial Life.

[19]  C Athena Aktipis,et al.  Know when to walk away: contingent movement and the evolution of cooperation. , 2004, Journal of theoretical biology.

[20]  Shane Legg,et al.  Human-level control through deep reinforcement learning , 2015, Nature.

[21]  Julian Togelius,et al.  Neuroevolution in Games: State of the Art and Open Challenges , 2014, IEEE Transactions on Computational Intelligence and AI in Games.

[22]  David H. Ackley,et al.  Interactions between learning and evolution , 1991 .

[23]  John H. Holland,et al.  A study of mate selection in genetic algorithms , 2002 .

[24]  T. Nakagawa,et al.  The Discrete Weibull Distribution , 1975, IEEE Transactions on Reliability.

[25]  Daniel R. Tauritz,et al.  Learning individual mating preferences , 2011, GECCO '11.