Proceedings

Correlation Complexity of Classical Planning Domains

Download BibTeX Cite

Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence. Pages 3242-3249.

Abstract

We analyze how complex a heuristic function must be to directly guide a state-space search algorithm towards the goal. As a case study, we examine functions that evaluate states with a weighted sum of state features. We measure the complexity of a domain by the complexity of the required features. We analyze conditions under which the search algorithm runs in polynomial time and show complexity results for several classical planning domains.

Jendrik Seipp, Florian Pommerening, Gabriele Röger, and Malte Helmert. 2016. Correlation Complexity of Classical Planning Domains. In Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI-16. IJCAI, 3242–3249. https://ijcai.org/proceedings/2016/459
Welcome Future Conferences AI Journal Division IJCAI Proceedings About IJCAI IJCAI Awards