资源分类
》 资源 》论文》Subgoal-Based Temporal Abstraction in Monte-Carlo Tree Search

Subgoal-Based Temporal Abstraction in Monte-Carlo Tree Search

2019-10-10 | |  94 |   59 |   0
Abstract We propose an approach to general subgoal-based temporal abstraction in MCTS. Our approach approximates a set of available macro-actions locally for each state only requiring a generative model and a subgoal predicate. For that, we modify the expansion step of MCTS to automatically discover and optimize macro-actions that lead to subgoals. We empirically evaluate the effectiveness, computational efficiency and robustness of our approach w.r.t. different parameter settings in two benchmark domains and compare the results to standard MCTS without temporal abstraction

上一篇：Strong Fully Observable Non-Deterministic Planning with LTL and LTLf Goals

下一篇：T-CVAE: Transformer-Based Conditioned Variational Autoencoder for Story Completion

用户评价
全部评价

热门资源

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • The Variational S...

    Unlike traditional images which do not offer in...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Learning to learn...

    The move from hand-designed features to learned...