===== Tutorials plan 2021/2022 =====

^ Lecture ^ Date (Mo/EN) ^ Date (We/CZ) ^ Lecturer ^ Contents ^ Assignments ^ Feedback form ^ Recording ^
| 1.  | 14/2 | 16/2 | Michaela Urbanovská | STRIPS, FDR | {{ :courses:be4m36pui:PUI_tutorial_1.pdf | Presentation }} | [[https://docs.google.com/forms/d/1W4cFIMAFhl4CXlAK9ase13If5q5gmmHeZHe4OatR_4w/edit?usp=sharing|feedback]]| [[https://youtu.be/YOMto3D0UHc|recording]] |
| 2.  | 21/2 | 23/2 | Michaela Urbanovská | PDDL / Assignment 1 handout | {{ :courses:be4m36pui:PUI_tutorial_2.pdf | Presentation }} | [[https://forms.gle/WXn9r6z4zSAC9YZc6|feedback]]| [[https://youtu.be/h7sK8tTWfSI|recording]]|
| 3.  | 28/2 | 2/3 | Michaela Urbanovská | Relaxation heuristics | {{ :courses:be4m36pui:PUI_tutorial_3.pdf | Presentation }} | [[https://forms.gle/RtqqvQoxRoidEQtg9|feedback]]| [[https://youtu.be/NdSSYmew6xU|recording]] [[https://youtu.be/tXTBS8ivZRY|h^add computation]]|
| 4.  | 7/3 | 9/3 | Michaela Urbanovská  | Landmark heuristics | {{ :courses:be4m36pui:PUI_tutorial_4.pdf | Presentation }}, {{ :courses:be4m36pui:tut-lm-cut.pdf | LM-Cut }} | [[https://forms.gle/Nhye66EWGfneKWu57|feedback]]| [[https://youtu.be/PnRCrhEwLVo|recording]]|
| 5.  | 14/3 | 16/3  | Michaela Urbanovská  | LP based heuristics | {{ :courses:be4m36pui:PUI_tutorial_5.pdf | Presentation }},{{ :courses:be4m36pui:tut-lp.pdf | LP-based heuristics }} |[[https://forms.gle/mRu5xbyNNPpAskEW9|feedback]] | [[https://youtu.be/tvHtP1WlCcU|recording]]|
| 6.  | 21/3 | 23/3 | Michaela Urbanovská  | Exercises | {{ :courses:be4m36pui:PUI_tutorial_6.pdf | Presentation }} | [[https://forms.gle/2PmGf7TCLjaLs9fS6|feedback]]| [[https://youtu.be/LQphIZkOmLQ|recording]]|
| 7. | 28/3 | 30/3 | Michaela Urbanovská | Abstraction heuristics |{{ :courses:be4m36pui:PUI_tutorial_7.pdf |Presentation}} | [[https://forms.gle/uLS3prfwktuS82U76|feedback]]| [[https://youtu.be/0-sRJB7sy8M|recording]]|
| 8.  | 4/4 | 6/4 | Michaela Urbanovská | Assignment 1 consultations, Neural Planning | {{ :courses:be4m36pui:PUI_tutorial_NN_planning_8.pdf |Presentation}} | [[https://forms.gle/Rmajc7NED3t3VN4u6|feedback]]| [[https://youtu.be/MuaImo6qJP0|recording]]|
| 9.  | 11/4 | 13/4 | Jan Mrkos | Intro to MDPs |  {{ :courses:be4m36pui:pui_tutorial_9.pdf | Presentation}}, [[courses:be4m36pui:assignments:assignment2|Assignment #2]] | [[https://forms.gle/r3jkwJPXsY6Apigk8|feedback]] | [[https://youtu.be/nANrvKhrrA4|recording]]|
| 10.  | 25/4 (Easter Monday 18. 4.)  | 20/4 | Jan Mrkos  | Value Iteration and Friends | {{ :courses:be4m36pui:pui_tutorial_10.pdf | Presentation}} | [[https://forms.gle/JxJBaGeLgwxVbKiNA|feedback]] | [[https://youtu.be/pJMXVflrgH0|recording]]|
| 11. | 2/5  | 27/4 | Jan Mrkos  | Simple Temporal Networks  | {{ :courses:be4m36pui:pui_tutorial_11.pdf | Presentation}} | [[https://forms.gle/aCDuJZ3upkWfxTe9A|Feedback]]|[[https://youtu.be/UUuFvRdL6jw|recording]]|
| 12. | 9/5 | 5/5 | Jan Mrkos  | MCTS, UCT | {{ :courses:be4m36pui:pui_tutorial_12_mcts_2021.pdf | Presentation 2021}} | [[https://forms.gle/X2GRUsckpUqDScQ57 | Feedback]] | [[https://youtu.be/6wc3Hbn9nGc|recording]]|
| 13. | 16/5 | 18/5 (Rector's day 11. 5.) | Jan Mrkos  | Applications, revision, Assignment 2 deadline follows | |[[https://forms.gle/71docZkhKzveQAad8|Feedback]]| |


Notes on the Classical Planning part: {{ :courses:be4m36pui:notes-cp.pdf | notes-cp.pdf}} (updated 7. 4. 2020)

Notes on the Probabilistic planning tutorials: {{ :courses:be4m36pui:2018_tutorial_slides_2018.pdf | tutorial_slides_2018.pdf}}

==== 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 (We 14:30-16:00, K-311) 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. 

==== Examples from class ====
Template for problem definition: {{ :courses:be4m36pui:template_problem.txt | problem_template.pddl}}

Delivery example: {{ :courses:be4m36pui:delivery_domain_class.txt | domain_delivery.pddl}}, {{ :courses:be4m36pui:delivery_problem1 .txt | problem1_delivery.pddl}}, {{ :courses:be4m36pui:delivery_problem2.txt | problem2_delivery.pddl}}

Maze example: {{ :courses:be4m36pui:maze_domain_class.txt | maze_domain.pddl}}, {{ :courses:be4m36pui:maze_problem_class.txt | maze_problem.pddl}}

8-puzzle example: {{ :courses:be4m36pui:8puzzle-domain.txt | 8puzzle_domain.pddl}}, {{ :courses:be4m36pui:8puzzle-p1.txt | 8puzzle_problem.pddl}}

HFF Graph: {{ :courses:be4m36pui:hff_example.zip | hff_example.zip}}

==== Planners ====
  * {{:courses:be4m36pui: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''

==== Fun tasks ====
  * Solve the sokoban problem by 
   -  hand 
   - writing a domain for the given problem description and running a planner 
  *[[http://www.sokobanonline.com/play/community/hansz/122359_nr-20|sokoban]] {{sokoban.zip|sokoban-problem}}

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