CMSC 722, AI Planning - Spring 2008

Dana Nau

Lecture notes and tentative schedule

I'll update this repeatedly as we go along.

  • Jan 29
    • Chapter 1: Introduction [pdf, ppt]
    • Chapter 2: Representations for Classical Planning [pdf, ppt]
  • Jan 31
    • Finish Chapter 2
    • Chapter 3: Complexity of Classical Planning [pdf, ppt]
  • Feb 5
    • Discuss homework for Chapter 2
    • Finish Chapter 3
    • Chapter 4: State-Space Planning [pdf, ppt]
  • Feb 7:
    • Lecture by Ugur Kuter; below is his version of the lecture notes
    • Chapter 5: Plan-Space Planning [pdf, ppt]
  • Feb 11
  • Feb 12:
    • Lecture by Ugur Kuter; below is his version of the lecture notes
    • Chapter 6: Planning-Graph Techniques [pdf, ppt]
  • Feb 14
    • Discuss homework for Chapters 2, 3 and 4
    • discuss term projects [pdf, ppt]
  • Feb 19
    • Discuss homework for Chapter 5 and 6
    • Chapter 7: Propositional Satisfiability Techniques [pdf, ppt]
  • Feb 21
    • Finish Chapter 7
    • Chapter 16: Planning based on Markov Decision Processes [pdf, ppt]
  • Feb 26
    • Finish Chapter 16
    • Chapter 17: Planning based on Model Checking [pdf, ppt]
  • Feb 28
    • Discuss homework for Chapter 7
    • Finish Chapter 17
  • Mar 4
    • Discuss homework for Chapter 16
    • Intro to Part 3 [pdf, ppt]
    • Chapter 9: Heuristics in Planning [pdf] [ppt]
  • Mar 6
    • Research proposals due at noon
    • Discuss homework for Chapter 17
    • Finish Chapter 9
    • Chapter 10: Control Rules in Planning [pdf, ppt]
  • Mar 7
    • Late proposals (5% off) due at noon
  • Mar 11
    • proposal presentations:
      • Teoh & Fuchs
      • Raboin
      • King & Gregory
  • Mar 13
    • proposal presentations
      • Turpie & Fess
      • Cheng & Hu
    • discuss homework for Chapter 9
  • Mar 17-21
    • spring break
  • Mar 25
    • Review for midterm exam [pdf, ppt]
  • Mar 27
  • Apr 1
    • Chapter 10: Control Rules in Planning [pdf, ppt]
    • Lecture by Ugur Kuter (I'll be out of town)
  • Apr 3
    • Chapter 11: Hierarchical Task Network Planning [pdf, ppt]
  • Apr 8
    • Chapter 23: Planning in the Game of Bridge [pdf] [ppt]
    • Chapter 14 section 14.3: planning with chronicles [pdf] [ppt]
  • Apr 10
    • discuss homework for Chapter 10
    • continue Chapter 14 section 14.3
  • Apr 15
    • Finish Chapter 14 section 14.3
  • Apr 17
    • Chapter 15: Planning and Resource Scheduling [pdf, ppt]
  • Apr 22
    • finish Chapter 15
    • Discuss homework for Chapter 11
  • Apr 24
    • Chapter 20: Planning in Robotics [pdf, ppt]
  • Apr 29
    • Discuss homework for Chapters 14 and 15
    • Planning in multi-agent environments [pdf, ppt]
  • May 1
    • review for final exam [pdf, ppt]
  • May 4 (Sunday)
    • term projects due by noon
  • May 6
    • late projects (5% off) due by noon
    • term-project presentations
  • May 8
    • term-project presentation
  • May 13
    • no class, I'll be out of town
  • May 21, 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:
    • 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