Hierarchical Finite State Controllers for Generalized Planning
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence. Pages 3235-3240.
Abstract
Finite State Controllers (FSCs) are an effective way to represent sequential plans compactly. By imposing appropriate conditions on transitions, FSCs can also represent generalized plans that solve a range of planning problems from a given domain. In this paper we introduce the concept of hierarchical FSCs for planning by allowing controllers to call other controllers. We show that hierarchical FSCs can represent generalized plans more compactly than individual FSCs. Moreover, our call mechanism makes it possible to generate hierarchical FSCs in a modular fashion, or even to apply recursion. We also introduce a compilation that enables a classical planner to generate hierarchical FSCs that solve challenging generalized planning problems. The compilation takes as input a set of planning problems from a given domain and outputs a single classical planning problem, whose solution corresponds to a hierarchical FSC.
@inproceedings{ijcai2016p458,
title = {Hierarchical Finite State Controllers for Generalized Planning},
author = {Segovia-Aguas, Javier and Jiménez Celorrio, Sergio and Jonsson, Anders},
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 = {3235--3240},
year = {2016},
month = {7},
url = {https://ijcai.org/proceedings/2016/458},
}
TY - CPAPER TI - Hierarchical Finite State Controllers for Generalized Planning AU - Segovia-Aguas, Javier AU - Jiménez Celorrio, Sergio AU - Jonsson, Anders 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 - 3235 EP - 3240 UR - https://ijcai.org/proceedings/2016/458 ER -Copied
Machine-readable versions of this paper, for tools and AI agents: