From non-negative to general operator cost partitioning

Pommerening, Florian and Helmert, Malte and Röger, Gabriele and Seipp, Jendrik. (2015) From non-negative to general operator cost partitioning. In: Proceedings of the 29th AAAI Conference on Artificial Intelligence (AAAI 2015) : January 25 –30, 2015, Austin, Texas, USA. Palo Alto, Calif., pp. 3335-3341.

[img] PDF - Published Version

Official URL: http://edoc.unibas.ch/dok/A6373454

Downloads: Statistics Overview


Operator cost partitioning is a well-known technique to make admissible heuristics additive by distributing the operator costs among individual heuristics. Planning tasks are usually defined with non-negative operator costs and therefore it appears natural to demand the same for the distributed costs. We argue that this requirement is not necessary and demonstrate the benefit of using general cost partitioning. We show that LP heuristics for operator-counting constraints are cost-partitioned heuristics and that the state equation heuristic computes a cost partitioning over atomic projections. We also introduce a new family of potential heuristics and show their relationship to general cost partitioning.
Faculties and Departments:05 Faculty of Science > Departement Mathematik und Informatik > Informatik > Artificial Intelligence (Helmert)
UniBasel Contributors:Pommerening, Florian and Helmert, Malte and Röger, Gabriele and Seipp, Jendrik
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:16 Oct 2018 14:07
Deposited On:05 Jun 2015 08:52

Repository Staff Only: item control page