Logo CVUT Logo FEL CourseWare Wiki

Switch Term
Summer 2025 / 2026Summer 2024 / 2025Summer 2023 / 2024Summer 2022 / 2023Summer 2021 / 2022Summer 2017 / 2018

Log In
  • b252
  • courses
  • pui
  • lectures

Navigation

  • PUI
  • assignments
    • Assignment 1 - PDDL Modeling
    • Assignment 2 - Classical Planner
  • tutorials
    • 1. PDDL Modeling
    • 2. Heuristic Search
    • 3. Propositional Representation STRIPS and FDR
    • 4. Delete relaxation heuristics
    • 5. Fast-forward heuristic and action landmarks
    • 6. LM-Cut heuristic
    • 7. Pattern databases
    • 8. LP-based heuristics
    • 11. Stochastic shortest path (SSP)
    • 12. Heuristics for SSP
    • 13./14. Lets prepare for exam - Exercises
  • Exam
  • Lecture plan 2025/2026
  • Tutorial Recordings from 2021
  • Tutorials plan 2025/2026

All courses

  • Summer 2025 / 2026
  • Winter 2025 / 2026
  • Summer 2024 / 2025
  • Winter 2024 / 2025
  • Summer 2023 / 2024
  • Winter 2023 / 2024
  • Summer 2022 / 2023
  • Winter 2022 / 2023
  • Summer 2021 / 2022
  • Winter 2021 / 2022
  • Summer 2020 / 2021
  • Winter 2020 / 2021
  • Summer 2019 / 2020
  • Winter 2019 / 2020
  • Summer 2018 / 2019
  • Winter 2018 / 2019
  • Summer 2017 / 2018
  • Older





AE4M36PAH - faculty web
A4M36PAH Czech version of the course


OPPA European Social Fund Prague & EU: We invest in your future.

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

/

I will try to maintain lecture notes that can be found here.

Old recorded lectures are available at PUI playlist.

courses/pui/lectures.txt · Last modified: 2026/02/08 11:51 by xhorcik
Copyright © 2026 CTU in Prague | Operated by IT Center of Faculty of Electrical Engineering | Bug reports and suggestions ServiceDesk CTU