Most modern heuristics for classical planning are specified in terms of minimizing the summed operator costs. Heuristics for oversubscription planning (OSP), on the other hand, maximize the utility on states. In this work we aim to provide the grounds for the adaptation of existing heuristics for classical planning to the OSP setting. To this end, we reformulate the OSP task to a classical planning task extended with an additional operator costs function, reflecting the utility information fully. We exemplify how existing heuristics from classical planning can be adapted to such a setting with a merge-and-shrink heuristic and empirically validate the feasibility of our approach
www.plg.inf.uc3m.es Abstract. Oversubscription planning (OSP) appears in many real problems where fi...
A general and important problem of search-based planning techniques is the state explosion problem, ...
Heuristic search with an admissible heuristic is one of the most prominent approaches to solving cla...
The aim of classical planning is to minimize the summed cost of operators among those plans that ach...
Oversubscription planning (OSP) is the problem of finding plans that maximize the utility value of t...
While in classical planning the objective is to achieve one of the equally attractive goal states at...
Abstract. In the basic setup of oversubscription planning (OSP), the objective is to achieve an as v...
The objective of optimal oversubscription planning is to find a plan that yields an end state with a...
Oversubscription planning (OSP) is the problem of choosing an action sequence which reaches a state ...
Oversubscription planning is the problem of choosing an action sequence which reaches a state with a...
Oversubscription planning (OSP) appears in many real problems where nding a plan achieving all goa...
Planning deals with the task of finding an ordered set of actions that achieves some goals from an i...
Many real-world planning problems are oversubscription problems where all goals are not simultaneous...
In deterministic OSP, the objective is to achieve an as valuable as possible subset of goals within ...
A* search-based planner for Oversubscription Planning, as described in the paper A∗ Search and Boun...
www.plg.inf.uc3m.es Abstract. Oversubscription planning (OSP) appears in many real problems where fi...
A general and important problem of search-based planning techniques is the state explosion problem, ...
Heuristic search with an admissible heuristic is one of the most prominent approaches to solving cla...
The aim of classical planning is to minimize the summed cost of operators among those plans that ach...
Oversubscription planning (OSP) is the problem of finding plans that maximize the utility value of t...
While in classical planning the objective is to achieve one of the equally attractive goal states at...
Abstract. In the basic setup of oversubscription planning (OSP), the objective is to achieve an as v...
The objective of optimal oversubscription planning is to find a plan that yields an end state with a...
Oversubscription planning (OSP) is the problem of choosing an action sequence which reaches a state ...
Oversubscription planning is the problem of choosing an action sequence which reaches a state with a...
Oversubscription planning (OSP) appears in many real problems where nding a plan achieving all goa...
Planning deals with the task of finding an ordered set of actions that achieves some goals from an i...
Many real-world planning problems are oversubscription problems where all goals are not simultaneous...
In deterministic OSP, the objective is to achieve an as valuable as possible subset of goals within ...
A* search-based planner for Oversubscription Planning, as described in the paper A∗ Search and Boun...
www.plg.inf.uc3m.es Abstract. Oversubscription planning (OSP) appears in many real problems where fi...
A general and important problem of search-based planning techniques is the state explosion problem, ...
Heuristic search with an admissible heuristic is one of the most prominent approaches to solving cla...