AAAI Publications, Workshops at the Twenty-Seventh AAAI Conference on Artificial Intelligence

Font Size: 
Additive Counterexample-Guided Cartesian Abstraction Refinement
Jendrik Seipp, Malte Helmert

Last modified: 2013-06-29


We recently showed how counterexample-guided abstraction refinement can be used to derive informative heuristics for optimal classical planning. In this work we introduce an algorithm for building additive abstractions and demonstrate that they outperform other state-of-the-art abstraction heuristics on many benchmark domains.


classical planning, abstraction heuristics, cost-partitioning

Full Text: PDF