Learning a Move-Generator for Upper Con dence Trees
Résumé
We experiment the introduction of machine learning tools to improve Monte-Carlo Tree Search. More precisely, we propose the use of Direct Policy Search, a classical reinforcement learning paradigm, to learn the Monte-Carlo Move Generator. We experiment our algorithm on di erent forms of unit commitment problems, including experiments on a problem with both macrolevel and microlevel decisions.
Origine | Fichiers produits par l'(les) auteur(s) |
---|
Loading...