Participation
Please register for the course to gain access to the Adam workspace.
Lecture Slides
| No. | Topic | Date | Slides |
|---|---|---|---|
| A1 | Organizational Matters | 16.09. | printer handout screen |
| A2 | What is Planning? | 16.09. | printer handout screen |
| A3 | Getting to Know a Planner | 21.09. | printer handout screen |
| B1 | Transition Systems and Propositional Logic | 21.09. | printer handout screen |
| B2 | Planning and Optimization | 23.09. | printer handout screen |
| B3 | Formal Definition of Planning | 23.09. | printer handout screen |
| B4 | Equivalent Operators and Normal Forms | 28.09. | printer handout screen |
| B5 | Positive Normal Form and STRIPS | 28.09. | printer handout screen |
| B6 | Computational Complexity of Planning: Background | 30.09. | printer handout screen |
| B7 | Computational Complexity of Planning: Results | 30.09. | printer handout screen |
| C1 | Overview of Classical Planning Algorithms (Part 1) | 05.10. | printer handout screen |
| C2 | Overview of Classical Planning Algorithms (Part 2) | 05.10. | printer handout screen |
| C3 | Progression and Regression Search | 07.10. | printer handout screen |
| C4 | General Regression | 07.10. | printer handout screen |
| C5 | SAT Planning: Core Idea and Sequential Encoding | 12.10. | printer handout screen |
| C6 | SAT Planning: Parallel Encoding | 12.10. | printer handout screen |
| C7 | Symbolic Search: Binary Decision Diagrams | 14.10. | printer handout screen |
| C8 | Symbolic Search: Full Algorithm | 14.10. | printer handout screen |
| D1 | Delete Relaxation: Relaxed Planning Tasks | 19.10. | printer handout screen |
| D2 | Delete Relaxation: Properties of Relaxed Planning Tasks | 19.10. | printer handout screen |
| D3 | Delete Relaxation: Finding Relaxed Plans | 21.10. | printer handout screen |
| D4 | Delete Relaxation: AND/OR Graphs | 21.10. | printer handout screen |
| All slides (up to and including D4) | printer handout screen |
Extra Material
| No. | Title | Files |
|---|---|---|
| B7 | Tom Bylander. The computational complexity of propositional STRIPS planning. Artificial Intelligence, 69(1-2), pp. 165-204, 1994. | |
| B7 | Hayyan Helal and Gerhard Lakemeyer. Simple Numeric Planning with Two Variables is Decidable. Proc. ECAI 2025, pp. 4881-4888, 2025. | |
| C2 | Jörg Hoffmann and Bernhard Nebel. The FF Planning System: Fast Plan Generation Through Heuristic Search. Journal of Artificial Intelligence Research, 14, pp. 253-302, 2001. | |
| C2 | Silvia Richter and Matthias Westphal. The LAMA planner: Guiding cost-based anytime planning with landmarks. Journal of Artificial Intelligence Research, 39, pp. 127-177, 2010. | |
| C3 | Martin Suda. Duality in STRIPS planning. arXiv:1304.0897v1 [cs.AI], 2013. | |
| C4 | Jussi Rintanen. Regression for Classical and Nondeterministic Planning. Proc. ECAI 2008, pp. 568-572, 2008. | |
| C6 | Jussi Rintanen, Keijo Heljanko, and Ilkka Niemelä. Planning as satisfiability: parallel plans and algorithms for plan search. Artificial Intelligence, 170(12-13), pp. 1031-1080, 2006. | |
| C8 | David Speck and Malte Helmert. On Performance Guarantees for Symbolic Search in Classical Planning. Proc. ECAI 2025, pp.4628-4636, 2025. | |
| C8 | Álvaro Torralba. Symbolic Search and Abstraction Heuristics for Cost-Optimal Planning. PhD thesis, 2015. | |
| C8 | David Speck, Jendrik Seipp, and Álvaro Torralba. Symbolic Search for Cost-Optimal Planning with Expressive Model Extensions. Journal of Artificial Intelligence Research, 82, pp. 1349–1405, 2025. |