Ensemble Monte-Carlo Planning: An Empirical Study

@inproceedings{Fern2011EnsembleMP,
  title={Ensemble Monte-Carlo Planning: An Empirical Study},
  author={Alan Fern and Paul Lewis},
  booktitle={ICAPS},
  year={2011}
}
Monte-Carlo planning algorithms, such as UCT, select actions at each decision epoch by intelligently expanding a single search tree given the available time and then selecting the best root action. Recent work has provided evidence that it can be advantageous to instead construct an ensemble of search trees and to make a decision according to a weighted vote. However, these prior investigations have only considered the application domains of Go and Solitaire and were limited in the scope of… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 19 CITATIONS

Optimizing UCT for Settlers of Catan

  • 2017 16th Brazilian Symposium on Computer Games and Digital Entertainment (SBGames)
  • 2017
VIEW 7 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

Ensemble UCT Needs High Exploitation

S. Ali Mirsoleimani, Aske Plaat, Jaap van den Herik
  • ICAART
  • 2015
VIEW 5 EXCERPTS
CITES BACKGROUND, RESULTS & METHODS
HIGHLY INFLUENCED

Ensemble Determinization in Monte Carlo Tree Search for the Imperfect Information Card Game Magic: The Gathering

  • IEEE Transactions on Computational Intelligence and AI in Games
  • 2012
VIEW 10 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Optimizing UCT for Settlers of Catan

VIEW 3 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Sidekick agents for sequential planning problems

VIEW 3 EXCERPTS
CITES RESULTS & METHODS
HIGHLY INFLUENCED