Things for this class
Lecture slides
I'll update these as we go along
- pdf, ppt: Chap. 1, Introduction
- pdf, ppt: Chap. 2, Representations for Classical Planning
- pdf, ppt: Chap. 3, Complexity of Classical Planning
- pdf, ppt: Chap. 4, State-Space Planning
- pdf, ppt: Chap. 5, Plan-Space Planning
- pdf, ppt: Chap. 6, Planning-Graph Techniques
- pdf, ppt: Chap. 7, Propositional Satisfiability Techniques
- pdf, ppt: Intro. to Part 3
- pdf, ppt: Chap. 9, Heuristics in Planning
- pdf, ppt: Chap. 10, Control Rules in Planning
- pdf, ppt: Chap. 11, Hierarchical Task Network Planning
- pdf, ppt: Chap. 14 sec. 14.3, Planning with Chronicles
- pdf, ppt: Chap. 15, Planning and Resource Scheduling
- pdf, ppt: Chap. 16, Planning on MDPs
- pdf, ppt: Chap. 17, Planning as Model Checking
Other links
Homework assignments
Please start each homework assignment when I finish the
corresponding chapter. We'll discuss the answers in class,
about a week later.
- Chapter 1: the assignment is at the end of the syllabus
- Chapter 2: 2.2, 2.6, 2.12
- Chapter 3: 3.5 (hint: see Section 4.5 of the book)
- Chapter 4: 4.4, 4.10,
(削除) 4.14 (削除ここまで), 4.20
- Chapter 5: 5.7, 5.8
- Chapter 6: 6.2, 6.4, and one more problem (see below)
- For 6.2(b), don't try to draw all of level 2. For level 2, just draw the non-maintenance actions, and tell what each of them is mutex to.
- Here's the third homework problem. 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
- Revised version of 9.1: Consider the planning problem in Example 6.1. In the initial state, compute the FastForward heuristic for each of the applicable actions.
- 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