Tutorial | Date | Contents | Notes |
---|---|---|---|
1. | 19/2 | PDDL Modeling | |
2. | 26/2 | Heuristic Search | Task Assignment - Assignment 1 |
3. | 4/3 | Propositional representation STRIPS, FDR | |
4. | 11/3 | Heuristics I (Relaxation Heuristics) | 17/3 - Deadline for Assignment 1 |
5. | 18/3 | Heuristics II (Fast forward and action landmarks) | Task Assignment - Assignment 2 |
6. | 25/3 | Heuristics III (LM-Cut) | |
7. | 1/4 | Easter Monday | |
8. | 8/4 | Change of topic: Assignment consultations | |
9. | 15/4 | Change of topic: Heuristics IV (Pattern databases) | |
10. | 22/4 | Heuristics V - LP-based heuristics | 28/4 - Deadline for Assignment 2 |
11. | 29/4 | Stochastic Shortest Paths (SPP) | |
12. | 6/5 | Heuristics for SSP | |
13. | 13/5 | Let's prepare for exam! | |
14. | 20/5 | Let's prepare for exam! |
The tutorial plan may change during the semester based on the lectures.
We have decided to give you access to our tutorial recordings from 2021 when the course was fully online. The provided recordings are in Czech.
Topic | Recording | |
---|---|---|
1. | STRIPS, FDR | recording |
2. | PDDL | recording |
3. | Relaxation heuristics | recording, Corrected h^add computation |
4. | Landmark heuistics | recording |
5. | LP based heuristics | recording |
6. | Exercises | recording |
7. | Abstraction heuristics | recording |
8. | Neural Planning + consultations | recording |
9. | Intro to MDPs | recording |
10. | Value Iteration and Friends | recording |
11. | Simple Temporal Networks | recording |
12. | MCTS, UCT | recording |
We recommend using the Fast Downward planner for the experiments. You will also need it for the second homework assignment to translate planning tasks specified in PDDL to the FDR/SAS+ representation. The instructions on using prebuilt binaries can be found here.