===== Tutorials plan 2017/2018 =====

^ Lecture ^ Date   ^ Lecturer ^ Contents ^ Assignments ^
| 1.  | 19. 2. | Daniel Fišer | STRIPS, FDR, SAS | |
| 2.  | 26. 2. | Daniel Fišer  | Planners, PDDL & Compilations  |  |
| 3.  | 5. 3. | Daniel Fišer  | Relaxation heuristics | Assignment 1 handout |
| 4.  | 12. 3.  | Daniel Fišer  | Landmark heuristics | |
| 5.  | 19. 3. | Daniel Fišer  | Abstraction heuristics | |
| 6.  | 26. 3. | Daniel Fišer  | Linear Program formulation of heuristics | |
| 7. | 2. 4. | -  | <del>Easter Monday</del> | - |
| 8. | 9. 4. | Daniel Fišer  | Consultations | Assignment 1 Consultations |
| 9.  | 16. 4. | Daniel Fišer  | Modeling and reformulation | Assignment 1 Deadline |
| 10.  | 23. 4.  | Jan Mrkos  | Dijkstra/A*-replan ([[courses:pui:assignments:emil1|Robot Emil]]) | Assignment 1 0-point Deadline |
| 11. | 30.4.  | Jan Mrkos  | FF-replan and Robust FF | |
| 12. | 7. 5. | Jan Mrkos  | Value iteration |  |
| 13. | 14. 5. | Jan Mrkos  | MCTS |  |
| 14. | 21. 5. | Jan Mrkos  | Assignment Consultations |   |

Notes on the Classical Planning part: {{ :courses:pui:notes-cp.pdf | notes-cp.pdf}}

Notes on the Probabilistic planning tutorials: {{ :courses:pui:2018_tutorial_slides_2018.pdf | tutorial_slides_2018.pdf}}
==== English vs. Czech ====
  * The first tutorial (12:45-14:15) will be held in **English** (unless all students present are ok with Czech)
  * The second tutorial (18:00-19:30) will be held in **Czech** 




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

==== Online PDDL Editor ====
  * [[http://editor.planning.domains|PDDL editor]]
  * Default timeout 10s
To run a particular planner (timeout 15 min., 500MB memory limit):
In Solve/Custom Planner URL put: http://plan.felk.cvut.cz:5000/[planner] where
planner = 
  * ff - FF planner
  * siw - LAPKT siw-then-bfsf configuration
  * lama - LAMA planner
  * mercury - mercury planner
  * probe - probe planner
  * yahsp3 - yahsp planner
  * ms - A* with Merge&Shring heuristic (optimal)
  * lmcut - A* with LM-Cut heuristic (optimal)
  * symba - symba planner (optimal)
  * metricff - numeric variant of FF (numeric)

To run a numeric/temporal planner (OPTIC), use: http://plan.felk.cvut.cz:5001

Important :!:
  * The planners are running on a single computer, do not overload it!
  * The timeout is 15min, nothing may happen during that time (and it is ok)

==== 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]]