Abstraction Heuristics, Cost Partitioning and Network Flows

Book One

Volume

Proceedings of the International Conference on Automated Planning and Scheduling, 27

Main Track

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.

10.1609/icaps.v27i1.13806