""

Participation

Please register for the course to gain access to the Adam workspace.

Lecture Slides

No.TopicDateSlides
A1Organizational Matters16.09.printer
handout
screen
A2What is Planning?16.09.printer
handout
screen
A3Getting to Know a Planner21.09.printer
handout
screen
B1Transition Systems and Propositional Logic21.09.printer
handout
screen
B2Planning and Optimization23.09.printer
handout
screen
B3Formal Definition of Planning23.09.printer
handout
screen
B4Equivalent Operators and Normal Forms28.09.printer
handout
screen
B5Positive Normal Form and STRIPS28.09.printer
handout
screen
B6Computational Complexity of Planning: Background30.09.printer
handout
screen
B7Computational Complexity of Planning: Results30.09.printer
handout
screen
C1Overview of Classical Planning Algorithms (Part 1)05.10.printer
handout
screen
C2Overview of Classical Planning Algorithms (Part 2)05.10.printer
handout
screen
C3Progression and Regression Search07.10.printer
handout
screen
C4General Regression07.10.printer
handout
screen
C5SAT Planning: Core Idea and Sequential Encoding12.10.printer
handout
screen
C6SAT Planning: Parallel Encoding12.10.printer
handout
screen
C7Symbolic Search: Binary Decision Diagrams14.10.printer
handout
screen
C8Symbolic Search: Full Algorithm14.10.printer
handout
screen
D1Delete Relaxation: Relaxed Planning Tasks19.10.printer
handout
screen
D2Delete Relaxation: Properties of Relaxed Planning Tasks19.10.printer
handout
screen
D3Delete Relaxation: Finding Relaxed Plans21.10.printer
handout
screen
D4Delete Relaxation: AND/OR Graphs21.10.printer
handout
screen
D5Delete Relaxation: Relaxed Task Graphs26.10.printer
handout
screen
D6Delete Relaxation: hmax and hadd26.10.printer
handout
screen
D7Delete Relaxation: Analysis of hmax and hadd28.10.printer
handout
screen
D8Delete Relaxation: hFF and Comparison of Heuristics28.10.printer
handout
screen
E1Planning Tasks in Finite-Domain Representation02.11.printer
handout
screen
E2Invariants and Mutexes02.11.printer
handout
screen
E3Abstractions: Introduction04.11.printer
handout
screen
E4Abstractions: Formal Definition and Heuristics04.11.printer
handout
screen
E5Abstractions: Additive Abstractions09.11.printer
handout
screen
E6Pattern Databases: Introduction09.11.printer
handout
screen
E7Pattern Databases: Multiple Patterns11.11.printer
handout
screen
E8Pattern Databases: Pattern Selection11.11.printer
handout
screen
E9Merge-and-Shrink: Factored Transition Systems16.11.printer
handout
screen
E10Merge-and-Shrink: Algorithm16.11.printer
handout
screen
 All slides (up to and including E10) printer
handout
screen

Extra Material

No.TitleFiles
B7Tom Bylander. The computational complexity of propositional STRIPS planning. Artificial Intelligence, 69(1-2), pp. 165-204, 1994.PDF
B7Hayyan Helal and Gerhard Lakemeyer. Simple Numeric Planning with Two Variables is Decidable. Proc. ECAI 2025, pp. 4881-4888, 2025.PDF
C2/D8Jö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.PDF
C2Silvia Richter and Matthias Westphal. The LAMA planner: Guiding cost-based anytime planning with landmarks. Journal of Artificial Intelligence Research, 39, pp. 127-177, 2010.PDF
C3Martin Suda. Duality in STRIPS planning. arXiv:1304.0897v1 [cs.AI], 2013.PDF
C4Jussi Rintanen. Regression for Classical and Nondeterministic Planning. Proc. ECAI 2008, pp. 568-572, 2008.PDF
C6Jussi 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.PDF
C8David Speck and Malte Helmert. On Performance Guarantees for Symbolic Search in Classical Planning. Proc. ECAI 2025, pp.4628-4636, 2025.PDF
C8Álvaro Torralba. Symbolic Search and Abstraction Heuristics for Cost-Optimal Planning. PhD thesis, 2015.PDF
C8David 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.PDF
D6Blai Bonet and Hector Geffner. Planning as Heuristic Search. Artificial Intelligence, 129(1), pp. 5-33, 2001.PDF
D8Emil Keyder and Hector Geffner. Heuristics for Planning with Action Costs Revisited. ECAI 2008, pp. 588-592, 2008.PDF
E2Jussi Rintanen. An Iterative Algorithm for Synthesizing Invariants. Proc. AAAI 2000, pp. 806-811, 2000.PDF
E2Daniel Fišer and Antonín Komenda. Fact-Alternating Mutex Groups for Classical Planning. Journal of Artificial Intelligence Research, 61, pp. 475-521, 2018.PDF
E8Stefan Edelkamp. Planning with Pattern Databases. Proc. ECP 2001, pp. 84-90, 2001.PDF
E8Patrik Haslum, Blai Bonet and Héctor Geffner. New Admissible Heuristics for Domain-Independent Planning. Proc. AAAI 2005, pp. 1164-1168, 2005.PDF
E8Stefan Edelkamp. Automated Creation of Pattern Database Search Heuristics. Proc. MoChArt 2006, pp. 35-50, 2007.PDF
E8Patrik Haslum, Adi Botea, Malte Helmert, Blai Bonet and Sven Koenig. Domain-Independent Construction of Pattern Database Heuristics for Cost-Optimal Planning. Proc. AAAI 2007, pp. 1007-1012, 2007.PDF
E8Santiago Franco, Álvaro Torralba, Levi H. S. Lelis and Mike Barley. On Creating Complementary Pattern Databases. Proc. IJCAI 2017, pp. 4302-4309, 2017.PDF
To top