courses:be4m36pui:lectures [CourseWare Wiki]

Lecture plan 2020/2021

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

Lecture	Date	Lecturer	Contents	Materials
1.	15/2	Lukáš Chrpa, Stefan Edelkamp	Introduction to Automated Planning	Introduction to Automated Planning
2.	22/2	Lukáš Chrpa	Classical Planning and State-space Search	Classical Planning and State-space Search
3.	1/3	Lukáš Chrpa	Relaxation heuristics	Relaxation Heuristics
4.	8/3	Lukáš Chrpa	Landmarks and landmark heuristics	Landmarks and LM-cut
5.	15/3	Lukáš Chrpa	Heuristics using LP formulations, Planning Protfolios	Heuristics using LP formulations Planning Portfolios
6.	22/3	Lukáš Chrpa	Modeling and reformulation	Modeling and reformulation
7.	29/3	Lukáš Chrpa	Planning and Acting in Dynamic Environments	Planning and Acting in Dynamic Environments
8.	~~5/4~~	-	Easter Monday
9.	12/4	Stefan Edelkamp	Abstraction Heuristics	Abstraction Heuristics
10.	19/4	Stefan Edelkamp	Non-Deterministic & Probabilistic Planning	Nondeterministic Planning Probabilistic Planning
11.	26/4	Stefan Edelkamp	Temporal Planning	Temporal Planning and Preferences
12.	3/5	Stefan Edelkamp	MCTS (UCT, NRPA)	MCTS
13.	10/5	Stefan Edelkamp	Planning in Robotics and Games	MDPs POMDPs
14.	17/5	Stefan Edelkamp, Lukáš Chrpa	Revision	Revision

–

Lukáš Chrpa

Plan-space search, Planning for AUVs

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