Automatic step evolution

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

Abstract

A common issue in Artificial Life research, and mainly in open-ended evolution simulations, is that of defining the bootstrap conditions of the simulations. One usual technique employed is the random initialization of individuals at the start of each simulation. However, by using this initialization method, we force the evolutionary process to always start from scratch, and thus require more time to accomplish the objective. Artificial Life simulations, being typically, very time consuming, suffer particularly when applying this method. In a previous paper we described a technique we call step evolution, analogous to incremental evolution techniques, that can be used to shorten the time needed to evolve complex behaviors in open-ended evolutionary simulations. In this paper we further extend this technique by automating the process of stepping the simulation. We provide results from experiments done on an open-ended evolution of foraging scenario, where agents evolve, adapting to a world with a day and night cycle. The results show that we can indeed automate this process and achieve a performance at least as good as on the best performant non-automated version.

Cite

CITATION STYLE

APA

Baptista, T., & Costa, E. (2014). Automatic step evolution. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 8864, 393–404. https://doi.org/10.1007/978-3-319-12027-0_32

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