Abstraction Heuristics, Cost Partitioning and Network Flows
DOI:
https://doi.org/10.1609/icaps.v27i1.13806Abstract
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.
Downloads
Published
2017-06-05
How to Cite
Pommerening, F., Helmert, M., & Bonet, B. (2017). Abstraction Heuristics, Cost Partitioning and Network Flows. Proceedings of the International Conference on Automated Planning and Scheduling, 27(1), 228-232. https://doi.org/10.1609/icaps.v27i1.13806
Issue
Section
Main Track