| Tutorial | Date | Contents | Notes |
|---|---|---|---|
| 1. | 17/2 | PDDL Modeling | |
| 2. | 24/2 | Heuristic Search | Task Assignment - Assignment 1 |
| 3/3 | No lab | ||
| 3. | 10/3 | Propositional representation STRIPS, FDR | |
| 4. | 17/3 | Heuristics I (Relaxation Heuristics) | 17/3 - Deadline for Assignment 1 |
| 5. | 24/3 | Heuristics II (Fast forward and action landmarks) | Task Assignment - Assignment 2 |
| 6. | 31/3 | Heuristics III (LM-Cut) | |
| 7. | 7/4 | Heuristics IV (Pattern databases) | |
| 8. | 14/4 | Heuristics V - LP-based heuristics | |
| 21/4 | Easter Monday | ||
| 9. | 28/4 | Assignment consultations | |
| 10. | 5/5 | Stochastic Shortest Paths (SPP) | 5/5 - Deadline for Assignment 2 |
| 11. | 12/5 | Heuristics for SSP | |
| 12. | 19/5 | Let's prepare for exam! | Revision exercises |
Old tutorial recordings from 2021, when the course was fully online, can be found here. Note that they do not follow the current structure of the course. The provided recordings are in Czech.
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.