Selection-Expansion: A Unifying Framework for Motion-Planning and Diversity Search Algorithms - Sorbonne Université
Preprints, Working Papers, ... Year : 2021

Selection-Expansion: A Unifying Framework for Motion-Planning and Diversity Search Algorithms

Abstract

Reinforcement learning agents need a reward signal to learn successful policies. When this signal is sparse or the corresponding gradient is deceptive, such agents need a dedicated mechanism to efficiently explore their search space without relying on the reward. Looking for a large diversity of behaviors or using Motion Planning (MP) algorithms are two options in this context. In this paper, we build on the common roots between these two options to investigate the properties of two diversity search algorithms, the Novelty Search and the Goal Exploration Process algorithms. These algorithms look for diversity in an outcome space or behavioral space which is generally hand-designed to represent what matters for a given task. The relation to MP algorithms reveals that the smoothness, or lack of smoothness of the mapping between the policy parameter space and the outcome space plays a key role in the search efficiency. In particular, we show empirically that, if the mapping is smooth enough, i.e. if two close policies in the parameter space lead to similar outcomes, then diversity algorithms tend to inherit exploration properties of MP algorithms. By contrast, if it is not, diversity algorithms lose these properties and their performance strongly depends on specific heuristics, notably filtering mechanisms that discard some of the explored policies.
Fichier principal
Vignette du fichier
Selection_Expansion_HAL.pdf (3.47 Mo) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-03196479 , version 1 (12-04-2021)

Identifiers

  • HAL Id : hal-03196479 , version 1

Cite

Alexandre Chenu, Nicolas Perrin-Gilbert, Stephane Doncieux, Olivier Sigaud. Selection-Expansion: A Unifying Framework for Motion-Planning and Diversity Search Algorithms. 2021. ⟨hal-03196479⟩
116 View
123 Download

Share

More