Warning
This page is located in archive.

Tutorials plan 2019/2020

Lecture Date (Mo/EN) Date (We/CZ) Lecturer Contents Assignments
1. 17/2 19/2 Daniel Fišer STRIPS, FDR, SAS
2. 24/2 26/2 Daniel Fišer PDDL & Compilations Compilations
3. 2/3 4/3 Daniel Fišer Invariants Handout of Assignment 1
4. 9/3 11/3 Daniel Fišer Relaxation heuristics
5. 16/3 18/3 Daniel Fišer LM-Cut heuristic LM-Cut
6. 23/3 25/3 Daniel Fišer Abstraction heuristics Abstractions
7. 30/3 1/4 Daniel Fišer Invariants / Assignment 1 Consultations
8. 6/4 8/4 Daniel Fišer LP-based heuristics LP-based heuristics
9. 13/4 20/4 15/4 Daniel Fišer Assignment 2/FF-replan pdf
10. 27/4 22/4 Jan Mrkos Robust replan and MDP intro slides
11. 4/5 29/4 Jan Mrkos Value iteration slides pdf
12. 11/5 13/5 6/5 Jan Mrkos MCTS slides youtube-tutorial
13. 18/5 20/5 Jan Mrkos Assignment Consultations

Notes on the Classical Planning part: notes-cp.pdf (updated 7. 4. 2020)

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: 2020/05/22 08:11 by fiserdan