Automated Planning

6 EC

Semester 2, period 5

5314AUPL6Y

Owner Master Logic
Coordinator dr. Gregor Behnke
Part of Master Artificial Intelligence, Master Logic,

Course manual 2023/2024

Objectives

  • Students can identify the elements of a planning problem and the computational complexity of decision problems in planning.
  • Students can state algorithms for finding plans including heuristics.
  • Students can describe in their own words the mechanics of a given planning problem and its connection to the modelled scenario
  • Students can execute several types of planning algorithms and heuristics given a planning problem
  • Students can analyse properties of search methods, translations, and heuristics and their impact on the process of solving planning problems.
  • Students can evaluate which type of modelling is best suited for real-world problems.
  • Students can implement search techniques, translations, and heuristics to solve planning problems automatically.
  • Students 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
  • 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

Final grade

6 (50%)

Tentamen

Must be ≥ 90

1 (8%)

Sheet 1

1 (8%)

Sheet 2

1 (8%)

Sheet 3

1 (8%)

Sheet 4

1 (8%)

Sheet 5

1 (8%)

Sheet 6

Sheet 7

Bonus

Resit exam replaces main exam only. I.e. the grade after the resit is determined by homework + resit.

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, Landmarks  
5 Cost Partitioning, Domination, LM-cut  
6 Invariants, Partial Order Reduction, Orbit Search  
7 Symbolic Search  
8 SAT Planning  

Contact information

Coordinator

  • dr. Gregor Behnke

Staff

  • Maurice Dekker MSc
  • Marta Grasa Lainez