All lectures are in KN:E-301 (K9) each Monday 9:15–10:45.
Lecture | Date | Lecturer | Contents | Materials |
---|---|---|---|---|
1. | 20. 2. | Antonín Komenda | Introduction to automated planning (state-space search) | intro |
2. | 27. 2. | Antonín Komenda | Classical planning for non-classical planning problems | comp |
3. | 6. 3. | Antonín Komenda | Relaxation heuristics | relax |
4. | 13. 3. | Antonín Komenda | Implicit problem structure and structural heuristics | landm The LAMA Planner (paper) |
5. | 20. 3. | Antonín Komenda | Abstraction heuristics | abst merging/shrinking strategies (sl. 35-47) |
6. | 27. 3. | Antonín Komenda | Heuristics using LP formulations | lp |
7. | 3. 4. | Antonín Komenda | GraphPlan, Hierarchical Planning (plan-space search) | gp htn |
8. | 10. 4. | Antonín Komenda | Multi-agent Planning | dmap |
9. | 17. 4. | - | | |
10. | 24. 4. | Branislav Bošanský | Planning with uncertainty | |
11. | 2. 5. Tuesday | Branislav Bošanský | MDP and MCTS | |
12. | 11. 5. Thursday | Branislav Bošanský | Advanced MCTS | |
13. | 15. 5. | Branislav Bošanský | POMDPs | pdf tiger |
14. | 22. 5. | Branislav Bošanský | Recent Approximate Techniques for POMDPs |
Lecture | Date | Lecturer | Contents | Materials | Video |
---|---|---|---|---|---|
1. | 22. 2. | Antonín Komenda | Introduction to automated planning | intro | - |
2. | 29. 2. | Antonín Komenda | Classical planning for non-classical planning problems | comp | - |
3. | 7. 3. | Antonín Komenda | Relaxation heuristics | relax | - |
4. | 14. 3. | Antonín Komenda | Abstraction heuristics | abst merging/shrinking strategies (sl. 35-47) | - |
5. | 21. 3. | Antonín Komenda | Implicit problem structure and structural heuristics | landm The LAMA Planner (paper) | - |
6. | 28. 3. | - | | - | |
7. | 4. 4. | Antonín Komenda | GraphPlan | gp | - |
8. | 11. 4. | Antonín Komenda | Hierarchical Planning | htn | - |
9. | 18. 4. | Jan Faigl | Robot motion planning I | rmp1, rmp1-2x2, rmp1-3x3 | - |
10. | 25. 4. | Jan Faigl | Robot motion planning II | rmp2, rmp2-2x2, rmp2-3x3 | - |
11. | 2. 5. | Branislav Bošanský | Planning with uncertainty | - | |
12. | 9. 5. | Branislav Bošanský | MDP | - | |
13. | 16. 5. | Branislav Bošanský | Monte Carlo tree search | - | |
14. | 23. 5. | Branislav Bošanský | POMDP | pdf tiger | - |
Obsah | Materiály | Video |
---|---|---|
Planning as general problem solving, descriptive problem specification. | 1 | 1 |
Planning as heuristic search with domain-independent heuristics – delete relaxation based heuristics – abstraction based heuristics | 2 | 2a 2b 2c |
Planning as SAT | 3 | 3a 3b 3c |
Partial order planning – plan-space search (variants of the POP algorithm) – partial-order planning via CSP | 3 | 4a 4b 4c |
Partial order planning – plan-space search (variants of the POP algorithm) – partial-order planning via CSP | 4 5 | 5a 5b 5c |
PAH 2011/2012 lectures by Gerhard Wickler are available at http://webdav.agents.fel.cvut.cz/data/teaching/pah/lectures/lectures_older/2011/.
PAH 2012/2013 lectures by Carmel Domshlak are available at http://webdav.agents.fel.cvut.cz/data/teaching/pah/lectures/