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

Notes on the Probabilistic planning tutorials: tutorial_slides_2018.pdf

• 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

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.

Template for problem definition: problem_template.pddl

Delivery example: domain_delivery.pddl, problem1_delivery.pddl, problem2_delivery.pddl

Maze example: maze_domain.pddl, maze_problem.pddl

8-puzzle example: 8puzzle_domain.pddl, 8puzzle_problem.pddl

HFF Graph: hff_example.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

• Solve the sokoban problem by

1. hand
2. writing a domain for the given problem description and running a planner

• sokoban sokoban-problem

Questions: link