TDDD48: Slides from 2019
3a: 004: Planning as Search – an overview of the general concepts
3b: 005: The Forward State Space – how it is constructed in general; some case studies
5b: A comparison of general search strategies applicable to all search spaces
6: Hierarchical Task Networks (early preparation for one of the labs).
Easter
7b: A simple goal count heuristic – demonstrating the concepts
11b: Performance results, planning competitions, portfolio planning
12: Path Planning
13-14: Planning under Uncertainty
TDDD48: Old slides from 2018
2a: TDDD48-2018-003-Classical-Planning-Problems-and-PDDL.pdf
2b/3: TDDD48-2018-004-Exploring-and-Searching-the-State-Space.pdf (starts during lecture 2, continues during lecture 3)
4-5, 12-13: TDDD48-2018-005-State-Space-Heuristics.pdf (preview 4)
12-13: Heuristics continued, see slides above
Page responsible: Jonas Kvarnstr�m
Last updated: 2022-03-30