Computing Applicability Conditions for Plans with Loops

Siddharth Srivastava, Neil Immerman, and Shlomo Zilberstein. Computing Applicability Conditions for Plans with Loops. Proceedings of the International Conference on Automated Planning and Scheduling (ICAPS), 161-168, Toronto, Canada, 2010.

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.

Bibtex entry:

@inproceedings{SIZicaps10,
  author	= {Siddharth Srivastava and Neil Immerman and Shlomo Zilberstein}
  title		= {Computing Applicability Conditions for Plans with Loops},
  booktitle     = {Proceedings of the International Conference on Automated Planning
                   and Scheduling},
  year		= {2010},
  pages		= {161-168},
  address       = {Toronto, Canada},
  url		= {http://rbr.cs.umass.edu/shlomo/papers/SIZicaps10.html}
}

shlomo@cs.umass.edu