资源分类
》 资源 》论文》ASAP-UCT: Abstraction of State-Action Pairs in UCT

ASAP-UCT: Abstraction of State-Action Pairs in UCT

2019-11-18 | |  79 |   41 |   0
Abstract work, which extends and unifies past work on domain abstractions by holistically aggregating both states and state-action pairs – ASAP uncovers a much larger number of symmetries in a given domain. Second, we propose ASAP-UCT, which implements ASAP-style abstractions within a UCT framework combining strengths of online planning with domain abstractions. Experimental evaluation on several benchmark domains shows up to 26% improvement in the quality of policies obtained over existing algorithms.

上一篇：Tight Bounds for HTN planning with Task Insertion

下一篇：Further Connections Between Contract-Scheduling and Ray-Searching Problems

用户评价
全部评价

热门资源

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • A Mathematical Mo...

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

  • Rating-Boosted La...

    The performance of a recommendation system reli...