AAAI Publications, Twenty-Seventh International Conference on Automated Planning and Scheduling

Font Size: 
A Comparison of Cost Partitioning Algorithms for Optimal Classical Planning
Jendrik Seipp, Thomas Keller, Malte Helmert

Last modified: 2017-06-05


Cost partitioning is a general and principled approach for constructing additive admissible heuristics for state-space search. Cost partitioning approaches for optimal classical planning include optimal cost partitioning, uniform cost partitioning, zero-one cost partitioning, saturated cost partitioning, post-hoc optimization and the canonical heuristic for pattern databases. We compare these algorithms theoretically, showing that saturated cost partitioning dominates greedy zero-one cost partitioning. As a side effect of our analysis, we obtain a new cost partitioning algorithm dominating uniform cost partitioning. We also evaluate these algorithms experimentally on pattern databases, Cartesian abstractions and landmark heuristics, showing that saturated cost partitioning is usually the method of choice on the IPC benchmark suite.

Full Text: PDF