Applicability conditions for plans with loops: Computability results and algorithms

Siddharth Srivastava, Neil Immerman, Shlomo Zilberstein

Research output: Contribution to journalArticle

4 Scopus citations

Abstract

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.

Original languageEnglish (US)
Pages (from-to)1-19
Number of pages19
JournalArtificial Intelligence
Volume191-192
DOIs
StatePublished - Nov 1 2012
Externally publishedYes

Keywords

  • Automated planning
  • Generalized planning
  • Plan verification
  • Plans with loops
  • Reachability in abacus programs

ASJC Scopus subject areas

  • Language and Linguistics
  • Linguistics and Language
  • Artificial Intelligence

Fingerprint Dive into the research topics of 'Applicability conditions for plans with loops: Computability results and algorithms'. Together they form a unique fingerprint.

Cite this