Evolving a diversity of virtual creatures through novelty search and local competition
Open accessThe DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
Abstract
An ambitious challenge in artificial life is to craft an evolutionary process that discovers a wide diversity of well-adapted 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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A fast and elitist multiobjective genetic algorithm: NSGA-II
Deb, K., Pratap, A., Agarwal, S., & Meyarivan, T. (2002) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.996017 · Cited by 50,053
Evolving Neural Networks through Augmenting Topologies
Stanley, K. O., & Miikkulainen, R. (2002) · Evolutionary Computation · doi:10.1162/106365602320169811 · Cited by 3,258
Self-citationGenetic algorithms with sharing for multimodal function optimization
Goldberg, D. E., & Richardson, J. T. (1987) · international conference on Genetic algorithms · Cited by 1,912
A Comprehensive Survey of Evolutionary-Based Multiobjective Optimization Techniques
Coello Coello, C. A. (1999) · Knowledge and Information Systems · doi:10.1007/bf03325101 · Cited by 1,367
Sims, K. (1994) · Proceedings of the 21st annual conference on Computer graphics and interactive techniques - SIGGRAPH '94 · doi:10.1145/192161.192167 · Cited by 1,005 · cited 10×
“While in previous novelty search experiments the measure of novelty was designed to correlate at least weakly with performance [13, 14, 17], morphology can be explored independently of locomotion ability, which is a typical measure of performance in virtual creature worlds [2, 9, 18].”
InfluentialAbandoning Objectives: Evolution Through the Search for Novelty Alone
Lehman, J., & Stanley, K. O. (2011) · Evolutionary Computation · doi:10.1162/evco_a_00025 · Cited by 917
Self-citationCompositional pattern producing networks: A novel abstraction of development
Stanley, K. O. (2007) · Genetic Programming and Evolvable Machines · doi:10.1007/s10710-007-9028-8 · Cited by 713
Self-citationExploiting Open-Endedness to Solve Problems Through the Search for Novelty
Lehman, J., & Stanley, K. O. (2008) · Cited by 408
Self-citationALPS: the age-layered population structure for reducing the problem of premature convergence
Hornby, G. S. (2006) · Proceedings of the 8th annual conference on Genetic and evolutionary computation · doi:10.1145/1143997.1144142 · Cited by 230
Evolving Complete Agents using Artificial Ontogeny
Bongard, J., & Pfeifer, R. (2003) · Springer eBooks · doi:10.1007/978-4-431-67869-4_12 · Cited by 194
Cited by
Designing neural networks through neuroevolution
Stanley, K. O., Clune, J., Lehman, J., & Miikkulainen, R. (2019) · Nature Machine Intelligence · doi:10.1038/s42256-018-0006-z · Cited by 689
Self-citationA Recipe for Soft Fluidic Elastomer Robots
Marchese, A. D., Katzschmann, R. K., & Rus, D. (2015) · Soft Robotics · doi:10.1089/soro.2014.0022 · Cited by 649
“6 VoxCAD and the Voxelyze physics engine, as used in Cheney et al. 61 and Lehman and Stanley, 62 and reviewed by Lipson, 6 are simulation tools for very soft nonlinear materials.”
Soft Manipulators and Grippers: A Review
Hughes, J., Culha, U., Giardina, F., Guenther, F., Rosendo, A., & Iida, F. (2016) · Frontiers in Robotics and AI · doi:10.3389/frobt.2016.00069 · Cited by 619
Such, F. P., Madhavan, V., Conti, E., Lehman, J., Stanley, K. O., & Clune, J. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1712.06567 · Cited by 525
Self-citationQuality Diversity: A New Frontier for Evolutionary Computation
Pugh, J. K., Soros, L. B., & Stanley, K. O. (2016) · Frontiers in Robotics and AI · doi:10.3389/frobt.2016.00040 · Cited by 514
Self-citationIlluminating search spaces by mapping elites
Mouret, J.-B., & Clune, J. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1504.04909 · Cited by 386
Challenges and Opportunities for Design, Simulation, and Fabrication of Soft Robots
Lipson, H. (2014) · Soft Robotics · doi:10.1089/soro.2013.0007 · Cited by 300
Quality and Diversity Optimization: A Unifying Modular Framework
Cully, A., & Demiris, Y. (2018) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2017.2704781 · Cited by 258
Cheney, N., MacCurdy, R., Clune, J., & Lipson, H. (2013) · Proceedings of the 15th annual conference on Genetic and evolutionary computation · doi:10.1145/2463372.2463404 · Cited by 211
“One hypothesis for the lack of increased complexity is that most work, including Sims , evolves morphologies composed of rigid elements, such as solid cubes and cylinders, limiting the design space.”
BackgroundGo-Explore: a New Approach for Hard-Exploration Problems
Ecoffet, A., Huizinga, J., Lehman, J., Stanley, K. O., & Clune, J. (2019) · arXiv · doi:10.48550/arxiv.1901.10995 · Cited by 205
“The idea of preserving and exploring from stepping stones in an archive comes from the quality diversity (QD) family of algorithms (like MAP-elites [60, 79] and novelty search with local competition [80]), and Go-Explore is an enhanced QD algorithm based on MAP-Elites.”
MethodSelf-citationPlanning to Explore via Self-Supervised World Models
Sekar, R., Rybkin, O., Daniilidis, K., Abbeel, P., Hafner, D., & Pathak, D. (2020) · arXiv · doi:10.48550/arxiv.2005.05960 · Cited by 129
“…that it cannot yet predict accurately (Schmid-huber, 1991b; Oudeyer et al., 2007; Pathak et al., 2017), maximally influence its inputs (Klyubin et al., 2005; Eysen-bach et al., 2018), or visit rare states (Poupart et al., 2006; Lehman & Stanley, 2011; Bellemare et al., 2016; Burda et al., 2018).”
BackgroundClune, J. (2019) · arXiv · doi:10.48550/arxiv.1905.10985 · Cited by 82
“The first of its kind was Novelty Search with Local Competition [93] followed by MAP-Elites [116].”
MethodPOET: open-ended coevolution of environments and their optimized solutions
Wang, R., Lehman, J., Clune, J., & Stanley, K. O. (2019) · Proceedings of the Genetic and Evolutionary Computation Conference · doi:10.1145/3321707.3321799 · Cited by 61
“CCS CONCEPTS • Computing methodologies→ Artificial life; Evolutionary robotics; Reinforcement learning; Neural networks; KEYWORDS Open-ended evolution, coevolution, evolution strategies, novelty search, artificial life ACM Reference Format: Rui Wang, Joel Lehman, Jeff Clune*, and Kenneth O. Stanley*. 2019.”
BackgroundMethodInfluentialSelf-citationWang, R., Lehman, J., Rawal, A., Zhi, J., Li, Y., Clune, J., & Stanley, K. O. (2020) · arXiv · doi:10.48550/arxiv.2003.08536 · Cited by 53
“…(e.g. pursuing different kinds of solutions simultaneously) and optimization (e.g. giving one arguably “best” solution) (Brant & Stanley, 2017; Lehman & Stanley, 2011b; Mouret & Clune, 2015; Pugh et al., 2016; Soros & Stanley, 2014), as those solely focusing on optimization often lead to…”
BackgroundInfluentialSelf-citationPolicy manifold search: exploring the manifold hypothesis for diversity-based neuroevolution
Rakicevic, N., Cully, A., & Kormushev, P. (2021) · Proceedings of the Genetic and Evolutionary Computation Conference · doi:10.1145/3449639.3459320 · Cited by 32
“Most popular approaches are Multi-dimensional Archive of Phenotypic Elites (MAP-Elites) [11, 33] and Novelty Search with Local Competition [29], which differ in how they select and maintain a collection of controller policies based on their exhibited behaviours.”
BackgroundPromptbreeder: Self-Referential Self-Improvement via Prompt Evolution
Fernando, C., Banarse, D., Michalewski, H., Osindero, S., & Rocktäschel, T. (2023) · arXiv · doi:10.48550/arxiv.2309.16797 · Cited by 31
Huizinga, J., & Clune, J. (2022) · Evolutionary Computation · doi:10.1162/evco_a_00301 · Cited by 20
The OpenELM Library: Leveraging Progress in Language Models for Novel Evolutionary Algorithms
Bradley, H., Fan, H., Galanos, T., Zhou, R., Scott, D., & Lehman, J. (2024) · Genetic and Evolutionary Computation · doi:10.1007/978-981-99-8413-8_10 · Cited by 19
Self-citationWitkowski, O., & Ikegami, T. (2019) · Artificial Life · doi:10.1162/artl_a_00288 · Cited by 14
Lehman, J. (2019) · arXiv · doi:10.48550/arxiv.1906.10189 · Cited by 3
Self-citationZhang, J., Zhao, B., Yang, W., Foerster, J., Clune, J., Jiang, M., Devlin, S., & Shavrina, T. (2026) · arXiv · doi:10.48550/arxiv.2603.19461
ALOBED, M. (2026) · SSRN Electronic Journal · doi:10.2139/ssrn.7291548
Wang, R., Lehman, J., Clune, J., & Stanley, K. O. (2019) · arXiv
Self-citation
Metadata
- Authors
- Lehman, J., & Stanley, K. O.
- Venue
- Proceedings of the 13th annual conference on Genetic and evolutionary computation
- Publisher
- ACM
- Published
- 2011-07-12
- Pages
- 211-218
- OpenAlex
- W2099746672
- Cited by
- 385
- References
- 15
- FWCI
- 8.29
- Type
- conference paper
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.