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