===== Tutorials plan 2023/2024 =====

^ Tutorial ^ Date ^ Contents ^ Notes ^ 
| 1.  | 19/2 | [[courses:pui:tutorials:tutorial01|PDDL Modeling]] |  | 
| 2.  | 26/2 | [[courses:pui:tutorials:tutorial02|Heuristic Search]] |  //[[courses:pui:assignments:assignment1-1|Task Assignment - Assignment 1]]// | 
| 3.  | 4/3 | [[courses:pui:tutorials:tutorial03|Propositional representation STRIPS, FDR]] |  | 
| 4.  | 11/3 | [[courses:pui:tutorials:tutorial04|Heuristics I (Relaxation Heuristics)]] | **17/3 - Deadline for Assignment 1** |
| 5.  | 18/3 | [[courses:pui:tutorials:tutorial05|Heuristics II (Fast forward and action landmarks)]] |  //[[courses:pui:assignments:assignment2|Task Assignment - Assignment 2]]// | 
| 6.  | 25/3 | [[courses:pui:tutorials:tutorial06|Heuristics III (LM-Cut)]] |  |
| 7.  | 1/4  | //**<fc #f4a460>Easter Monday</fc>**// | | 
| 8.  | 8/4  |**<fc #008080>Change of topic:</fc>** //Assignment consultations//| | 
| 9.  | 15/4 | **<fc #008080>Change of topic:</fc>** [[courses:pui:tutorials:tutorial09|Heuristics IV (Pattern databases)]] |  |
| 10. | 22/4 | [[courses:pui:tutorials:tutorial10|Heuristics V - LP-based heuristics]] |  **28/4 - Deadline for Assignment 2** |
| 11. | 29/4 | [[courses:pui:tutorials:tutorial11|Stochastic Shortest Paths (SPP)]] | |
| 12. | 6/5  | [[courses:pui:tutorials:tutorial12|Heuristics for SSP]] | |
| 13. | 13/5 | //**<fc #ffd952>Let's prepare for exam!</fc>**// | |
| 14. | 20/5 | //**<fc #ffd952>Let's prepare for exam!</fc>**// | |

//The tutorial plan may change during the semester based on the lectures.//
<note>
  * Notes on the Classical Planning part: {{ :courses:pui:notes-cp.pdf | notes-cp.pdf}} (updated 7. 4. 2020)
  * Notes on the Probabilistic planning tutorials: {{ :courses:pui:2018_tutorial_slides_2018.pdf | tutorial_slides_2018.pdf}}
</note>
/*
| 2.  | 27/2 | 1/3 | Michaela Urbanovská | Problem Representation, PDDL / Assignment 1 - PDDL handout | {{ :courses:pui:tutorial2.pdf | Presentation}}, [[https://pastebin.com/U5CfsptA|Slide-puzzle pastebin]] [[https://pastebin.com/DegvVmp6|Application of (next ?t1 ?t2) predicate for 4x4 grid]], {{ :courses:pui:tutorial2-pddls.zip | PDDLs from tutorial}} | [[https://forms.gle/SG5ni3X91dxfbjmD7|Feedback form]]| 
| 3.  | 6/3 | 8/3 | Michaela Urbanovská | Problem representations + Grounding / Assignment 1 - Grounding handout| {{ :courses:pui:pui_tutorial_3_23-4.pdf |Presentation}} | [[https://forms.gle/3WDPchmE3VuhwaKH6|Feedback form]]|  
| 4.  | 13/3 | 15/3 | Michaela Urbanovská  | Consultations for assignments |  | [[https://forms.gle/NTVNmy99pBu7PXux6|Feedback form]]| 
| 5.  | 20/3 | 22/3  | Michaela Urbanovská  | Relaxation Heuristics / Assignment 1 - Planner handout| {{ :courses:pui:pui_tutorial_5_23-1.pdf |Presentation}} |[[https://forms.gle/o4sBrVn31AZLfm5i9|Feedback form]] | 
| 6.  | 27/3 | 29/3 | Michaela Urbanovská  | LM-cut, hFF | {{ :courses:pui:pui_tutorial_6_23.pdf |Presentation}}, {{ :courses:pui:pui_tutorial_6_hff_example.pdf |hFF Example}} |[[https://forms.gle/Sk8ngCBdxTXvorWU9|Feedback form]] | 
| 7. | 3/4 | 5/4 | Michaela Urbanovská | Abstractions, LP Heuristics | {{ :courses:pui:pui_tutorial_7_23.pdf |Presentation}}, {{ :courses:pui:pui_ms_example_old.pdf | Merge & Shrink step-by-step example}}| [[https://forms.gle/JAAcKJqwLH2KWtyF8|Feedback form]]| 
| 8.  | <del>10/4</del> | 12/4 | Michaela Urbanovská | Assignment 1 Consultations + exercises | {{ :courses:pui:pui_tutorial_8_23.pdf |Presentation}} | [[https://forms.gle/auDHg1vKsUuDpXJm7|Feedback form]]| 
| 9.  | 17/4 | 19/4 | Jan Mrkos | Intro to MDPs |  {{ :courses:pui:pui_tutorial_9.pdf | Presentation}}, [[courses:pui:assignments:assignment2|Assignment #2]] |  | 
| 10.  | 26/4 | 28/4 | Jan Mrkos  | Value Iteration and Friends | {{ :courses:pui:pui_tutorial_10.pdf | Presentation}} |  | 
| 11. | <del>1/5</del>  4/5  | 3/5 | Jan Mrkos  | Simple Temporal Networks  | {{ :courses:pui:pui_tutorial_11.pdf | Presentation}} | |
| 12. | <del>8/5</del>  9/5 | <del>10/5</del> 17/5 | Jan Mrkos  | MCTS, UCT | {{ :courses:pui:pui_tutorial_12_mcts_2021.pdf | Presentation 2021}} |  | 
| 13. | 15/5 | 24/5  | Jan Mrkos  | Applications, revision, Assignment 2 deadline follows | | |
| 14. | 22/5 | 24/5 | Jan Mrkos  | Optional last-minute assignment 2 support group | | |
*/


