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.
https://hal.inria.fr/hal-01406471 Contributor : Fabien TeytaudConnect in order to contact the contributor Submitted on : Thursday, December 1, 2016 - 11:20:09 AM Last modification on : Tuesday, January 25, 2022 - 8:30:03 AM Long-term archiving on: : Tuesday, March 21, 2017 - 2:27:58 AM