B4M36PUI/BE4M36PUI – Planning for Artificial Intelligence

News

16. 5. 2020 - Video about Planning and Acting in Dynamic Environments

10. 5. 2020 - Videos about MDPs (POMDPs coming on 11.5.)

6. 5. 2020 - Tutorial on MDP and Value-Iteration Algorithm ( pdf )

4. 5. 2020 - Video about Monte-Carlo Tree Search

4. 5. 2020 - Assignment 2 / FF-Replan (Assignment #2)

26. 4. 2020 - Videos about FOND and Probabilistic planning (FF-Replan coming on 27.4.)

19. 4. 2020 - Videos about Plan-Space Planning and Modeling and Reformulation

7. 4. 2020 - Materials for the tutorial on abstractions available: pdf + notes-cp.pdf, Section 5

5. 4. 2020 - Video for the lecture about LP-based heuristics

29. 3. 2020 - Materials for the tutorial on abstractions available: pdf + notes-cp.pdf, Section 4

27. 3. 2020 - Video for the lecture about Abstraction heuristics

20. 3. 2020 - Videos for the lecture about Landmarks and LM-Cut

18. 3. 2020 - Materials for the LM-Cut tutorial available: LM-Cut + notes-cp.pdf, Section 3

Assignments: There will be two assignments, together for 50 points.
Zápočet: For receiving a Zápočet, assignments 1 and 2 must be successfully submitted before deadline and you have to obtain at least 25 points from them.
Exam: Total number of points possible to get from the exam is 50, and you have to obtain at least 25 points to pass the course.
Final mark: Final mark equals to the sum of points from the tutorials (50 points max), and points from the exam (50 points max).

There will be two assignments:

Assignment 1
- deadline: ~~12. 4. 23:59~~ 26. 4. 23:59
- points available: 30

Assignment 2
- handed out: 5. 4.
- deadline : 1. 6. 23:59
- points available: 20

Malik Ghallab,‎ Dana Nau,‎ Paolo Traverso: Automated Planning and Acting, Cambridge University Press, 2016.
Stefan Edelkamp Stefan Schroedl: Heuristic Search, Theory and Applications, Morgan Kaufmann, 2011.
Malik Ghallab, Dana Nau, Paolo Traverso: Automated Planning, Theory and Practice, Morgan Kaufmann, 2004.