资源分类
》 资源 》论文》Heuristics for Cost-Optimal Classical Planning Based on Linear Programming

Heuristics for Cost-Optimal Classical Planning Based on Linear Programming

2019-11-20 | |  38 |   29 |   0
Abstract Many heuristics for cost-optimal planning are based on linear programming. We cover several interesting heuristics of this type by a common framework that fixes the objective function of the linear program. Within the framework, constraints from different heuristics can be combined in one heuristic estimate which dominates the maximum of the component heuristics. Different heuristics of the framework can be compared on the basis of their constraints. We present theoretical results on the relation between existing heuristics and experimental results that demonstrate the potential of the proposed framework.

上一篇：Matching and Grokking: Approaches to Personalized Crowdsourcing

下一篇：Reasoning with Probabilistic Ontologies

用户评价
全部评价

热门资源

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

  • Rating-Boosted La...

    The performance of a recommendation system reli...