Abstract : The Nested Rollout Policy Adaptation algorithm is a tree search algorithm known to be efficient on combinatorial problems. However, one problem of this algorithm is that it can converge to a local optimum and get stuck in it. We propose a modification which limits this behavior and we experiment it on two combinatorial problems for which the Nested Rollout Policy Adaption is known to be good at.
Type de document :
Communication dans un congrès
ECAI, Aug 2012, Montpellier, France. 2012, Computer Games Workshop, ECAI
https://hal.inria.fr/hal-01406471
Contributeur : Fabien Teytaud
<>
Soumis le : jeudi 1 décembre 2016 - 11:20:09
Dernière modification le : jeudi 11 janvier 2018 - 06:17:30
Document(s) archivé(s) le : mardi 21 mars 2017 - 02:27:58
