Participation
Please register for the course to gain access to the Adam workspace.
Lecture Slides
| No. | Topic | Date | Slides |
|---|---|---|---|
| A1 | Organizational Matters | 17.09. | printer handout screen |
| A2 | What is Planning? | 17.09. | printer handout screen |
| A3 | Getting to Know a Planner | 22.09. | printer handout screen |
| B1 | Transition Systems and Propositional Logic | 22.09. | printer handout screen |
| B2 | Introduction to Planning Tasks | 24.09. | printer handout screen |
| B3 | Formal Definition of Planning | 24.09. | printer handout screen |
| B4 | Equivalent Operators and Normal Forms | 29.09. | printer handout screen |
| B5 | Positive Normal Form and STRIPS | 29.09. | |
| B6 | Computational Complexity of Planning: Background | 01.10. | printer handout screen |
| B7 | Computational Complexity of Planning: Results | 01.10. | printer handout screen |
| C1 | Overview of Classical Planning Algorithms (Part 1) | 06.10. | printer handout screen |
| C2 | Overview of Classical Planning Algorithms (Part 2) | 06.10. | printer handout screen |
| C3 | Progression and Regression Search | 08.10. | printer handout screen |
| C4 | General Regression | 08.10. | printer handout screen |
| All slides (up to and including C4) | 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, to appear. | |
| C1 | 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. | |
| C1 | 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. |