Computing applicability conditions for plans with loops

Siddharth Srivastava, Neil Immerman, Shlomo Zilberstein

Research output: Chapter in Book/Report/Conference proceedingConference contribution

8 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 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.

Original languageEnglish (US)
Title of host publicationICAPS 2010 - Proceedings of the 20th International Conference on Automated Planning and Scheduling
Pages161-168
Number of pages8
StatePublished - Dec 31 2010
Externally publishedYes
Event20th International Conference on Automated Planning and Scheduling, ICAPS 2010 - Toronto, ON, Canada
Duration: May 12 2010May 16 2010

Other

Other20th International Conference on Automated Planning and Scheduling, ICAPS 2010
CountryCanada
CityToronto, ON
Period5/12/105/16/10

Fingerprint

Safety
Community planning
Compactness
Termination

ASJC Scopus subject areas

  • Strategy and Management

Cite this

Srivastava, S., Immerman, N., & Zilberstein, S. (2010). Computing applicability conditions for plans with loops. In ICAPS 2010 - Proceedings of the 20th International Conference on Automated Planning and Scheduling (pp. 161-168)

Computing applicability conditions for plans with loops. / Srivastava, Siddharth; Immerman, Neil; Zilberstein, Shlomo.

ICAPS 2010 - Proceedings of the 20th International Conference on Automated Planning and Scheduling. 2010. p. 161-168.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Srivastava, S, Immerman, N & Zilberstein, S 2010, Computing applicability conditions for plans with loops. in ICAPS 2010 - Proceedings of the 20th International Conference on Automated Planning and Scheduling. pp. 161-168, 20th International Conference on Automated Planning and Scheduling, ICAPS 2010, Toronto, ON, Canada, 5/12/10.
Srivastava S, Immerman N, Zilberstein S. Computing applicability conditions for plans with loops. In ICAPS 2010 - Proceedings of the 20th International Conference on Automated Planning and Scheduling. 2010. p. 161-168
Srivastava, Siddharth ; Immerman, Neil ; Zilberstein, Shlomo. / Computing applicability conditions for plans with loops. ICAPS 2010 - Proceedings of the 20th International Conference on Automated Planning and Scheduling. 2010. pp. 161-168
@inproceedings{63ca9cc4d5644687963b1c74f2fb8028,
title = "Computing applicability conditions for plans with loops",
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 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.",
author = "Siddharth Srivastava and Neil Immerman and Shlomo Zilberstein",
year = "2010",
month = "12",
day = "31",
language = "English (US)",
isbn = "9781577354499",
pages = "161--168",
booktitle = "ICAPS 2010 - Proceedings of the 20th International Conference on Automated Planning and Scheduling",

}

TY - GEN

T1 - Computing applicability conditions for plans with loops

AU - Srivastava, Siddharth

AU - Immerman, Neil

AU - Zilberstein, Shlomo

PY - 2010/12/31

Y1 - 2010/12/31

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 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.

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 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.

UR - http://www.scopus.com/inward/record.url?scp=78650605112&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=78650605112&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:78650605112

SN - 9781577354499

SP - 161

EP - 168

BT - ICAPS 2010 - Proceedings of the 20th International Conference on Automated Planning and Scheduling

ER -