University of Massachusetts Amherst
Department of Computer Science

 

 

CS 791AP

Advanced Topics in Automated Planning

Fall 2010

 

Siddharth Srivastava and Shlomo Zilberstein

 


Tentative Schedule


  Date   Topic, Discussion Leader, References
  PART I: Introduction
9/8/10 Historical overview, action and plan representations, STRIPS (Shlomo Zilberstein)
Reading: [Newell & Simon, 1961] [Nau, 2007]
Supplemental Refs: [Fikes & Nilsson, 1971] [McCarthy & Hayes, 1969]
9/15/10 Representation and complexity of planning (Siddharth Srivastava)
Reading: [Bylander, 1994] [Helmert, 2003]
Supplemental Refs: [Rintanen, 2005] [Slides from ICAPS-09 Summer School: Helmert, 2009]
  PART II: Modern Planning Techniques
9/22/10 Nonlinear planning (Hee-Tae Jung)
Reading: [McAllester & Rosenblitt, 1991]
Partial-order planning (Eric Ssebanakitta)
Reading: [Penberthy & Weld, 1992]
Supplemental Refs: [Weld, 1994] [Nguyen & Kambhampati, 2001]
9/29/10 Graphplan I (Katerina Marazopoulou )
Reading: [Blum & Furst, 1997]
Supplemental Refs: [Koehler et al., 1997]
SATplan I (Thomas Rossi)
Reading: [Kautz & Selman, 1992]
Supplemental Refs: [Ernst, Millstein & Weld, 1997]
10/6/10 Graphplan II (Xiaojian Wu)
Reading: [Do & Kambhampati, 2000]
SATplan II (William Yeoh )
Reading: [Kautz & Selman, 1999]
Supplemental Refs: [Kautz & Selman, 1996]
10/13/10 Planning as heuristic search (Xiaojian Wu)
Reading: [Haslum & Geffner, 2000]
Supplemental Refs: [Bonet & Geffner, 2001] [Helmert, Haslum & Hoffmann, 2007] [Hoffmann & Nebel, 2001]
Contingent planning (Heather Conboy )
Reading: [Bonet & Geffner, 2000]
Supplemental Refs: [Peot & Smith, 1992] [Bryce & Kambhampati, 2005] [Hoffmann & Brafman, 2005]
10/20/10 Strong cyclic planning (Akshat Kumar)
Reading: [Cimatti et al., 1998]
Supplemental Refs: [Cimatti et al., 2003] [Giunchiglia & Traverso, 1999]
Heuristic search in stochastic domains (Shlomo Zilberstein )
Reading: [Hansen & Zilberstein, 2001]
  PART III: Plan Generalization and Reuse
10/27/10 The problem of plan reuse (Eric Ssebanakitta)
Reading: Sections 1 and 8 from [Srivastava, Immerman & Zilberstein, 2010]
Supplemental Refs: [Fikes, Hart & Nilsson, 1972] [Shavlik, 1990]
Using control knowledge in planning (Hee-Tae Jung)
Reading: [Baier et al., 2007]
Supplemental Refs: [Yoon, Fern & Givan, 2008]
11/3/10 Loops as constructs for generalizing plans
Learning from Examples (Katerina Marazopoulou)
Reading: [Winner & Veloso, 2007]
Controller Synthesis (Akshat Kumar)
Reading: [Bonet, Palacios & Geffner, 2009]
Supplemental Refs: [Levesque, 2005] [Winner & Veloso, 2003]
11/17/10 Generalizing MDPs (Guest Speaker: Roni Khardon, Tufts University)
Reading: [Wang, Joshi & Khardon, 2008]
Supplemental Refs: [Boutilier, Reiter & Price, 2001]
11/24/10 Termination and correctness of loops (Thomas Rossi)
Reading: [Cook, Podelski & Rybalchenko, 2006]
Supplemental Refs: [Podelski & Rybalchenko, 2003]
Abstraction in model checking (Huong Phan)
Reading: [Henzinger et al., 2002]
Supplemental Refs: [Sagiv, Reps & Wilhelm, 2002]
12/1/10 Correctness and applicability of generalized plans with loops (Siddharth Srivastava)
Reading: [Srivastava, Immerman & Zilberstein, 2010]
Constructing reliable generalized plans with loops (Siddharth Srivastava)
Reading: [Srivastava, Immerman & Zilberstein, 2010]
Supplemental Refs: [Srivastava, Immerman & Zilberstein, 2008]
12/8/10 Composing services using planning (Heather Conboy)
Reading: [Pistore, Traverso & Bertoli, 2005]
Supplemental Refs: [Bertoli, Pistore & Traverso, 2010]
Programming by demonstration (Huong Phan)
Reading: [Lau et al., 2003]


2010 Siddharth Srivastava & Shlomo Zilberstein