Participation
Please register for the course to gain access to the Adam workspace. We will present details on the course format in the first meeting on Sep. 21.
| No. | Topic | Date | Slides |
|---|---|---|---|
| A1 | Organizational Matters | 21.09. | printer screen |
| A2 | What is Planning? | 21.09. | printer screen |
| A3 | Getting to Know a Planner | 26.09. | printer screen |
| B1 | Transition Systems and Propositional Logic | 26.09. | printer screen |
| B2 | State Variables, Operators and Effects | 28.09. | printer screen |
| B3 | Operator Examples and Planning Tasks | 28.09. | printer screen |
| B4 | Equivalent Operators and Normal Forms | 03.10. | printer screen |
| B5 | Positive Normal Form and STRIPS | 03.10. | printer screen |
| B6 | Computational Complexity of Planning | 05.10. | printer screen |
| C1 | Overview of Classical Planning Algorithms | 05.10. | printer screen |
| C2 | Progression and Regression Search | 10.10. | printer screen |
| C3 | General Regression | 10.10. | printer screen |
| C4 | SAT Planning: Core Idea and Sequential Encoding | 12.10. | printer screen |
| C5 | SAT Planning: Parallel Encoding | 12.10. | printer screen |
| C6 | Symbolic Search: Binary Decision Diagrams | 17.10. | printer screen |
| C7 | Symbolic Search: Full Algorithm | 17.10. | printer screen |
| D1 | Delete Relaxation: Relaxed Planning Tasks | 19.10. | printer screen |
| D2 | Delete Relaxation: Properties of Relaxed Planning Tasks | 19.10. | printer screen |
| D3 | Delete Relaxation: Finding Relaxed Plans | 24.10. | printer screen |
| D4 | Delete Relaxation: AND/OR Graphs | 24.10. | printer screen |
| D5 | Delete Relaxation: Relaxed Task Graphs | 26.10. | printer screen |
| D6 | Delete Relaxation: hmax and hadd | 26.10. | printer screen |
| D7 | Delete Relaxation: Best Achievers, hFF and Comparison | 31.10. | printer screen |
| E1 | Planning Tasks in Finite-Domain Representation | 02.11. | printer screen |
| E2 | Invariants and Mutexes | 02.11. | printer screen |
| E3 | Abstractions: Introduction | 07.11. | printer screen |
| E4 | Abstractions: Formal Definition and Heuristics | 07.11. | printer screen |
| E5 | Abstractions: Additive Abstractions | 09.11. | printer screen |
| E6 | Pattern Databases: Introduction | 09.11. | printer screen |
| E7 | Pattern Databases: Multiple Patterns | 14.11. | printer screen |
| E8 | Pattern Databases: Pattern Selection | 14.11. | printer screen |
| E9 | Merge-and-Shrink: Factored Transition Systems | 16.11. | printer screen |
| E10 | Merge-and-Shrink: Algorithm | 16.11. | printer screen |
| E11 | Merge-and-Shrink: Properties and Shrinking Strategies | 21.11. | printer screen |
| E12 | Merge-and-Shrink: Merging Strategies and Label Reduction | 21.11. | printer screen |
| F1 | Critical Path Heuristics: hm | 23.11. | printer screen |
| F2 | Critical Path Heuristics: Properties and Πm Compilation | 23.11. | printer screen |
| G1 | Constraints: Introduction | 28.11. | printer screen |
| G2 | Landmarks: RTG Landmarks | 28.11. | printer screen |
| G3 | Landmarks: Orderings & LM-Count Heuristic | 30.11. | printer screen |
| G4 | Landmarks: Minimum Hitting Set Heuristic | 30.11. | printer screen |
| G5 | Cut Landmarks & LM-Cut Heuristic | 05.12. | printer screen |
| G6 | Linear & Integer Programming | 05.12. | printer screen |
| G7 | Cost Partitioning | 07.12. | printer screen |
| G8 | Optimal and General Cost-Partitioning | 07.12. | printer screen |
| G9 | Post-hoc Optimization | 12.12. | printer screen |
| G10 | Network Flow Heuristics | 12.12. | printer screen |
| G11 | Operator Counting | 14.12. | printer screen |
| G12 | Potential Heuristics | 14.12. | printer screen |
Self-tests
| No. | Date | Files |
|---|---|---|
| 01 | 19.10. |