CMSC 722, AI Planning - Fall 2009

Dana Nau

Lecture notes and tentative schedule

This will be updated as we go along.

  • Sept 1
    • Chapter 1: Introduction [pdf, ppt]
    • Chapter 2: Representations for Classical Planning [pdf, ppt]
  • Sept 3
    • Finish Chapter 2
    • Chapter 3: Complexity of Classical Planning [pdf, ppt]
    • Discuss term projects [pdf, ppt]
  • Sept 8 - Dr. Ugur Kuter
    • Chapter 4: State-Space Planning [pdf, ppt]
    • Start Chapter 5: Plan-Space Planning [pdf, ppt]
  • Sept 10 - Dr. Ugur Kuter
    • Discuss homework for Chapters 2 and 3
    • Finish Chapter 5
  • Sept 15 - Dr. Ugur Kuter
    • Discuss homework for Chapter 4
    • Start Chapter 6: Planning-Graph Techniques [pdf, ppt]
  • Sept 17 - Dr. Ugur Kuter
    • Discuss homework for Chapter 5
    • Finish Chapter 6
  • Sept 22 - Dr. Ugur Kuter
    • Chapter 7: Propositional Satisfiability Techniques [pdf, ppt]
  • Sept 24
    • Do you have groups for your term projects yet?
    • Discuss homework for Chapter 6
    • Start Chapter 16: Planning on MDPs [pdf, ppt]
  • Sept 29
    • Discuss homework for Chapter 7
    • Finish Chapter 16
  • Oct 1
    • Chapter 17: Planning as Model Checking [pdf, ppt]
  • Oct 6
    • Discuss homework for Chapter 16
    • Intro to Part 3 [pdf, ppt]
    • Chapter 9: Heuristics in Planning [pdf] [ppt]
  • Oct 8
    • Term-project proposals due at noon
    • Discuss homework for Chapter 17
    • Finish Chapter 9
    • Start Chapter 10: Control Rules in Planning [pdf, ppt]
  • Oct 13
    • Late proposals (5% off) due at noon
    • proposal presentations:
      • Vikas Shivashankar and Rajiv Jain
      • Arijit Biswas, Ke Zhai and Teng Long
      • Benjamin Teitler and Srividya Ramaswamy
  • Oct 15
    • proposal presentation:
      • Angela Noh and Youngil Kim
    • Jon Kleinberg's talk at 4pm
  • Oct 20
    • proposal presentations:
      • Emre Sefer and Jaymit Patel
      • Awalin Sopan and Chanhyun Kang
      • Sanjiv Dinakar and Wikum Dinalankara
  • Oct 22
    • discuss homework for Chapters 6 and 9
  • Oct 27
    • Review for midterm exam [pdf, ppt]
  • Oct 29
    • midterm exam
    • See the private page for examples of previous exams
  • Nov 3
    • Finish Chapter 10: Control Rules in Planning [pdf, ppt]
    • Start Chapter 11: Hierarchical Task Network Planning [pdf, ppt]
  • Nov 5
    • Finish Chapter 11
    • Chapter 23: Planning in the Game of Bridge [pdf, ppt]
  • Nov 10
    • hand back exams
    • finish Chapter 23
  • Nov 12
    • How to run experiments [pdf, ppt]
    • discuss homework for Chapter 10
    • Chapter 14 section 14.3: planning with chronicles [pdf, ppt]
  • Nov 17
    • Discuss homework for Chapter 11
    • continue Chapter 14 section 14.3
  • Nov 19
    • finish Chapter 14
  • Nov 24
    • Chapter 15: Planning and Resource Scheduling [pdf, ppt]
  • Nov 26 (Thanksgiving) - no class
  • Dec 1
    • Finish Chapter 15
    • Discuss homework for Chapter 14
    • Start review for final exam [pdf, ppt]
  • Dec 2 (Wednesday) - term projects due by noon
  • Dec 3
    • late projects (5% off) due by noon
    • term-project presentations:
      • Vikas Shivashankar and Rajiv Jain
      • Arijit Biswas, Ke Zhai and Teng Long
      • Angela Noh and Youngil Kim
  • Dec 8
    • term-project presentations:
      • Emre Sefer and Jaymit Patel
      • Awalin Sopan and Chanhyun Kang
      • Benjamin Teitler and Srividya Ramaswamy
  • Dec 10
    • term-project presentation:
      • Sanjiv Dinakar and Wikum Dinalankara
    • discuss homework for Chapter 15
    • finish review for the final exam
  • Dec 19, 10:30-12:30

Links

Homework assignments

Please start each homework assignment when I finish the
corresponding chapter. I'll discuss the answers in class
about a week later.

  • Chapter 2: 2.2, 2.6, 2.11, 2.12
  • Chapter 3: 3.5
  • Chapter 4: 4.4, 4.10, 4.14, 4.20
  • Chapter 5: 5.7, 5.8
  • Chapter 6: 6.2, 6.4, and the following question:
    • In the book, Graphplan uses only positive
      literals, but in my presentation I used both
      positive and negative literals. Resolve the
      apparent inconsistency.
  • Chapter 7: 7.2
  • Chapter 9: 9.1, 9.6
    • In 9.1, compute h from the initial state, and
      ignore what it says about the planning graph
  • Chapter 10: 10.3, 10.8, 10.9
  • Chapter 11: 11.1, 11.15, 11.22, 11.23
  • Chapter 14: 14.9, 14.11
  • Chapter 15: 15.1
  • Chapter 16: 16.6, 16.8
  • Chapter 17: 17.2, 17.4