Benchmark suite for oversubscription planning. The benchmarks were created in a similar fashion to the procedure described by Domshlak and Mirkis (2015), based on the collection of classical International Planning Competition (IPC) domains. The bounds are set to 25%, 50%, 75%, or 100% of the best known solution cost for the classical planning task obtained from planning.domains (Muise 2016). Each goal in the original problem has a utility of 10 and a randomly chosen 5% of the facts have a uniformly distributed integer utility in the range [1, 5]. For more details, see: Michael Katz, Emil Keyder, Florian Pommerening and Dominik Winterer. Oversubscription Planning as Classical Planning with Multiple Cost Functions. In Proceedings of the 29...
Automated planning is known to be computationally hard in the general case. Propositional planning i...
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...
Benchmark suite for oversubscription planning. The benchmarks were created in a similar fashion to ...
In a field of research about general reasoning mechanisms, it is essential to have appropriate bench...
In a field of research about general reasoning mechanisms, it is essential to have appropriate bench...
When given a plan by a satisficing planner, it is usually not intuitive as to how close it is to the...
Oversubscription planning is the problem of choosing an action sequence which reaches a state with a...
The international planning competition (IPC) is an important driver for planning research. The gener...
The international planning competition (IPC) is an important driver for planning research. The gene...
While cost-optimal planning aims at finding one best quality plan, top-k planning deals with finding...
While in classical planning the objective is to achieve one of the equally attractive goal states at...
Abstract. For many classical planning domains, the computationalcomplexity of non-optimal and optima...
In deterministic oversubscription planning, the objective is to achieve an as valuable as possible s...
After a 3 years gap, the 2011 edition of the IPC involved a total of 55 planners, some of them vers...
Automated planning is known to be computationally hard in the general case. Propositional planning i...
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...
Benchmark suite for oversubscription planning. The benchmarks were created in a similar fashion to ...
In a field of research about general reasoning mechanisms, it is essential to have appropriate bench...
In a field of research about general reasoning mechanisms, it is essential to have appropriate bench...
When given a plan by a satisficing planner, it is usually not intuitive as to how close it is to the...
Oversubscription planning is the problem of choosing an action sequence which reaches a state with a...
The international planning competition (IPC) is an important driver for planning research. The gener...
The international planning competition (IPC) is an important driver for planning research. The gene...
While cost-optimal planning aims at finding one best quality plan, top-k planning deals with finding...
While in classical planning the objective is to achieve one of the equally attractive goal states at...
Abstract. For many classical planning domains, the computationalcomplexity of non-optimal and optima...
In deterministic oversubscription planning, the objective is to achieve an as valuable as possible s...
After a 3 years gap, the 2011 edition of the IPC involved a total of 55 planners, some of them vers...
Automated planning is known to be computationally hard in the general case. Propositional planning i...
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...