Monte Carlo tree search for continuous and stochastic sequential decision making problems
A Couetoux - 2013 - theses.hal.science
In this thesis, I studied sequential decision making problems, with a focus on the unit
commitment problem. Traditionnaly solved by dynamic programming methods, this problem …
commitment problem. Traditionnaly solved by dynamic programming methods, this problem …
Optimistic heuristics for Minesweeper
We present a combination of Upper Confidence Tree (UCT) and domain specific solvers,
aimed at improving the behavior of UCT for long term aspects of a problem. Results improve …
aimed at improving the behavior of UCT for long term aspects of a problem. Results improve …
Combining myopic optimization and tree search: Application to minesweeper
Many reactive planning tasks are tackled by optimization combined with shrinking horizon at
each time step: the problem is simplified to a non-reactive (myopic) optimization problem …
each time step: the problem is simplified to a non-reactive (myopic) optimization problem …
Fast constraint satisfaction problem and learning-based algorithm for solving Minesweeper
Minesweeper is a popular spatial-based decision-making game that works with incomplete
information. As an exemplary NP-complete problem, it is a major area of research employing …
information. As an exemplary NP-complete problem, it is a major area of research employing …
Upper confidence tree-based consistent reactive planning application to minesweeper
Many reactive planning tasks are tackled through myopic optimization-based approaches.
Specifically, the problem is simplified by only considering the observations available at the …
Specifically, the problem is simplified by only considering the observations available at the …