Applicability conditions for plans with loops: Computability results and algorithms

Siddharth Srivastava, Neil Immerman, Shlomo Zilberstein

Research output: Contribution to journalArticle

4 Citations (Scopus)

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

Fingerprint

Planning
Processing
Computability
efficiency
planning
lack
community
Safety
Compactness
Correctness

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

Cite this

Applicability conditions for plans with loops : Computability results and algorithms. / Srivastava, Siddharth; Immerman, Neil; Zilberstein, Shlomo.

In: Artificial Intelligence, Vol. 191-192, 01.11.2012, p. 1-19.

Research output: Contribution to journalArticle

@article{34bca4721de84ad8a44aaf7e68951316,
title = "Applicability conditions for plans with loops: Computability results and algorithms",
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.",
keywords = "Automated planning, Generalized planning, Plan verification, Plans with loops, Reachability in abacus programs",
author = "Siddharth Srivastava and Neil Immerman and Shlomo Zilberstein",
year = "2012",
month = "11",
day = "1",
doi = "10.1016/j.artint.2012.07.005",
language = "English (US)",
volume = "191-192",
pages = "1--19",
journal = "Artificial Intelligence",
issn = "0004-3702",
publisher = "Elsevier",

}

TY - JOUR

T1 - Applicability conditions for plans with loops

T2 - Computability results and algorithms

AU - Srivastava, Siddharth

AU - Immerman, Neil

AU - Zilberstein, Shlomo

PY - 2012/11/1

Y1 - 2012/11/1

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

VL - 191-192

SP - 1

EP - 19

JO - Artificial Intelligence

JF - Artificial Intelligence

SN - 0004-3702

ER -