Bandit based monte-carlo planning

  • Authors:
  • Levente Kocsis;Csaba Szepesvári

  • Affiliations:
  • Computer and Automation Research Institute of the Hungarian Academy of Sciences, Budapest, Hungary;Computer and Automation Research Institute of the Hungarian Academy of Sciences, Budapest, Hungary

  • Venue:
  • ECML'06 Proceedings of the 17th European conference on Machine Learning
  • Year:
  • 2006

Quantified Score

Hi-index 0.03

Visualization

Abstract

For large state-space Markovian Decision Problems Monte-Carlo planning is one of the few viable approaches to find near-optimal solutions. In this paper we introduce a new algorithm, UCT, that applies bandit ideas to guide Monte-Carlo planning. In finite-horizon or discounted MDPs the algorithm is shown to be consistent and finite sample bounds are derived on the estimation error due to sampling. Experimental results show that in several domains, UCT is significantly more efficient than its alternatives.