资源分类
》 资源 》论文》Optimal Symbolic Planning with Action Costs and Preferences

Optimal Symbolic Planning with Action Costs and Preferences

2019-11-15 | |  62 |   42 |   0

Abstract This paper studies the solving of fifinite-domain action planning problems with discrete action costs and soft constraints. For sequential optimal planning, a symbolic perimeter database heuristic is addressed in a bucket implementation of A*. For computing net-benefifits, we propose symbolic branch-and-bound search together with some search refifinements. The net-benefifit we optimize is the total benefifit of satisfying the goals, minus the total action cost to achieve them. This results in an objective function to be minimized that is a linear expression over the violation of the preferences added to the action cost total.

上一篇：Topological Order Planner for POMDPs

下一篇：Learning Hierarchical Task Networks for Nondeterministic Planning Domains

用户评价
全部评价

热门资源

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