edoc

Oversubscription Planning as Classical Planning with Multiple Cost Functions

Katz, Michael and Keyder, Emil and Pommerening, Florian and Winterer, Dominik. (2019) Oversubscription Planning as Classical Planning with Multiple Cost Functions. In: Proceedings of the 29th International Conference on Automated Planning and Scheduling (ICAPS 2019), 29. pp. 237-245.

[img] PDF - Accepted Version
451Kb

Official URL: https://edoc.unibas.ch/74995/

Downloads: Statistics Overview

Abstract

The aim of classical planning is to minimize the summed cost of operators among those plans that achieve a fixed set of goals. Oversubscription planning (OSP), on the other hand, seeks to maximize the utility of the set of facts achieved by a plan, while keeping the cost of the plan at or below some specified bound. Here, we investigate the use of reformulations that yield planning problems with two separate cost functions, but no utilities, for solving OSP tasks. Such reformulations have also been proposed in the context of net-benefit planning, where the planner tries to maximize the difference between the utility achieved and the cost of the plan. One of our reformulations is adapted directly from that setting, while the other is novel. In both cases, they allow for easy adaptation of existing classical planning heuristics to the OSP problem within a simple branch and bound search. We validate our approach using state of the art admissible heuristics in this framework, and report our results.
Faculties and Departments:05 Faculty of Science > Departement Mathematik und Informatik > Informatik > Artificial Intelligence (Helmert)
UniBasel Contributors:Pommerening, Florian
Item Type:Conference or Workshop Item, refereed
Conference or workshop item Subtype:Conference Paper
Publisher:AAAI Press
e-ISSN:2334-0843
Note:Publication type according to Uni Basel Research Database: Conference paper
Language:English
Related URLs:
edoc DOI:
Last Modified:28 Jan 2020 09:54
Deposited On:28 Jan 2020 09:41

Repository Staff Only: item control page