Course manual 2022/2023

Objectives

Students can name the elements of a planning problem, can state the computational complexity of decision problems in planning, can describe algorithms for finding plans including heuristics.
Students can calculate several types of heuristics for a given planning problem and state, they can execute symbolic search (by manipulating BDDs), and they can determine translations of planning problem into logic.
Students can evaluate which type of modelling is best suited for real-world problems.
Students can model real-world problems as planning problems s.t. the plans for these problems will solve real-world issues and questions.

Teaching methods

Lecture

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).

Additional requirements for this course:

Attendance is voluntary.

Assessment

Item and weight	Details
Final grade
Endexam	Must be ≥ 90, Mandatory
Sheet 1
Sheet 2
Sheet 3
Sheet 4
Sheet 5
Mandatory Programming
Sheet 6
Elective Programming - Mandatory Points
Modelling
Elective Programming - Bonus	Bonus
Planning Competition	Bonus
Sheet 7	Bonus

The exam is open book - any non-electronic material may be brought. Mandatory Programming and Modelling exercises are handled via DOMjudge.

Inspection of assessed work

Students are informed via eMail (via canvas) about determined partial grades and the time and date of the inzage. For mandatory programming and modelling exercises, DOMjudge will provide feedback immediately. Homework will be graded via Canvas. Feedback will be provided via Canvas.

Assignments

Exercise sheets, mandatory programming, and modelling are individually.

Elective Programming and the Planner competition may be done in teams of up to four students.

For elective programming, seven tasks for 10 points each will be posed - i.e. students can select two out of seen to do.

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
1	Introduction, PDDL, SAS+, Invariants
2	Search, Heuristics, Critical Path
3	Complexity, Delete Relaxation
4	Abstractions
5	Merge and Shrink, Landmarks
6	Cost Partitioning and LM-cut
7	Symbolic and Logic Planning

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

Automated Planning