Uni-Logo

Principles of AI Planning - Lectures

No. Date Topic Slides
1. Wed, Oct. 23, 2019 Introduction (Screen) (Print) (Print; 4-on-1)
2. Wed, Oct. 23, 2019
Fri, Oct. 25, 2019
Wed, Oct. 30, 2019
Transition systems and planning tasks (Screen) (Print) (Print; 4-on-1)
3. Wed, Oct. 30, 2019
Wed, Nov. 6, 2019
Normal forms (Screen) (Print) (Print; 4-on-1)
4. Wed, Nov. 6, 2019 PDDL (Screen) (Print) (Print; 4-on-1)
5. Wed, Nov. 6, 2019
Fri, Nov. 8, 2019
Wed, Nov. 13, 2019
Planning as search: progression and regression (Screen) (Print) (Print; 4-on-1)
6. Wed, Nov. 13, 2019
Fri, Nov. 15, 2019
Wed, Nov. 20, 2019
Planning as search: search algorithms (Screen) (Print) (Print; 4-on-1)
7. Wed, Nov. 20, 2019
Fri, Nov. 22, 2019
Wed, Nov. 27, 2019
Planning as search: relaxed planning tasks (Screen) (Print) (Print; 4-on-1)
8. Wed, Nov. 27, 2019
Fri, Nov. 29, 2019
Wed, Dec. 4, 2019
Planning as search: relaxation heuristics (Screen) (Print) (Print; 4-on-1)
9. Fri, Dec. 6, 2019 Interlude: Finite-domain representation (Screen) (Print) (Print; 4-on-1)
10. Wed, Dec. 11, 2019
Fri, Dec. 13, 2019
Wed, Dec. 18, 2019
Planning as search: abstractions (Screen) (Print) (Print; 4-on-1)
11. Wed, Dec. 18, 2019
Fri, Dec. 20, 2019
Planning as search: pattern database heuristics (Screen) (Print) (Print; 4-on-1)
12. Wed, Jan. 8, 2020 Planning as search: potential heuristics (Screen) (Print) (Print; 4-on-1)
13. Wed, Jan. 8, 2020
Fri, Jan. 10, 2020
Wed, Jan. 15, 2020
Planning as search: partial-order reduction (Screen) (Print) (Print; 4-on-1)
14. Wed, Jan. 15, 2020
Wed, Jan. 22, 2020
Planning with Binary Decision Diagrams (Screen) (Print) (Print; 4-on-1)
15. Wed, Jan. 22, 2020
Fri, Jan. 24, 2020
Wed, Jan. 29, 2020
Fri, Jan. 31, 2020
Planning with State-Dependent Action Costs (Screen) (Print) (Print; 4-on-1)
16. Wed, Feb. 5, 2020 Planning as SAT (Screen) (Print) (Print; 4-on-1)
17. Fri, Feb. 7, 2020 Nondeterministic planning (Screen) (Print) (Print; 4-on-1)
18. Wed, Feb. 12, 2020
Fri, Feb. 14, 2020
Strong nondeterministic planning (Screen) (Print) (Print; 4-on-1)