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.TopicDateSlides
A1Organizational Matters21.09.printer
screen
A2What is Planning?21.09.printer
screen
A3Getting to Know a Planner26.09.printer
screen
B1Transition Systems and Propositional Logic26.09.printer
screen
B2State Variables, Operators and Effects28.09.printer
screen
B3Operator Examples and Planning Tasks28.09.printer
screen
B4Equivalent Operators and Normal Forms03.10.printer
screen
B5Positive Normal Form and STRIPS03.10.printer
screen
B6Computational Complexity of Planning05.10.printer
screen
C1Overview of Classical Planning Algorithms05.10.printer
screen
C2Progression and Regression Search10.10.printer
screen
C3General Regression10.10.printer
screen
C4SAT Planning: Core Idea and Sequential Encoding12.10.printer
screen
C5SAT Planning: Parallel Encoding12.10.printer
screen
C6Symbolic Search: Binary Decision Diagrams17.10.printer
screen
C7Symbolic Search: Full Algorithm17.10.printer
screen
D1Delete Relaxation: Relaxed Planning Tasks19.10.printer
screen
D2Delete Relaxation: Properties of Relaxed Planning Tasks19.10.printer
screen
D3Delete Relaxation: Finding Relaxed Plans24.10.printer
screen
D4Delete Relaxation: AND/OR Graphs24.10.printer
screen
D5Delete Relaxation: Relaxed Task Graphs26.10.printer
screen
D6Delete Relaxation: hmax and hadd26.10.printer
screen
D7Delete Relaxation: Best Achievers, hFF and Comparison31.10.printer
screen
E1Planning Tasks in Finite-Domain Representation02.11.printer
screen
E2Invariants and Mutexes02.11.printer
screen
E3Abstractions: Introduction07.11.printer
screen
E4Abstractions: Formal Definition and Heuristics07.11.printer
screen
E5Abstractions: Additive Abstractions09.11.printer
screen
E6Pattern Databases: Introduction09.11.printer
screen
E7Pattern Databases: Multiple Patterns14.11.printer
screen
E8Pattern Databases: Pattern Selection14.11.printer
screen
E9Merge-and-Shrink: Factored Transition Systems16.11.printer
screen
E10Merge-and-Shrink: Algorithm16.11.printer
screen
E11Merge-and-Shrink: Properties and Shrinking Strategies21.11.printer
screen
E12Merge-and-Shrink: Merging Strategies and Label Reduction21.11.printer
screen
F1Critical Path Heuristics: hm23.11.printer
screen
F2Critical Path Heuristics: Properties and Πm Compilation23.11.printer
screen
G1Constraints: Introduction28.11.printer
screen
G2Landmarks: RTG Landmarks28.11.printer
screen

Exercises

No.Due DateFiles
01October 03PDF, Vagrantfile, pddl-intro
02October 10PDF
03October 17PDF
04October 24PDF
05October 31PDF
06November 07PDF
07November 14PDF
08November 21PDF
09November 28PDF
10December 05PDF

 

Self-tests

No.DateFiles
0119.10.PDF