{"type":"ScholarlyArticle","title":"Correlation Complexity of Classical Planning Domains","authors":[{"name":"Jendrik Seipp","slug":"jendrik-seipp","given":"Jendrik","family":"Seipp","affiliation":""},{"name":"Florian Pommerening","slug":"florian-pommerening","given":"Florian","family":"Pommerening","affiliation":""},{"name":"Gabriele Röger","slug":"gabriele-roger","given":"Gabriele","family":"Röger","affiliation":""},{"name":"Malte Helmert","slug":"malte-helmert","given":"Malte","family":"Helmert","affiliation":""}],"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.","doi":null,"url":"https://ijcai.org/proceedings/2016/459","pdf":"https://ijcai.org/proceedings/2016/0459.pdf","markdown":"https://ijcai.org/proceedings/2016/459.md","bibtex":"https://ijcai.org/proceedings/2016/bibtex/459","volume":{"slug":"2016","title":"Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2016","url":"https://ijcai.org/proceedings/2016/","year":2016,"location":"New York, NY, USA","dates":"9–15 July 2016","editors":"Subbarao Kambhampati","isbn":"978-1-57735-770-4; 978-1-57735-771-1","publisher":"AAAI Press / International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":null,"track":"","number":459,"pages":{"first":3242,"last":3249},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}