Finding Plans with Branches, Loops and Preconditions

Siddharth Srivastava, Neil Immerman, and Shlomo Zilberstein. Finding Plans with Branches, Loops and Preconditions. Proceedings of the ICAPS 2009 Workshop on Verification and Validation of Planning and Scheduling Systems, Thessaloniki, Greece, 2009.

Abstract

We present a new approach for finding conditional plans with loops and branches for planning in situations with uncertainty in state properties as well as in object quantities. We use a state abstraction technique from static analysis of programs to builds such plans incrementally using generalizations of input example plans generated by classical planners. Preconditions of the resulting plans with loops are computed by analyzing the changes in the counts of objects of different types across each loop. The scope and scalability of this approach are demonstrated using experimental results on common benchmark domains.

Bibtex entry:

@inproceedings{SIZicaps09ws2,
  author	= {Siddharth Srivastava and Neil Immerman and Shlomo Zilberstein},
  title		= {Finding Plans with Branches, Loops and Preconditions},
  booktitle     = {Proceedings of the {ICAPS} Workshop on Verification and 
                   Validation of Planning and Scheduling Systems},
  year		= {2009},
  pages		= {},
  address       = {Thessaloniki, Greece},
  url		= {http://rbr.cs.umass.edu/shlomo/papers/SIZicaps09ws2.html}
}

shlomo@cs.umass.edu