Proceedings

Getting the Most Out of Pattern Databases for Classical Planning

Download BibTeX Cite

Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence. Pages 2357-2363.

Abstract

The iPDB procedure by Haslum et al. is the state-of-the-art method for computing additive abstraction heuristics for domain-independent planning. It performs a hill-climbing search in the space of pattern collections, combining information from multiple patterns in the so-called canonical heuristic. We show how stronger heuristic estimates can be obtained through linear programming. An experimental evaluation demonstrates the strength of the new technique on the IPC benchmark suite.

Florian Pommerening, Gabriele Röger, and Malte Helmert. 2013. Getting the Most Out of Pattern Databases for Classical Planning. In Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence, IJCAI-13. IJCAI, 2357–2363. https://ijcai.org/proceedings/2013/347
Welcome Future Conferences AI Journal Division IJCAI Proceedings About IJCAI IJCAI Awards