Graph-Based Factorization of Classical Planning Problems

Wehrle, Martin and Sievers, Silvan and Helmert, Malte. (2016) Graph-Based Factorization of Classical Planning Problems. In: Proceedings of the 25th International Joint Conference on Artificial Intelligence (IJCAI 2016), 4. Palo Alto, California, pp. 3286-3292.

PDF - Published Version

Official URL: http://edoc.unibas.ch/45242/

Downloads: Statistics Overview


In domain-independent planning, dependencies of operators and variables often prevent the effective application of planning techniques that rely on loosely coupled problems (like factored planning or partial order reduction). In this paper, we propose a generic approach for factorizing a classical planning problem into an equivalent problem with fewer operator and variable dependencies. Our approach is based on variable factorization, which can be reduced to the well-studied problem of graph factorization. While the state spaces of the original and the factorized problems are isomorphic, the factorization offers the potential to exponentially reduce the complexity of planning techniques like factored planning and partial order reduction.
Faculties and Departments:05 Faculty of Science > Departement Mathematik und Informatik > Informatik > Artificial Intelligence (Helmert)
UniBasel Contributors:Wehrle, Martin and Sievers, Silvan and Helmert, Malte
Item Type:Conference or Workshop Item, refereed
Conference or workshop item Subtype:Conference Paper
Publisher:AAAI Press
Note:Publication type according to Uni Basel Research Database: Conference paper
Related URLs:
edoc DOI:
Last Modified:27 Nov 2018 14:29
Deposited On:11 Oct 2017 09:44

Repository Staff Only: item control page