Skip to Main content Skip to Navigation
Conference papers

Comparing multimodal optimization and illumination

Vassilis Vassiliades 1 Konstantinos Chatzilygeroudis 1 Jean-Baptiste Mouret 1 
1 LARSEN - Lifelong Autonomy and interaction skills for Robots in a Sensing ENvironment
Inria Nancy - Grand Est, LORIA - AIS - Department of Complex Systems, Artificial Intelligence & Robotics
Abstract : Illumination algorithms are a recent addition to the evolutionary computation toolbox that allows the generation of many diverse and high-performing solutions in a single run. Nevertheless, traditional multimodal optimization algorithms also search for diverse and high-performing solutions: could some multimodal optimization algorithms be beeer at illumination than illumination algorithms? In this study, we compare two illumination algorithms (Novelty Search with Local Competition (NSLC), MAP-Elites) with two multimodal optimization ones (Clearing, Restricted Tournament Selection) in a maze navigation task. e results show that Clearing can have comparable performance to MAP-Elites and NSLC.
Complete list of metadata

Cited literature [12 references]  Display  Hide  Download
Contributor : Jean-Baptiste Mouret Connect in order to contact the contributor
Submitted on : Friday, May 5, 2017 - 2:34:32 PM
Last modification on : Saturday, June 25, 2022 - 7:45:34 PM
Long-term archiving on: : Sunday, August 6, 2017 - 2:13:49 PM


Files produced by the author(s)


  • HAL Id : hal-01518802, version 1


Vassilis Vassiliades, Konstantinos Chatzilygeroudis, Jean-Baptiste Mouret. Comparing multimodal optimization and illumination. Genetic and Evolutionary Computation Conference (GECCO 2017), 2017, Berlin, Germany. ⟨hal-01518802⟩



Record views


Files downloads