02/02/2021

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

Felix Mohr, Viktor Bengs, Eyke Hüllermeier

Keywords:

Abstract Paper Similar Papers

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.

The video of this talk cannot be embedded. You can watch it here:
https://slideslive.com/38949088
(Link will open in new window)
 0
 0
 0
 0
  Share    
This is an embedded video. Talk and the respective paper are published at AAAI 2021 virtual conference. If you are one of the authors of the paper and want to manage your upload, see the question "My papertalk has been externally embedded..." in the FAQ section.

Comments

Post Comment
no comments yet
code of conduct: tbd Characters remaining: 140

Similar Papers

 0
 0
 0
 0
 15:39 
 0
 0
 0
 0
 3:16 
 0
 0
 0
 0
 3:02 
 0
 0
 0
 0
 3:23 
 0
 0
 0
 0
 14:43 
 0
 0
 0
 0
 12:19 
 0
 0
 0
 0
 13:48 
 0
 0
 0
 0
 17:38 
 0
 0
 0
 0
 15:15 
 0
 0
 0
 0
 11:44 
 0
 0
 0
 0
 12:23 
 0
 0
 0
 0
 5:10 
 0
 0
 0
 0
 3:16 
 0
 0
 0
 0
 10:00 
 0
 0
 0
 0
 14:58 
 0
 0
 0
 0
 15:55 
 0
 0
 0
 0
 5:25 
 0
 0
 0
 0
 5:46 
 0
 0
 0
 0
 3:20 
 0
 0
 0
 0
 14:46 
 0
 0
 0
 0
 3:19 
 0
 0
 0
 0
 5:19 
 0
 0
 0
 0
 15:12 
 0
 0
 0
 0
 3:35 
 0
 0
 0
 0
 10:06 
 0
 0
 0
 0
 20:29 
 0
 0
 0
 0
 15:27 
 0
 0
 0
 0
 3:03 
 0
 0
 0
 0
 9:57 
 0
 0
 0
 0
 15:35 
 0
 0
 0
 0
 14:31 
 0
 0
 0
 0
 12:53 
 0
 0
 1
 2
 5:03 
 0
 0
 0
 0
 3:23 
 0
 0
 0
 0
 10:48 
 0
 0
 0
 0
 7:46 
 0
 0
 0
 0
 18:58 
 0
 0
 0
 0
 3:05 
 0
 0
 0
 0
 5:51 
 0
 0
 0
 0
 14:28