资源分类
》 资源 》论文》Planning with SAT, Admissible Heuristics and A* Jussi Rintanen

Planning with SAT, Admissible Heuristics and A* Jussi Rintanen

2019-11-12 | |  67 |   48 |   0
Abstract We study the relationship between optimal planning algorithms, in the form of (iterative deepening) A? with (forward) state-space search, and the reduction of the problem to SAT. Our results establish a strict dominance relation between the two approaches: any iterative deepening A? search can be ef?ciently simulated in the SAT framework, assuming that the heuristic has been encoded in the SAT problem, but the opposite is not possible as A? and IDA? searches sometimes take exponentially longer.

上一篇：Computing In?nite Plans for LTL Goals Using a Classical Planner

下一篇：Replanning in Domains with Partial Information and Sensing Actions

用户评价
全部评价

热门资源

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