CSE logo University of Washington Department of Computer Science & Engineering
 CSE 574 - Automated Planning Winter 2003
 

Welcome to the 574 Home Page.

Instructor: Dan Weld

[ Administrivia | Paper schedule | Project Ideas | Resources ]

Automated planning is one of the oldest areas in AI. We'll review all the major approaches (state-space search, partial-order planning, graphplan derivatives, SAT and CSP compilation, etc.) and discuss speedup techniques ranging from heuristic derivation to EBL and reachability analysis. Given this foundation, the course will focus on the two hottest areas of current research:

We'll evaluate the methods in the context of application domains ranging from NASA testbeds to the semantic web.

The course has two goals: covering the material from a number of influential and interesting papers on these topics, teaching you to synthesize material on a topic and lead a class discussion on it, and suggesting anumber of research projects suitable for quals or generals (in the past, several of these have led to AAAI, IJCAI or ICAPS papers).

Accordingly, the class will comprise two paper-related components:

  1. For each class, you will need to read one or two papers, prepare paper summaries (CSE551 style) by 11am the day of class, and come to class ready for discussion. Here are your instructions for reviewing papers.
  2. For one class, you will be responsible for reading a small set of papers, picking the one or two papers everybody else will read, and preparing material to lecture and guide discussion. Here are your guidelines for preparing for your lecture/discussion.

In addition, there will be a project component.


Administrivia

Class schedule: Tuesdays 1:30-2:50, Fridays 1:30-2:50, EE1 031
Office hours: Wednesdays, 10:00-11:00, 408 Sieg Hall

Your final grade will be assigned based on the following:


Paper Schedule

Date Topic Leader Slides
April 1 Introduction, administrivia Dan Weld slides
April 4 fundamentals: Graphplan Dan Weld slides
April 8 fundamentals: SATplan Dan Weld slides
April 11 fundamentals: Heuristics in state space Dan Weld slides
April 15 fundamentals: Refinement framework Dan Weld slides
April 18 fundamentals: Hands-on planning you None.
April 18 uncertainity: Markov Decision Processes No class No slides
April 22 uncertainity: Search in Belief Space Mausam slides
April 25 uncertainity: Invited Speaker Hugh Durrant-Whyte No slides
April 29 uncertainity: Planning Graph and Probability Dan slides
May 2 uncertainity: Stochastic Planning using Decision Diagrams Sumit Sanghai slides
May 6 uncertainity: Continuous Time and Resource Uncertainty Stefan Sigurdsson slides
May 9 uncertainity: Partially Observable MDPs Stanley Kok slides
May 13 uncertainity: Interleaved Planning and Execution Kevin Sikorski slides
May 16 incomplete information: Softbot Planning Christophe Bisciglia slides
May 20 incomplete information: Contingent Approach Tal Shaked slides
May 23 temporal planning: Partial-order approach Parag slides
May 27 temporal planning: Temporal Graphplan Dan slides
May 30 temporal planning: Forward Chaining Nan Li slides
June 3 temporal planning: Stochastic Planning Alex Yates slides
June 6 projects: Group Reports all TBD

 


Computer Science & Engineering Department
University of Washington
PO Box 352350
Seattle, WA 98195-2350 USA