Uni-Logo

Principles of AI Planning - Lectures

No. Date Topic Slides
1. Wed, Oct. 19, 2016 Introduction (Screen) (Print) (Print; 4-on-1)
2. Wed, Oct. 19, 2016
Fri, Oct. 21, 2016
Transition systems and planning tasks (Screen) (Print) (Print; 4-on-1)
3. Fri, Oct. 21, 2016
Wed, Oct. 26, 2016
Normal forms (Screen) (Print) (Print; 4-on-1)
4. Wed, Oct. 26, 2016 PDDL (Screen) (Print) (Print; 4-on-1)
5. Fri, Oct. 28, 2016
Wed, Nov. 2, 2016
Planning as search: progression and regression (Screen) (Print) (Print; 4-on-1)
6. Fri, Nov. 4, 2016
Wed, Nov. 9, 2016
Planning as search: search algorithms (Screen) (Print) (Print; 4-on-1)
7. Wed, Nov. 9, 2016
Fri, Nov. 11, 2016
Wed, Nov. 16, 2016
Planning as search: relaxed planning tasks (Screen) (Print) (Print; 4-on-1)
8. Wed, Nov. 16, 2016
Fri, Nov. 18, 2016
Wed, Nov. 23, 2016
Planning as search: relaxation heuristics (Screen) (Print) (Print; 4-on-1)
9. Fri, Nov. 25, 2016 Interlude: Finite-domain representation (Screen) (Print) (Print; 4-on-1)
10. Wed, Nov. 30, 2016
Fri, Dec. 2, 2016
Wed, Dec. 7, 2016
Planning as search: abstractions (Screen) (Print) (Print; 4-on-1)
11. Wed, Dec. 7, 2016
Fri, Dec. 9, 2016
Wed, Dec. 14, 2016
Planning as search: pattern database heuristics (Screen) (Print) (Print; 4-on-1)
12. Fri, Dec. 16, 2016
Wed, Dec. 21, 2016
Fri, Dec. 23, 2016
Planning with State-Dependent Action Costs (Screen) (Print) (Print; 4-on-1)
13. Wed, Jan. 11, 2017
Fri, Jan 13, 2017
Planning as search: the LM-cut heuristic (Screen) (Print) (Print; 4-on-1)
14. Fri, Jan. 13, 2017
Wed, Jan. 18, 2017
Planning as search: partial-order reduction (Screen) (Print) (Print; 4-on-1)
15. Wed, Jan. 18, 2017
Fri, Jan. 20, 2017
Nondeterministic planning (Screen) (Print) (Print; 4-on-1)
16. Fri, Jan. 20, 2017
Wed, Jan. 25, 2017
Fri, Jan. 27, 2017
Strong nondeterministic planning (Screen) (Print) (Print; 4-on-1)
17. Wed, Feb. 1, 2017
Fri, Feb. 3, 2017
Strong cyclic planning (Screen) (Print) (Print; 4-on-1)
18. Wed, Feb. 8, 2017 Computational complexity of classical planning (Screen) (Print) (Print; 4-on-1)
19. Wed, Feb. 8, 2017 Complexity of nondeterministic planning with full observability (Screen) (Print) (Print; 4-on-1)