TY - JOUR
T1 - A new representation and associated algorithms for generalized planning
AU - Srivastava, Siddharth
AU - Immerman, Neil
AU - Zilberstein, Shlomo
N1 - Funding Information:
Support for this work was provided in part by the National Science Foundation under grants CCF-0541018, CCF-0830174, IIS-0535061 and IIS-0915071.
PY - 2011/2
Y1 - 2011/2
N2 - Constructing plans that can handle multiple problem instances is a longstanding open problem in AI. We present a framework for generalized planning that captures the notion of algorithm-like plans and unifies various approaches developed for addressing this problem. Using this framework, and building on the TVLA system for static analysis of programs, we develop a novel approach for computing generalizations of classical plans by identifying sequences of actions that will make measurable progress when placed in a loop. In a wide class of problems that we characterize formally in the paper, these methods allow us to find generalized plans with loops for solving problem instances of unbounded sizes and also to determine the correctness and applicability of the computed generalized plans. We demonstrate the scope and scalability of the proposed approach on a wide range of planning problems.
AB - Constructing plans that can handle multiple problem instances is a longstanding open problem in AI. We present a framework for generalized planning that captures the notion of algorithm-like plans and unifies various approaches developed for addressing this problem. Using this framework, and building on the TVLA system for static analysis of programs, we develop a novel approach for computing generalizations of classical plans by identifying sequences of actions that will make measurable progress when placed in a loop. In a wide class of problems that we characterize formally in the paper, these methods allow us to find generalized plans with loops for solving problem instances of unbounded sizes and also to determine the correctness and applicability of the computed generalized plans. We demonstrate the scope and scalability of the proposed approach on a wide range of planning problems.
KW - Automated planning
KW - Plan verification
KW - Plans with loops
UR - http://www.scopus.com/inward/record.url?scp=78650945131&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=78650945131&partnerID=8YFLogxK
U2 - 10.1016/j.artint.2010.10.006
DO - 10.1016/j.artint.2010.10.006
M3 - Article
AN - SCOPUS:78650945131
SN - 0004-3702
VL - 175
SP - 615
EP - 647
JO - Artificial Intelligence
JF - Artificial Intelligence
IS - 2
ER -