https://cw.fel.cvut.cz/wiki/ 2026-04-19T17:34:53+0200 https://cw.fel.cvut.cz/wiki/ https://cw.fel.cvut.cz/wiki/lib/tpl/bulma-cw/images/favicon.ico text/html 2026-02-09T13:55:03+0200 Anonymous (anonymous@undisclosed.example.com) https://cw.fel.cvut.cz/wiki/courses/pui/exam?rev=1770641703&do=diff Exam For attending an exam, you need to fulfill requirements for zápočet (check in KOS if you have it). Registering for the exam To register for an exam date, sign up in KOS. On the day of the exam, you must complete a written test in the morning, followed by a voluntary oral exam in the afternoon. You can contact the tutors or lecturers if you have any questions regarding the exam's evaluation. text/html 2026-04-13T14:04:23+0200 Anonymous (anonymous@undisclosed.example.com) https://cw.fel.cvut.cz/wiki/courses/pui/lectures?rev=1776081863&do=diff Lecture plan 2025/2026 All lectures are in KN:E-301 (K9) each Monday 9:15–10:45. Lecture Date Contents Materials 1. 16/2 Introduction to Automated Planning / PDDL [slides] 2. 24/2 Heuristic Search Algorithms [slides] 3. 2/3 STRIPS, FDR, Delete Relaxation $h^{\mathsf{max}}$$h^{\mathsf{add}}$$h^{\mathsf{ff}}$ text/html 2026-02-04T14:14:36+0200 Anonymous (anonymous@undisclosed.example.com) https://cw.fel.cvut.cz/wiki/courses/pui/old_tutorials?rev=1770210876&do=diff Tutorial Recordings from 2021 Topic Recording 1. STRIPS, FDR recording 2. PDDL recording 3. Relaxation heuristics recording, Corrected h^add computation 4. Landmark heuristics recording 5. LP based heuristics recording 6. Exercises recording 7. Abstraction heuristics recording 8. Neural Planning + consultations recording 9. Intro to MDPs text/html 2026-02-04T14:14:36+0200 Anonymous (anonymous@undisclosed.example.com) https://cw.fel.cvut.cz/wiki/courses/pui/sidebar?rev=1770210876&do=diff ---------- ---------- AE4M36PAH - faculty web A4M36PAH Czech version of the course ---------- OPPA European Social Fund Prague & EU: We invest in your future. text/html 2026-02-08T11:47:45+0200 Anonymous (anonymous@undisclosed.example.com) https://cw.fel.cvut.cz/wiki/courses/pui/start?rev=1770547665&do=diff B4M36PUI/BE4M36PUI – Planning for Artificial Intelligence B4M36PUIBE4M36PUIBE4M36PUI/B4M36PUI Forum Lecturer Rostislav Horčík Tutorial lecturer Jakub Med Course evaluation Homework assignments:Zápočet:Exam:Final grade: Homework assignments Every part of the class has one assignment. The classical planning assignment has 3 separate parts. text/html 2026-04-13T14:04:54+0200 Anonymous (anonymous@undisclosed.example.com) https://cw.fel.cvut.cz/wiki/courses/pui/tutorials?rev=1776081894&do=diff Tutorials plan 2025/2026 Tutorial Date Contents Notes 1. 16/2 PDDL Modeling 2. 24/2 Heuristic Search Task Assignment - Assignment 1 3. 2/3 Propositional representation STRIPS, FDR 4. 9/3 Heuristics I (Relaxation Heuristics) 16/3 Alternative content Task Assignment - Assignment 2 5. 23/3 Heuristics II (Fast forward and action landmarks) 6. 30/3 Heuristics III (LM-Cut) 6/4 Easter Monday 7. 13/4 Heuristics IV (Pattern databases) 8. 2…