===== Lecture plan 2023/2024 =====

**All lectures are in KN:E-301 (K9) each Monday 9:15–10:45.**

^ Lecture ^ Date ^ Contents ^ Materials ^
| 1. | 19/2 | Introduction to Automated Planning / PDDL |  |
| 2. | 26/2 | Heuristic Search Algorithms |  |
| 3. | 4/3 | STRIPS, FDR, Delete Relaxation |  |
| 4. | 11/3 | Heuristics $h^{\mathsf{max}}$, $h^{\mathsf{add}}$ |  |
| 5. | 18/3 | Heuristic $h^{\mathsf{ff}}$, Abstractions, Action Landmarks | |
| 6. | 25/3 | LM-Cut Heuristic | |
| 7. | 1/4 | No lecture | Eastern | 
| 8. | 8/4 | No lecture | I am not in Prague |
| 9. | 15/4 | Pattern databases | |
| 10. | 22/4 | LP-based heuristics | |
| 11. | 29/4 | Stochastic shortest path | |
| 12. | 6/5 | Heuristics for SSP | |

The lecture will be mostly organized as an old-style chalk-blackboard lecture without slides. I will try to maintain lecture notes that can be found [[https://drive.google.com/file/d/1-0G8-neNw1uKdwqm0eQkyCQA4-ic_4Bh/view?usp=sharing|here]].


Old recorded lectures are available at [[https://www.youtube.com/playlist?list=PLQL6z4JeTTQll4teTGNcK7fzbpg1ZssIR|PUI playlist]].

/*
^ Lecture ^ Date ^ Lecturer ^ Contents ^ Materials ^
| 1. | 20/2 | Antonín Komenda | Introduction to Automated Planning / Motivation | [[https://docs.google.com/presentation/d/1801HI6JXHGoZiUJ7rE1Tq78h55FcWRlWrfPq9jRTNOQ/edit?usp=sharing|Presentation (animated)]], {{ :courses:pui:pu1-intro.pdf |Presentation}}  |
| 2. | 27/2 | Antonín Komenda | Planning Problem Formulations |  {{ :courses:pui:pui2-representations.pdf |Presentation}}|
| 3. | 6/3 | Antonín Komenda | Search | {{ :courses:pui:pui3.pdf | Presentation}} |
| 4. | 13/3 | Jan Dolejší | Invited lecture - Practically Used Automated Planning   |  {{ :courses:pui:ai_planning_-_fel_cvut_-_2023-03-13.pptx |Presentation}} |
| 5. | 20/3 | Antonín Komenda | Relaxation Heuristics |{{ :courses:pui:pui05.pdf |Presentation}} |
| 6. | 27/3 | Antonín Komenda  | Landmarks | {{ :courses:pui:pui6.pdf |Presentation}} |
| 7. | 3/4 | Antonín Komenda  | Potential Heuristics and Abstractions | {{ :courses:pui:pui7a.pdf |Presentation 1}}, {{ :courses:pui:pui7b.pdf |Presentation 2}} |
| 8. | <del>10/4</del> | | Easter Monday |  |
| 9. | 17/4 |Stefan Edelkamp | Nondeterministic Planning, MCTS | {{ :courses:pui:np.pdf |Nondeterministic Planning}}{{ :courses:pui:mcts.pdf | MCTS}} |
| 10. | 24/4  |  Stefan Edelkamp | Probabilistic Planning |{{ :courses:pui:pp.pdf |Probabilistic Planning}} |
| 11. | 4/5 | Stefan Edelkamp   | Temporal Planning | {{ :courses:pui:tp.pdf | Temporal Planning}} |
| 12. | 9/5 | Stefan Edelkamp   | Preferences, SAT and Symbolic Planning  | {{ :courses:pui:tp.pdf | Preferences}} {{ :courses:pui:cp.pdf | SAT and Symbolic Planning}} |
| 13. | 15/5 | Stefan Edelkamp  | Planning in Robotics | {{ :courses:pui:rob.pdf | Planning in Robotics}} |
| 14. | 22/5 | Stefan Edelkamp, Antonín Komenda | Neuro-Symbolic Planning and Exam  | {{ :courses:pui:planning_in_neural_networks_and_pui_exam_2023.pdf | Neuro-Symbolic Planning and Revision}}|
*/

/*
===== Older resources – Carmel Domshlak=====

^ Obsah ^ Materiály ^ Video ^
| Planning as general problem solving, \\ descriptive problem specification.|{{:courses:a4m33pah:01-intro.pdf|1}} | [[http://webdav.agents.fel.cvut.cz/data/teaching/pah/lectures/lectures_older/lecture1_web.avi| 1]]|
| Planning as heuristic search with domain-independent heuristics \\  -- delete relaxation based heuristics\\ -- abstraction based heuristics |{{:courses:a4m33pah:02-search.pdf|2}}|[[http://webdav.agents.fel.cvut.cz/data/teaching/pah/lectures/lectures_older/lecture2a_web.avi|2a]] \\ [[http://webdav.agents.fel.cvut.cz/data/teaching/pah/lectures/lectures_older/lecture2b_web.avi|2b]] \\ [[http://webdav.agents.fel.cvut.cz/data/teaching/pah/lectures/lectures_older/lecture2c_web.avi|2c]]|
| Planning as SAT |{{:courses:a4m33pah:03-relaxation.pdf|3}}| [[http://webdav.agents.fel.cvut.cz/data/teaching/pah/lectures/lectures_older/lecture3a_web.avi|3a]] \\ [[http://webdav.agents.fel.cvut.cz/data/teaching/pah/lectures/lectures_older/lecture3b_web.avi|3b]] \\ [[http://webdav.agents.fel.cvut.cz/data/teaching/pah/lectures/lectures_older/lecture3c_web.avi|3c]] |
| Partial order planning \\  -- plan-space search (variants of the POP algorithm)\\ -- partial-order planning via CSP | {{:courses:a4m33pah:04-abstraction.pdf|3}}| [[http://webdav.agents.fel.cvut.cz/data/teaching/pah/lectures/lectures_older/lecture4a_web.avi|4a]] \\ [[http://webdav.agents.fel.cvut.cz/data/teaching/pah/lectures/lectures_older/lecture4b_web.avi|4b]] \\ [[http://webdav.agents.fel.cvut.cz/data/teaching/pah/lectures/lectures_older/lecture4c_web.avi|4c]] |
| Partial order planning \\  -- plan-space search (variants of the POP algorithm)\\ -- partial-order planning via CSP |{{:courses:a4m33pah:05-planning-sat.pdf|4}}\\  {{:courses:a4m33pah:06-pocl.pdf|5}} |[[http://webdav.agents.fel.cvut.cz/data/teaching/pah/lectures/lectures_older/lecture5a_web.avi|5a]] \\ [[http://webdav.agents.fel.cvut.cz/data/teaching/pah/lectures/lectures_older/lecture5b_web.avi|5b]] \\ [[http://webdav.agents.fel.cvut.cz/data/teaching/pah/lectures/lectures_older/lecture5c_web.avi|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/]]
*/