Cited by 514Evolutionary Algorithms and ApplicationsMetaheuristic Optimization Algorithms ResearchModular Robots and Swarm Intelligence

Quality Diversity: A New Frontier for Evolutionary Computation

Open access
Pugh, Justin K., Soros, Lisa B., Stanley, Kenneth O.·2016·Frontiers in Robotics and AI

Abstract

While evolutionary computation and evolutionary robotics take inspiration from nature, they have long focused mainly on problems of performance optimization. Yet evolution in nature can be interpreted as more nuanced than a process of simple optimization. In particular, natural evolution is a divergent search that optimizes locally within each niche as it simultaneously diversifies. This tendency to discover both quality and diversity at the same time differs from many of the conventional algorithms of machine learning, and also thereby suggests a different foundation for inferring the approach of greatest potential for evolutionary algorithms. In fact, several recent evolutionary algorithms called quality diversity (QD) algorithms(e.g. novelty search with local competition and MAP-Elites) have drawn inspiration from this more nuanced view, aiming to fill a space of possibilities with the best possible example of each type of achievable behavior. The result is a new class of algorithms that return an archive of diverse, high-quality behaviors in a single run. The aim in this paper is to study the application of QD algorithms in challenging environments (in particular complex mazes) to establish their best practices for ambitious domains in the future. In addition to providing insight into cases when QD succeeds and fails, a new approach is investigated that hybridizes multiple views of behaviors (called behavior characterizations) in the same run, which succeeds in overcoming some of the challenges associated with searching for QD with respect to a behavior characterization that is not necessarily sufficient for generating both quality and diversity at the same time.

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.3389/frobt.2016.00040

Cites

65 of 65 references verified0 citation errors · 0 not checkable

Statistics

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Under Quality-Diversity optimization, the search space is divided into behavioral niches to evolve diverse solutions, a paradigm that challenged the dominant approach of training a single agent, as it proved more robust in real-world settings.

    “under Quality-Diversity optimization (Pugh et al., 2016), the search space is divided into behavioral niches to evolve diverse solutions, a paradigm that challenged the dominant approach of training a single agent, as it proved more robust in real-world settings (Cully et al., 2015).”
  • The clustering approach aims to preserve diversity and is related to Lexicase and fitness uniform optimization.

    “This approach, which aims to preserve diversity55,56, is related to Lexicase57 in that both approaches consider a set of test cases for scoring an individual, and it is related to fitness uniform optimization58, which also clusters individuals on the basis of their fitness value; however, we sample the clusters on the basis of their score instead of uniformly, as detailed next.”

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

3 of the 68 references couldn’t be matched to a known paper.

Research works printed but not linked: 6

  1. Bedau, M. (2008). "The arrow of complexity hypothesis (abstract), " in Proceedings of the Eleventh International Conference on Artificial Life (Alife XI), eds S. Bullock, J. Noble, R. Watson, and M. Bedau (Cambridge, MA: MIT Press), 750.
  2. Boden, M. (2006). Mind as Machine: A History of Cognitive Science. USA: Oxford University Press.
  3. De Jong, K. A. (2002). Evolutionary Computation: A Unified Perspective. Cambridge, MA: MIT Press.
  4. Holland, J. H. (1975). Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control and Artificial Intelligence. Ann Arbor, MI: University of Michigan Press.
  5. Mahfoud, S. W. (1995). Niching Methods for Genetic Algorithms. Ph.D. thesis, University of Illinois at Urbana-Champaign, Urbana, IL.
  6. Mitchell, T. M. (1997). Machine Learning. New York, NY: McGraw-Hill.

Cited by

Sorted by citations

Authors
Pugh, J. K., Soros, L. B., & Stanley, K. O.
Affiliations
University of Central Florida (US)
Corresponding author
Stanley, Kenneth O.
Venue
Frontiers in Robotics and AI
Published
2016-07-12
Volume
3
ISSN
2296-9144 (ISSN-L)
OpenAlex
W2462548332
Cited by
514
References
68
Citations by year
2026: 43 · 2025: 54 · 2024: 63 · 2023: 68 · 2022: 72 · 2021: 51 · 2020: 73 · 2019: 44 · 2018: 26 · 2017: 19 · 2016: 1
FWCI
24.71
Type
journal article
Language
en
Open access
Licence
cc-by
Locations
  • Frontiers in Robotics and AI (publishedVersion, cc-by)
  • Journal of International Crisis and Risk Communication Research (submittedVersion)
  • DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
Funders
National Science Foundation (IIS-1421925)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Evolutionary Algorithms and Applications
  • Physical Sciences › Computer Science › Artificial Intelligence › Metaheuristic Optimization Algorithms Research
  • Physical Sciences › Engineering › Mechanical Engineering › Modular Robots and Swarm Intelligence
Keywords
quality diversity, evolutionary algorithms, novelty search, MAP-Elites, niche diversity, evolutionary robotics

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