Tutorials plan 2018/2019

Lecture Date (Mo/EN) Date (We/CZ) Lecturer Contents Assignments
1. 18/2 20/2 Daniel Fišer STRIPS, FDR, SAS
2. 25/2 27/2 Daniel Fišer PDDL & Compilations
3. 4/3 6/3 Daniel Fišer Relaxation heuristics Handout of Assignment 1
4. 11/3 13/3 Daniel Fišer LM-Cut heuristic Handout of Assignment 2
5. 18/3 20/3 Daniel Fišer Abstraction heuristics
6. 25/3 27/3 Daniel Fišer Invariants
7. 1/4 3/4 Daniel Fišer Assignment 1 and 2 Consultations
8. 8/4 10/4 Daniel Fišer LP-based heuristics Assignment 1 Deadline
9. 15/4 17/4 Jan Mrkos Dijkstra/A*-replan (Robot Emil) slides Assignment 1 0-point Deadline
10./11. 22/4 29/4 24/4 1/5 Jan Mrkos Robust replan and MDP intro slides
12. 6/5 9/5 Jan Mrkos Value iteration slides Handout of Assingnment 3.2+3.3
13. 13/5 14/5 Jan Mrkos MCTS slides Assingnment 3.1 Deadline
14. 20/5 22/5 Jan Mrkos Assignment Consultations Assignment 2 Deadline, Assingnment 3.2+3.3 Soft Deadline on Sunday

Notes on the Classical Planning part: notes-cp.pdf

Notes on the Probabilistic planning tutorials: 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

Planners

  • Pre-built for 64bit Ubuntu
  • Including sources (you may build them yourself)
  • 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
  1. hand
  2. writing a domain for the given problem description and running a planner

Value iteration

Questions: link

courses/be4m36pui/tutorials.txt · Last modified: 2019/05/20 12:40 by mrkosja1