Abstraction Heuristics, Cost Partitioning and Network Flows

Pommerening, Florian and Helmert, Malte and Bonet, Blai. (2017) Abstraction Heuristics, Cost Partitioning and Network Flows. In: Proceedings of the 27th International Conference on Automated Planning and Scheduling (ICAPS 2017).

[img] PDF - Published Version

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

Downloads: Statistics Overview


Cost partitioning is a well-known technique to make admissible heuristics for classical planning additive. The optimal cost partitioning of explicit-state abstraction heuristics can be computed in polynomial time with a linear program, but the size of the model is often prohibitive. We study this model from a dual perspective and develop several simplification rules to reduce its size. We use these rules to answer open questions about extensions of the state equation heuristic and their relation to cost partitioning.
Faculties and Departments:05 Faculty of Science > Departement Mathematik und Informatik > Informatik > Artificial Intelligence (Helmert)
UniBasel Contributors:Pommerening, Florian 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:09 Feb 2018 14:12
Deposited On:09 Feb 2018 14:12

Repository Staff Only: item control page