Single Player Monte-Carlo Tree Search Based on the Plackett-Luce Model

Felix Mohr, Viktor Bengs, Eyke Hüllermeier

AAAI 2021 pp. 12373-12381

doi:10.1609/AAAI.V35I14.17468 /aaai/2021/mohr2021aaai-single/

Abstract

The problem of minimal cost path search is especially difficult when no useful heuristics are available. A common solution is roll-out-based search like Monte Carlo Tree Search (MCTS). However, MCTS is mostly used in stochastic or adversarial environments, with the goal to identify an agent's best next move. For this reason, even though single player versions of MCTS exist, most algorithms, including UCT, are not directly tailored to classical minimal cost path search. We present Plackett-Luce MCTS (PL-MCTS), a path search algorithm based on a probabilistic model over the qualities of successor nodes. We empirically show that PL-MCTS is competitive and often superior to the state of the art.

PDF AAAI Semantic Scholar

Cite

Text

Mohr et al. "Single Player Monte-Carlo Tree Search Based on the Plackett-Luce Model." AAAI Conference on Artificial Intelligence, 2021. doi:10.1609/AAAI.V35I14.17468

Markdown

[Mohr et al. "Single Player Monte-Carlo Tree Search Based on the Plackett-Luce Model." AAAI Conference on Artificial Intelligence, 2021.](https://mlanthology.org/aaai/2021/mohr2021aaai-single/) doi:10.1609/AAAI.V35I14.17468

BibTeX

@inproceedings{mohr2021aaai-single,
  title     = {{Single Player Monte-Carlo Tree Search Based on the Plackett-Luce Model}},
  author    = {Mohr, Felix and Bengs, Viktor and Hüllermeier, Eyke},
  booktitle = {AAAI Conference on Artificial Intelligence},
  year      = {2021},
  pages     = {12373-12381},
  doi       = {10.1609/AAAI.V35I14.17468},
  url       = {https://mlanthology.org/aaai/2021/mohr2021aaai-single/}
}