A* search-based planner for Oversubscription Planning, as described in the paper A∗ Search and Bound-Sensitive Heuristics for Oversubscription Planning (https://openreview.net/forum?id=BJlBNZDaP4
Planning deals with the task of finding an ordered set of actions that achieves some goals from an i...
This short paper provides a high-level description of the plan-ner CBP (Cost-Based Planner). CBP per...
Most modern heuristics for classical planning are specified in terms of minimizing the summed operat...
Oversubscription planning (OSP) is the problem of finding plans that maximize the utility value of t...
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 ...
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...
Oversubscription planning (OSP) appears in many real problems where nding a plan achieving all goa...
www.plg.inf.uc3m.es Abstract. Oversubscription planning (OSP) appears in many real problems where fi...
The problem of searching for a plan with cost at most equal to a given absolute bound has attracted ...
a domain-independent planning algorithm that implements the family of heuristic search planners that...
In the AIPS98 Planning Contest, the hsp planner showed that heuristic search planners can be competi...
AbstractIn the AIPS98 Planning Contest, the hsp planner showed that heuristic search planners can be...
This thesis explores limitations of heuristic search planning, and presents techniques to overcome t...
Planning deals with the task of finding an ordered set of actions that achieves some goals from an i...
This short paper provides a high-level description of the plan-ner CBP (Cost-Based Planner). CBP per...
Most modern heuristics for classical planning are specified in terms of minimizing the summed operat...
Oversubscription planning (OSP) is the problem of finding plans that maximize the utility value of t...
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 ...
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...
Oversubscription planning (OSP) appears in many real problems where nding a plan achieving all goa...
www.plg.inf.uc3m.es Abstract. Oversubscription planning (OSP) appears in many real problems where fi...
The problem of searching for a plan with cost at most equal to a given absolute bound has attracted ...
a domain-independent planning algorithm that implements the family of heuristic search planners that...
In the AIPS98 Planning Contest, the hsp planner showed that heuristic search planners can be competi...
AbstractIn the AIPS98 Planning Contest, the hsp planner showed that heuristic search planners can be...
This thesis explores limitations of heuristic search planning, and presents techniques to overcome t...
Planning deals with the task of finding an ordered set of actions that achieves some goals from an i...
This short paper provides a high-level description of the plan-ner CBP (Cost-Based Planner). CBP per...
Most modern heuristics for classical planning are specified in terms of minimizing the summed operat...
DOI
Add to ORKG