Quality Diversity for Multi-task Optimization - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2020

Quality Diversity for Multi-task Optimization


Quality Diversity (QD) algorithms are a recent family of optimization algorithms that search for a large set of diverse but high-performing solutions. In some specific situations, they can solve multiple tasks at once. For instance, they can find the joint positions required for a robotic arm to reach a set of points, which can also be solved by running a classic optimizer for each target point. However, they cannot solve multiple tasks when the fitness needs to be evaluated independently for each task (e.g., optimizing policies to grasp many different objects). In this paper, we propose an extension of the MAP-Elites algorithm, called Multi-task MAP-Elites, that solves multiple tasks when the fitness function depends on the task. We evaluate it on a simulated parameterized planar arm (10-dimensional search space; 5000 tasks) and on a simulated 6-legged robot with legs of different lengths (36-dimensional search space; 2000 tasks). The results show that in both cases our algorithm outperforms the optimization of each task separately with the CMA-ES algorithm.
Fichier principal
Vignette du fichier
multitask.pdf (4.42 Mo) Télécharger le fichier
Origin Publication funded by an institution

Dates and versions

hal-02555202 , version 1 (27-04-2020)



Jean-Baptiste Mouret, Glenn Maguire. Quality Diversity for Multi-task Optimization. GECCO'20 - Genetic and Evolutionary Computation Conference, Jul 2020, Cancun, Mexico. ⟨10.1145/3377930.3390203⟩. ⟨hal-02555202⟩
103 View
148 Download



Gmail Mastodon Facebook X LinkedIn More