2014 (English)In: The journal of artificial intelligence research, ISSN 1076-9757, Vol. 51, 255-291 p.Article in journal (Refereed) Published
Macros have long been used in planning to represent subsequences of operators. Macros can be used in place of individual operators during search, sometimes reducing the effort required to find a plan to the goal. Another use of macros is to compactly represent long plans. In this paper we introduce a novel solution concept called automaton plans in which plans are represented using hierarchies of automata. Automaton plans can be viewed as an extension of macros that enables parameterization and branching. We provide several examples that illustrate how automaton plans can be useful, both as a compact representation of exponentially long plans and as an alternative to sequential solutions in benchmark domains such as LOGISTICS and GRID. We also compare automaton plans to other compact plan representations from the literature, and find that automaton plans are strictly more expressive than macros, but strictly less expressive than HTNs and certain representations allowing efficient sequential access to the operators of the plan.
Place, publisher, year, edition, pages
AI ACCESS FOUNDATION , 2014. Vol. 51, 255-291 p.
Computer and Information Science
IdentifiersURN: urn:nbn:se:liu:diva-112193DOI: 10.1613/jair.4391ISI: 000343090300001OAI: oai:DiVA.org:liu-112193DiVA: diva2:764132