Zeit und Ort

LV-Beschreibung

Intendierte Lernergebnisse

Students are able to represent typical planning problems in general formalisms like PDDL, action languages and temporal logics, understand the computational methods, particular advantages as well as disadvantages of common planning systems and are aware of the most prominent extended frameworks for planning.

Lehrmethodik

Practical exercises and projects based on the concepts introduced in lecture sessions

Inhalt/e

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), action languages and temporal logics. 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. In addition, the course addresses extended frameworks, such as temporal and conformant planning, where time scheduling or imperfect information, respectively, is incorporated into the planning process.

Erwartete Vorkenntnisse
keine Anmeldevoraussetzung

Basic knowledge of propositional and first-order logic as well as fundamental concepts of artificial intelligence, knowledge representation and reasoning