==== English vs. Czech ====
  * The first tutorial (Mo 12:45-14:15, K-310) will be held in **English** (unless all students present are ok with Czech)
  * The second tutorial (Mo 14:30-16:00, K-310) will be held in **Czech** 

==== Recordings ====
We have decided to give you access to our tutorial recordings from 2021 when the course was fully online. The provided recordings are in Czech. 
^ Topic ^ Recording ^ 
| 1. | STRIPS, FDR | [[https://youtu.be/YOMto3D0UHc|recording]] |
| 2. | PDDL | [[https://youtu.be/h7sK8tTWfSI|recording]]|
| 3. | Relaxation heuristics | [[https://youtu.be/NdSSYmew6xU|recording]], [[https://youtu.be/tXTBS8ivZRY|Corrected h^add computation]]| 
| 4. | Landmark heuistics | [[https://youtu.be/PnRCrhEwLVo|recording]] | 
| 5. | LP based heuristics | [[https://youtu.be/tvHtP1WlCcU|recording]]|
| 6. | Exercises | [[https://youtu.be/LQphIZkOmLQ|recording]]|
| 7. | Abstraction heuristics | [[https://youtu.be/0-sRJB7sy8M|recording]]|
| 8. | Neural Planning + consultations | [[https://youtu.be/MuaImo6qJP0|recording]]|
| 9. | Intro to MDPs | [[https://youtu.be/nANrvKhrrA4|recording]]|
| 10. | Value Iteration and Friends | [[https://youtu.be/pJMXVflrgH0|recording]]|
| 11. | Simple Temporal Networks | [[https://youtu.be/UUuFvRdL6jw|recording]]|
| 12. | MCTS, UCT | [[https://youtu.be/6wc3Hbn9nGc|recording]]|

==== Planner ====

We recommend using the [[https://www.fast-downward.org/|Fast Downward]] planner for the experiments. You will also need it for the second homework assignment to translate planning tasks specified in PDDL to the FDR/SAS+ representation. The instructions on using prebuilt binaries can be found [[https://www.fast-downward.org/QuickStart|here]].

/*
  * {{:courses:pui:assignments:pah2015_planners.zip|planners}}
  * Pre-built for 64bit Ubuntu
  * Including sources (you may build them yourself)

  * More planners from IPC-2018: [[https://ipc2018-classical.bitbucket.io/#planners]]
  * Download the source code and switch to the right branch (ipc-2018-seq-opt for optimal track, ipc-2018-seq-sat for satisficing track)
  * Build the Singularity image: ''sudo singularity build planner.img path/to/Singularity''
  * Run it with PDDL files: ''singularity run -C -H path/to/rundir planner.img path/to/domain.pddl path/to/problem.pddl path/to/output.plan''

====Value iteration =====
Questions: [[https://goo.gl/forms/wvhKRQglRMvi0H7C3 | link]]

*/