Subset-Saturated Cost Partitioning for Optimal Classical Planning

Seipp, Jendrik and Helmert, Malte. (2019) Subset-Saturated Cost Partitioning for Optimal Classical Planning. In: Proceedings of the 29th International Conference on Automated Planning and Scheduling (ICAPS 2019). pp. 391-400.

[img] PDF - Accepted Version

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

Downloads: Statistics Overview


Cost partitioning is a method for admissibly adding multiple heuristics for state-space search. Saturated cost partitioning considers the given heuristics in sequence, assigning to each heuristic the minimum fraction of remaining costs that it needs to preserve its estimates for all states. We generalize saturated cost partitioning by allowing to preserve the heuristic values of only a subset of states and show that this often leads to stronger heuristics.
Faculties and Departments:05 Faculty of Science > Departement Mathematik und Informatik > Informatik > Artificial Intelligence (Helmert)
UniBasel Contributors:Seipp, Jendrik and Helmert, Malte
Item Type:Conference or Workshop Item, refereed
Conference or workshop item Subtype:Conference Paper
Publisher:AAAI Press
Note:Publication type according to Uni Basel Research Database: Conference paper
Related URLs:
edoc DOI:
Last Modified:30 Sep 2020 08:58
Deposited On:10 Mar 2020 13:30

Repository Staff Only: item control page