courses:pui:lectures [CourseWare Wiki]

PUI lecture plan 2017/2018

All lectures are in KN:E-301 (K9) each Monday 9:15–10:45.

Lecture	Date	Lecturer	Contents	Materials
1.	19. 2.	Antonín Komenda	Introduction to automated planning (state-space search)	Introduction Models+Languages (1-33)
2.	26. 2.	Antonín Komenda	Classical planning for non-classical planning problems	Algorithms (34-82)
3.	5. 3.	Antonín Komenda	Relaxation heuristics	Relaxation Heuristics
4.	12. 3.	Antonín Komenda	Abstraction heuristics	Abstraction Heuristics
5.	19. 3.	Antonín Komenda	Implicit problem structure and structural heuristics	Landmark heuristics
6.	26. 3.	Michal Štolba	Heuristics using LP formulations	LP-based Heuristics
9.	2. 4.	-	~~Easter Monday~~
8.	9. 4.	Lukáš Chrpa	Modeling and reformulation	Modeling and reformulation
9.	16. 4.	Lukáš Chrpa	Plan-space search, temporal planning	Plan-space search Temporal planning
10.	23. 4.	Michal Štolba	Multi-Agent Planning	MAP
11.	30. 4.	Branislav Bošanský	Probabilistic Planning and MDP	pah_pp_mdp_2018.pdf
12.	7. 5.	Branislav Bošanský	MDP and MCTS	pah_mcts_2018.pdf
13.	14. 5.	Branislav Bošanský	POMDPs	pah_pomdp_2018.pdf pah-pomdp-tiger.pdf
14.	21. 5.	Branislav Bošanský	Recent Approximate Techniques for POMDPs

Obsah	Materiály	Video
Planning as general problem solving, descriptive problem specification.	1	1
Planning as heuristic search with domain-independent heuristics – delete relaxation based heuristics – abstraction based heuristics	2	2a 2b 2c
Planning as SAT	3	3a 3b 3c
Partial order planning – plan-space search (variants of the POP algorithm) – partial-order planning via CSP	3	4a 4b 4c
Partial order planning – plan-space search (variants of the POP algorithm) – partial-order planning via CSP	4 5	5a 5b 5c