Using Centroidal Voronoi Tessellations to Scale Up the Multi-dimensional Archive of Phenotypic Elites Algorithm

10/18/2016
by   Vassilis Vassiliades, et al.
0

The recently introduced Multi-dimensional Archive of Phenotypic Elites (MAP-Elites) is an evolutionary algorithm capable of producing a large archive of diverse, high-performing solutions in a single run. It works by discretizing a continuous feature space into unique regions according to the desired discretization per dimension. While simple, this algorithm has a main drawback: it cannot scale to high-dimensional feature spaces since the number of regions increase exponentially with the number of dimensions. In this paper, we address this limitation by introducing a simple extension of MAP-Elites that has a constant, pre-defined number of regions irrespective of the dimensionality of the feature space. Our main insight is that methods from computational geometry could partition a high-dimensional space into well-spread geometric regions. In particular, our algorithm uses a centroidal Voronoi tessellation (CVT) to divide the feature space into a desired number of regions; it then places every generated individual in its closest region, replacing a less fit one if the region is already occupied. We demonstrate the effectiveness of the new "CVT-MAP-Elites" algorithm in high-dimensional feature spaces through comparisons against MAP-Elites in maze navigation and hexapod locomotion tasks.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/10/2019

Rectangular Bounding Process

Stochastic partition models divide a multi-dimensional space into a numb...
research
10/11/2021

Density-based interpretable hypercube region partitioning for mixed numeric and categorical data

Consider a structured dataset of features, such as {SEX, INCOME, RACE, E...
research
12/26/2012

Hyperplane Arrangements and Locality-Sensitive Hashing with Lift

Locality-sensitive hashing converts high-dimensional feature vectors, su...
research
05/23/2016

Stochastic Patching Process

Stochastic partition models tailor a product space into a number of rect...
research
04/20/2015

Illuminating search spaces by mapping elites

Many fields use search algorithms, which automatically explore a search ...
research
09/08/2021

Quality-Diversity Meta-Evolution: customising behaviour spaces to a meta-objective

Quality-Diversity (QD) algorithms evolve behaviourally diverse and high-...
research
03/29/2017

Hierarchical Surrogate Modeling for Illumination Algorithms

Evolutionary illumination is a recent technique that allows producing ma...

Please sign up or login with your details

Forgot password? Click here to reset