A- A Unifying and Brand-Name-Free Introduction to Planning
B- Heuristic Search Planning: Models, Heuristics, and Algorithms
C- Computational Complexity of Planning and Expressiveness of Planning Formalisms
D- Pre-processing and Domain Analysis
E- Ordered Task Decomposition: Theory and Applications
F- Planning with time and resources
G- Planning as model checking
Each lecture includes 10-15 minutes for questions/discussions.
Badges and handouts will be given during the afternoon
of the 27th and the morning of the 28th.
13:00-14:30, Lunch
14:30-16:00, Course D -
1st part
16:00-16:15, Coffee break
16:15-17:45, Course E
- 1st part
12:45-14:30, Lunch
14:30-16:00, Course D -
2nd part
16:00-16:15,
Coffee break
16:15-17:45, Course E
- 2nd part
18:00-19-30, Posters and System demonstrations
20:00-...
School dinner
12:45-14:30, Lunch
14:30-16:00, Course G -
1st part
16:00-16:15, Coffee break
16:15-17:45, Course G
- 2nd part
Sunday October 1st
11:00-...
End-of-school BBQ-brunch