Slides
| No. | Topic | Date | Slides |
|---|---|---|---|
| A1 | Organizational Matters | 19.09. | printer screen |
| A2 | What is Planning | 19.09. | printer screen |
| X1 | Hands-on 1 | 24.09. | printer screen |
| X2 | Hands-on 2 | 26.09. | printer screen |
| A3 | Transition Systems | 01.10. | printer screen |
| A4 | Propositional Planning Tasks | 01.10. | |
| A5 | Equivalent Operators and Normal Forms for Effects | 03.10. | |
| A6 | Positive Normal Form and STRIPS | 03.10. | |
| A7 | Invariants, Mutexes and Finite Domain Represenation | 08.10. | |
| B1 | Planning as Search | 08.10. | printer screen |
| B2 | Progression & Regression Search | 10.10. | printer screen |
| B3 | General Regression | 10.10. | printer screen |
| B4 | Practical Issues of Regression Search | 15.10. | printer screen |
| B5 | Complexity of Planning | 15.10. | printer screen |
| C1 | Delete Relaxation: Relaxed Planning Tasks | 17.10. | printer screen |
| C2 | Delete Relaxation: Properties of Relaxed Tasks | 17.10. | printer screen |
| C3 | Delete Relaxation: Hardness of Optimal Planning & AND/OR Graphs | 22.10. | printer screen |
| C4 | Delete Relaxation: Relaxed Task Graphs | 22.10. | printer screen |
| C5 | Delete Relaxation: hmax & hadd | 24.10. | printer screen |
| C6 | Delete Relaxation: Best Achievers & hFF | 24.10. | printer screen |
| D1 | Abstractions: Formal Definition and Heuristics | 29.10. | printer screen |
| D2 | Abstractions: Additive Abstractions | 29.10. | printer screen |
| D3 | Pattern Databases: Introduction | 31.10. | printer screen |
| D4 | Pattern Databases: Multiple Patterns | 31.10. | printer screen |
| D5 | Pattern Databases: Pattern Selection | 05.11. | printer screen |
| D6 | Merge-and-Shrink Abstractions: Synchronized Product | 05.11. | printer screen |
| D7 | M&S: Generic Algorithm and Heuristic Properties | 07.11. | printer screen |
| D8 | M&S: Strategies and Label Reduction | 07.11. | printer screen |
| E1 | Landmarks: MHS & Uniform Cost Partitioning Heuristic | 12.11. | printer screen |
| E2 | Landmarks: Cut Landmarks & LM-cut Heuristic | 12.11. | printer screen |
| E3 | Linear & Integer Programming | 14.11. | printer screen |
| E4 | Flow & Potential Heuristics | 14.11. | printer screen |
| E5 | Cost Partitioning: Definition, Properties, and Abstractions | 19.11. | printer screen |
| E6 | Cost Partitioning: Landmarks and Generalization | 19.11. | printer screen |
| F1 | Markov Decision Processes | 21.11. | printer screen |
| F2 | Policies & Compact Description | 21.11. | printer screen |
| F3 | Blind Methods: Policy Iteration | 26.11. | printer screen |
| F4 | Blind Methods: Value Iteration & Linear Programming | 26.11. | printer screen |
| F5 | Determinization | 28.11. | printer screen |
| F6 | Determinization-based Algorithms | 28.11. | printer screen |
| G1 | Heuristic Search: AO* & LAO* Part I | 03.12. | printer screen |
| G2 | Heuristic Search: AO* & LAO* Part II | 03.12. | printer screen |
| G3 | Heuristic Search: Real-Time Dynamic Programming | 05.12. | printer screen |
| G4 | Asymptotically Suboptimal Monte-Carlo Methods | 05.12. | printer screen |
| G5 | Monte-Carlo Tree Search: Framework | 10.12. | printer screen |
| G6 | Monte-Carlo Tree Search: Algorithms Part I | 12.12. | printer screen |
| G7 | Monte-Carlo Tree Search: Algorithms Part II | 12.12. | printer screen |
| G8 | Trial-based Heuristic Tree Search | 17.12. | printer screen |