资源论文Symbolic Merge-and-Shrink for Cost-Optimal Planning

Symbolic Merge-and-Shrink for Cost-Optimal Planning

2019-11-11 | |  81 |   45 |   0

Abstract Symbolic PDBs and Merge-and-Shrink (M&S) are two approaches to derive admissible heuristics for optimal planning. We present a combination of these techniques, Symbolic Merge-and-Shrink (SM&S), which uses M&S abstractions as a relaxation criterion for a symbolic backward search. Empirical evaluation shows that SM&S has the strengths of both techniques deriving heuristics at least as good as the best of them for most domains.

上一篇:Plan Quality Optimisation via Block Decomposition Fazlul Hasan Siddiqui and Patrik Haslum

下一篇:Run-Time Improvement of Point-Based POMDP Policies Minlue Wang and Richard Dearden

用户评价
全部评价

热门资源

  • 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 ...

  • Learning to learn...

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

  • A Mathematical Mo...

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