TDDD48 Automated planning (6 ECTS)

Vt2 2012

Additional slides will be made available incrementally.

• 1. Introduction: 9-per-page, 2-per-page
• 2. Classical planning and PDDL, both parts: 9-per-page, 2-per-page.
• 3. Forward state space search: 9-per-page, 2-per-page.
• 4. Complexity: 9-per-page, 2-per-page.
• 5. Intro to Domain-Configurable Planning: 9-per-page, 2-per-page.
• 6. Hierarchical Task Networks (preliminary version due to PDF problems): 1-per-page
• 7. Planning with Control Rules: 9-per-page, 2-per-page.
• 8. Backward State Space Search: 9-per-page, 2-per-page.
• 9. Partial-Order Planning: 9-per-page, 2-per-page.
• 10. Planning Graphs: 9-per-page, 2-per-page.
• 11. Planning as Satisfiability: 9-per-page, 2-per-page.
• 12. Planning under uncertainty with MDPs: 9-per-page, 2-per-page.
• 13. Heuristics, part 1: 9-per-page, 2-per-page.
• 14. Heuristics, part 2: 9-per-page, 2-per-page.
• 15. Execution Monitoring: 9-per-page, 2-per-page.
• 16. Path Planning: 9-per-page, 2-per-page.

Page responsible: Jonas Kvarnström
Last updated: 2012-05-15