Graph-Based Factorization of Classical Planning Problems
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence. Pages 3286-3291.
Abstract
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.
@inproceedings{ijcai2016p465,
title = {Graph-Based Factorization of Classical Planning Problems},
author = {Wehrle, Martin and Sievers, Silvan and Helmert, Malte},
booktitle = {Proceedings of the Twenty-Fifth International Joint Conference on
Artificial Intelligence, {IJCAI-16}},
publisher = {AAAI Press / International Joint Conferences on Artificial Intelligence},
editor = {Subbarao Kambhampati},
pages = {3286--3291},
year = {2016},
month = {7},
url = {https://ijcai.org/proceedings/2016/465},
}
TY - CPAPER TI - Graph-Based Factorization of Classical Planning Problems AU - Wehrle, Martin AU - Sievers, Silvan AU - Helmert, Malte T2 - Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI-16 PB - AAAI Press / International Joint Conferences on Artificial Intelligence PY - 2016 SP - 3286 EP - 3291 UR - https://ijcai.org/proceedings/2016/465 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
