A comparison of illumination algorithms in unbounded spaces - Archive ouverte HAL Access content directly
Conference Papers Year :

A comparison of illumination algorithms in unbounded spaces

(1) , (1) , (1)
1

Abstract

Illumination algorithms are a new class of evolutionary algorithms capable of producing large archives of diverse and high-performing solutions. Examples of such algorithms include Novelty Search with Local Competition (NSLC), the Multi-dimensional Archive of Phenotypic Elites (MAP-Elites) and the newly introduced Cen-troidal Voronoi Tessellation (CVT) MAP-Elites. While NSLC can be used in unbounded behavioral spaces, MAP-Elites and CVT-MAP-Elites require the user to manually specify the bounds. In this study, we introduce variants of these algorithms that expand their bounds based on the discovered solutions. In addition, we introduce a novel algorithm called "Cluster-Elites" that can adapt its bounds to non-convex spaces. We compare all algorithms in a maze navigation problem and illustrate that Cluster-Elites and the expansive variants of MAP-Elites and CVT-MAP-Elites have comparable or better performance than NSLC, MAP-Elites and CVT-MAP-Elites.
Fichier principal
Vignette du fichier
2017_vassiliades_gecco_unbounded.pdf (836.68 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01518814 , version 1 (05-05-2017)

Identifiers

  • HAL Id : hal-01518814 , version 1

Cite

Vassilis Vassiliades, Konstantinos Chatzilygeroudis, Jean-Baptiste Mouret. A comparison of illumination algorithms in unbounded spaces. Workshop "Measuring and Promoting Diversity in Evolutionary Algorithms", Genetic and Evolutionary Computation Conference, 2017, Berlin, Germany. ⟨hal-01518814⟩
339 View
497 Download

Share

Gmail Facebook Twitter LinkedIn More