The DOI matches its Crossref record; 54 of the 54 references it cites were found in a registry or an index.
Encouraging Behavioral Diversity in Evolutionary Robotics: An Empirical Study
Abstract
Evolutionary robotics (ER) aims at automatically designing robots or controllers of robots without having to describe their inner workings. To reach this goal, ER researchers primarily employ phenotypes that can lead to an infinite number of robot behaviors and fitness functions that only reward the achievement of the task—and not how to achieve it. These choices make ER particularly prone to premature convergence. To tackle this problem, several papers recently proposed to explicitly encourage the diversity of the robot behaviors, rather than the diversity of the genotypes as in classic evolutionary optimization. Such an approach avoids the need to compute distances between structures and the pitfalls of the noninjectivity of the phenotype/behavior relation; however, it also introduces new questions: how to compare behavior? should this comparison be task specific? and what is the best way to encourage diversity in this context? In this paper, we review the main published approaches to behavioral diversity and benchmark them in a common framework. We compare each approach on three different tasks and two different genotypes. The results show that fostering behavioral diversity substantially improves the evolutionary process in the investigated experiments, regardless of genotype or task. Among the benchmarked approaches, multi-objective methods were the most efficient and the generic, Hamming-based, behavioral distance was at least as efficient as task specific behavioral metrics.
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
Holland, J. H. (1992) · The MIT Press eBooks · doi:10.7551/mitpress/1090.001.0001 · Cited by 47,002
Multi-Objective Optimization Using Evolutionary Algorithms
Deb, K., & Kalyanmoy, D. (2001) · Andalas University Repository (Andalas University) · Cited by 17,328
A Fast Elitist Non-dominated Sorting Genetic Algorithm for Multi-objective Optimization: NSGA-II
Deb, K., Agrawal, S., Pratap, A., & Meyarivan, T. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-45356-3_83 · Cited by 5,289
Evolving Neural Networks through Augmenting Topologies
Stanley, K. O., & Miikkulainen, R. (2002) · Evolutionary Computation · doi:10.1162/106365602320169811 · Cited by 3,258
Artificial Intelligence through Simulated Evolution
Fogel, L. J., Owens, A. J., & Walsh, M. J. (1966) · International Linear Collider · Cited by 2,796
Learning and development in neural networks: the importance of starting small
Elman, J. L. (1993) · Cognition · doi:10.1016/0010-0277(93)90058-4 · Cited by 1,988 · cited 1×
“Elman-Jordan networks 3 (Elman, 1993) are simple recurrent neural networks that extend the multi-layer perceptron with a hidden layer of context units (figure 3).”
Genetic Algorithms and Simulated Annealing
Davis, L. D. (1987) · Cited by 1,759
Evolutionary Robotics: The Biology, Intelligence, and Technology of Self-Organizing Machines
Nolfi, S., & Floreano, D. (2000) · The MIT Press eBooks · doi:10.7551/mitpress/2889.001.0001 · Cited by 1,513
Abandoning 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
Cited by
Abandoning 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
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
Exploration in deep reinforcement learning: A survey
Ladosz, P., Weng, L., Kim, M., & Oh, H. (2022) · Information Fusion · doi:10.1016/j.inffus.2022.03.003 · Cited by 525
“More detailed reviews of exploration in evolution strategies can be found in [78] and [79].”
BackgroundQuality 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
Illuminating search spaces by mapping elites
Mouret, J.-B., & Clune, J. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1504.04909 · Cited by 386
Self-citationEvolutionary Robotics: What, Why, and Where to
Doncieux, S., Bredeche, N., Mouret, J.-B., & Eiben, A. E. (. (2015) · Frontiers in Robotics and AI · doi:10.3389/frobt.2015.00004 · Cited by 275
Self-citationQuality 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
Evolution of Collective Behaviors for a Real Swarm of Aquatic Surface Robots
Duarte, M., Costa, V., Gomes, J., Rodrigues, T., Silva, F., Oliveira, S. M., & Christensen, A. L. (2016) · PLOS ONE · doi:10.1371/journal.pone.0151834 · Cited by 134
The evolutionary origins of hierarchy
Mengistu, H., Huizinga, J., Mouret, J.-B., & Clune, J. (2016) · PLOS Computational Biology · doi:10.1371/journal.pcbi.1004829 · Cited by 115
“in nature [59]. To make computational evolution more representative of natural evolutionary populations, which exhibit more diversity, we adopt the common technique of promoting behavioral diversity [59, 70, 71, 72, 73, 16] by adding another independent objective that rewards individuals for behaving dierently than ot…”
MethodSelf-citationClune, J. (2019) · arXiv · doi:10.48550/arxiv.1905.10985 · Cited by 82
“Many have shown such a combination is effective, whether in a weighted combination of novelty and reward [30], multi-objective algorithms [115, 117], or algorithms that intelligently rebalance between novelty and performance as a function of learning progress [30].”
BackgroundEvolution Through Large Models
Lehman, J., Gordon, J., Jain, S., Ndousse, K., Yeh, C., & Stanley, K. O. (2024) · Genetic and Evolutionary Computation · doi:10.1007/978-981-99-3814-8_11 · Cited by 74
Evolution through Large Models
Lehman, J., Gordon, J., Jain, S., Ndousse, K., Yeh, C., & Stanley, K. O. (2022) · arXiv · doi:10.48550/arxiv.2206.08896 · Cited by 74
A hippocampo-cerebellar centred network for the learning and execution of sequence-based navigation
Babayan, B. M., Watilliaux, A., Viejo, G., Paradis, A.-L., Girard, B., & Rondi-Reig, L. (2017) · Scientific Reports · doi:10.1038/s41598-017-18004-7 · Cited by 70
Huizinga, J., & Clune, J. (2022) · Evolutionary Computation · doi:10.1162/evco_a_00301 · Cited by 20
Metadata
- Authors
- Mouret, J.-B., & Doncieux, S.
- Venue
- Evolutionary Computation
- Publisher
- MIT Press
- Published
- 2012-03
- Volume
- 20
- Issue
- 1
- Pages
- 91-133
- ISSN
- 1063-6560 (ISSN-L)
- 1530-9304
- OpenAlex
- W2155921792
- Cited by
- 257
- References
- 54
- FWCI
- 18.33
- Type
- journal article
- Language
- en
- Open access
- closed
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.