Course manual 2025/2026

Objectives

  • The student can identify the elements of a planning problem and the computational complexity of decision problems in plannin
  • The student can describe algorithms for finding plans including heuristics
  • The student can describe in their own words the mechanics of a given planning problem and its connection to the modelled scenario
  • The student can execute several types of planning algorithms and heuristics given a planning problem
  • The student can analyse properties of search methods, translations, and heuristics and their impact on the process of solving planning problems
  • The student can evaluate which type of modelling is best suited for real-world problems
  • The student can implement search techniques, translations, and heuristics to solve planning problems automatically
  • The student can model real-world problems as planning problems s.t. the plans for these problems will solve real-world issues while being aware of the limits of the level of detail and abstraction of the model

Teaching methods

  • Lecture
  • Seminar
  • Self-study

Homework

Learning activities

Activity

Hours

Hoorcollege

28

Tentamen

3

Werkcollege

12

Self study

125

Total

168

(6 EC x 28 uur)

Attendance

This programme does not have requirements concerning attendance (TER-B).

Assessment

Item and weight Details Remarks

Final grade

Overall grade is calculated as: 1 + (total points)/40.

Tentamen

Homework 1

Homework 2

Homework 3

Homework 4

Homework 5

Homework 6

Homework 7

Final grade after retake

Overall grade is calculated as: 1 + (total points)/40.

Hertentamen

Homework 1

Homework 2

Homework 4

Homework 5

Homework 6

Homework 7

To pass the course, a student must achieve (1) in total 180 points and (2) at least 90 points in the exam or the resit.

The resit exam only replaces the end exam.

In the exam, you may use any printed material.

Overall grade is calculated as: 1 + (total points)/40. This means that Homework 7 counts as a bonus.

Inspection of assessed work

Inspection of the graded exam will be on an individual basis.

Assignments

There are weekly homework assignments. Homework is made individually, is graded, and you will be given feedback.

Each homework comprises of a set of mandatory written exercises. In week 1, there are additional mandatory programming exercises. In addition there are further exercises where you can choose between written exercises or programming exercises.

Fraud and plagiarism

The 'Regulations governing fraud and plagiarism for UvA students' applies to this course. This will be monitored carefully. Upon suspicion of fraud or plagiarism the Examinations Board of the programme will be informed. For the 'Regulations governing fraud and plagiarism for UvA students' see: www.student.uva.nl

Course structure

Weeknummer Onderwerpen Studiestof
1 STRIPS, FDR, Search  
2 Critical Paths and Delete Relaxation  
3 Delete Relaxation, Abstractions  
4 PDBs, Merge and Shrink  
5 Landmarks, Cost Partitioning  
6  Domination, LM-cut, Invariants  
7  Symbolic Search and SAT Search  
8 Exam  

Contact information

Coordinator

  • dr. Gregor Behnke LLM

Staff

Joao Sa