623.618 (20W) Current Topics in Planning and Scheduling
Overview
For further information regarding teaching on campus, please visit: https://www.aau.at/en/corona.
- Lecturer
- Course title german Current Topics in Planning and Scheduling
- Type Lecture - Course (continuous assessment course )
- Course model Online course
- Hours per Week 2.0
- ECTS credits 3.0
- Registrations 3 (12 max.)
- Organisational unit
- Language of instruction English
- possible language(s) of the assessment German , English
- Course begins on 05.10.2020
- eLearning Go to Moodle course
-
Remarks (english)
The course will be held online using Moodle for sharing teaching materials and BigBlueButton for session streaming. Please join the BigBlueButton sessions announced in the Moodle course (user or guest access): https://moodle.aau.at/course/view.php?id=29305
Time and place
Course Information
Intended learning outcomes
Students are able to represent typical planning problems in general formalisms like PDDL, understand the computational methods, particular advantages as well as disadvantages of common planning systems.
Teaching methodology including the use of eLearning tools
Practical exercises and projects based on the concepts introduced in lecture sessions
Course content
The course presents basic and advanced concepts of modern general-purpose planning systems, ranging from algorithmic methods and translation techniques to scheduling aspects. Topics to investigate include representation formalisms for expressing planning problems, such as the planning domain definition language (PDDL). We will inspect and exercise complementary solving algorithms and heuristics of corresponding domain-independent planning systems, which utilize state-space search methods or translate planning problems into constraint-based formalisms like ASP, CSP and SAT.
Prior knowledge expected
Basic knowledge of propositional and first-order logic as well as fundamental concepts of artificial intelligence, knowledge representation and reasoning
Literature
- Haslum, P., Lipovetzky, N., Magazzeni, D., Muise, C.: An Introduction to the Planning Domain Definition Language. Morgan and Claypool, 2019.
- Helmert, M.: The Fast Downward Planning System. Journal of Artificial Intelligence Research 26: 191–246, 2006.
- Dimopoulos, Y., Gebser, M., Lühne, P., Romero, J., Schaub, T.: plasp 3: Towards Effective ASP Planning. Theory and Practice of Logic Programming 19(3): 477-504, 2019.
- Rintanen, J.: Planning as Satisfiability: Heuristics. Artificial Intelligence 193: 45-86, 2012.
- Gebser, M., Kaminski, R., Kaufmann, B., Schaub, T.: Answer Set Solving in Practice. Morgan and Claypool, 2012.
Examination information
Examination methodology
two to three practical assignments using domain-independent planning systems
Examination topic(s)
modeling and solving of planning problems based on the planning domain definition language
Assessment criteria / Standards of assessment for examinations
correctness and comprehensiveness of supplied solutions to practical tasks
Grading scheme
Grade / Grade grading schemePosition in the curriculum
- Bachelor's degree programme Applied Informatics
(SKZ: 511, Version: 19W.2)
-
Subject: Artificial Intelligence
(Compulsory elective)
-
8.1 Artificial Intelligence (
0.0h XX / 12.0 ECTS)
- 623.618 Current Topics in Planning and Scheduling (2.0h VC / 3.0 ECTS) Absolvierung im 4., 5., 6. Semester empfohlen
-
8.1 Artificial Intelligence (
0.0h XX / 12.0 ECTS)
-
Subject: Artificial Intelligence
(Compulsory elective)