Additive Counterexample-Guided Cartesian Abstraction Refinement

Jendrik Seipp, Malte Helmert

Abstract

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.
BibTeX
@inproceedings{seipp2013additive,
  author = {Jendrik Seipp and Malte Helmert},
  title = {{Additive Counterexample-Guided Cartesian Abstraction Refinement}},
  booktitle = {AAAI Conference on Artificial Intelligence},
  year = {2013},
}

Loading related content...

Figure