Computing applicability conditions for plans with loops

Siddharth Srivastava, Neil Immerman, Shlomo Zilberstein

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

8 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 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
Event20th International Conference on Automated Planning and Scheduling, ICAPS 2010 - Toronto, ON, Canada
Duration: May 12 2010May 16 2010

Publication series

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

Other

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

    Fingerprint

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). (ICAPS 2010 - Proceedings of the 20th International Conference on Automated Planning and Scheduling).