Evolving a Diversity of Creatures through Novelty Search and Local Competition
نویسندگان
چکیده
An ambitious challenge in artificial life is to craft an evolutionary process that discovers a wide diversity of welladapted virtual creatures within a single run. Unlike in nature, evolving creatures in virtual worlds tend to converge to a single morphology because selection therein greedily rewards the morphology that is easiest to exploit. However, novelty search, a technique that explicitly rewards diverging, can potentially mitigate such convergence. Thus in this paper an existing creature evolution platform is extended with multi-objective search that balances drives for both novelty and performance. However, there are different ways to combine performance-driven search and novelty search. The suggested approach is to provide evolution with both a novelty objective that encourages diverse morphologies and a local competition objective that rewards individuals outperforming those most similar in morphology. The results in an experiment evolving locomoting virtual creatures show that novelty search with local competition discovers more functional morphological diversity within a single run than models with global competition, which are more predisposed to converge. The conclusions are that novelty search with local competition may complement recent advances in evolving virtual creatures and may in general be a principled approach to combining novelty search with pressure to achieve.
منابع مشابه
Indirectly Encoded Sodarace for Artificial Life
The aim of this paper is to introduce a lightweight twodimensional domain for evolving diverse and interesting artificial creatures. The hope is that this domain will fill a need for such an easily-accessible option for researchers who wish to focus more on the evolutionary dynamics of artificial life scenarios than on building simulators and creature encodings. The proposed domain is inspired ...
متن کاملGENETIC AND TABU SEARCH ALGORITHMS FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH SEQUENCE-DEPENDENT SET-UP TIMES AND DETERIORATING JOBS
This paper introduces the effects of job deterioration and sequence dependent set- up time in a single machine scheduling problem. The considered optimization criterion is the minimization of the makespan (Cmax). For this purpose, after formulating the mathematical model, genetic and tabu search algorithms were developed for the problem. Since population diversity is a very important issue in ...
متن کاملEvolving plastic neural networks with novelty search
Biological brains can adapt and learn from past experience. Yet neuroevolution, i.e. automatically creating artificial neural networks (ANNs) through evolutionary algorithms, has sometimes focused on static ANNs that cannot change their weights during their lifetime. A profound problem with evolving adaptive systems is that learning to learn is highly deceptive. Because it is easier at first to...
متن کاملPMCNS: Using a Progressively Stricter Fitness Criterion to Guide Novelty Search
Novelty search is an evolutionary approach in which the population is driven towards behavioural innovation instead of towards a fixed objective. The use of behavioural novelty to score candidate solutions precludes convergence to local optima. However, in novelty search, significant effort may be spent on exploration of novel, but unfit behaviours. The authors propose progressive minimal crite...
متن کاملWhen Novelty Is Not Enough
The idea of evolving novel rather than fit solutions has recently been offered as a way to automatically discover the kind of complex solutions that exhibit truly intelligent behavior. So far, novelty search has only been studied in the context of problems where the number of possible “different” solutions has been limited. In this paper, we show, using a task with a much larger solution space,...
متن کامل