TY - JOUR
T1 - Applicability conditions for plans with loops
T2 - Computability results and algorithms
AU - Srivastava, Siddharth
AU - Immerman, Neil
AU - Zilberstein, Shlomo
N1 - Funding Information:
We thank the anonymous reviewers for their detailed and helpful comments. Support for this work was provided in part by the National Science Foundation under grants IIS-0915071, CCF-0830174 and CCF-1115448.
PY - 2012/11
Y1 - 2012/11
N2 - The utility of including loops in plans has been long recognized by the planning community. Loops in a plan help increase both its applicability and the compactness of its representation. However, progress in finding such plans has been limited largely due to lack of methods for reasoning about the correctness and safety properties of loops of actions. We present novel algorithms for determining the applicability and progress made by a general class of loops of actions. These methods can be used for directing the search for plans with loops towards greater applicability while guaranteeing termination, as well as in post-processing of computed plans to precisely characterize their applicability. Experimental results demonstrate the efficiency of these algorithms. We also discuss the factors which can make the problem of determining applicability conditions for plans with loops incomputable.
AB - The utility of including loops in plans has been long recognized by the planning community. Loops in a plan help increase both its applicability and the compactness of its representation. However, progress in finding such plans has been limited largely due to lack of methods for reasoning about the correctness and safety properties of loops of actions. We present novel algorithms for determining the applicability and progress made by a general class of loops of actions. These methods can be used for directing the search for plans with loops towards greater applicability while guaranteeing termination, as well as in post-processing of computed plans to precisely characterize their applicability. Experimental results demonstrate the efficiency of these algorithms. We also discuss the factors which can make the problem of determining applicability conditions for plans with loops incomputable.
KW - Automated planning
KW - Generalized planning
KW - Plan verification
KW - Plans with loops
KW - Reachability in abacus programs
UR - http://www.scopus.com/inward/record.url?scp=84864802322&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84864802322&partnerID=8YFLogxK
U2 - 10.1016/j.artint.2012.07.005
DO - 10.1016/j.artint.2012.07.005
M3 - Article
AN - SCOPUS:84864802322
SN - 0004-3702
VL - 191-192
SP - 1
EP - 19
JO - Artificial Intelligence
JF - Artificial Intelligence
ER -