Game-theoretic Approach to Planning and Synthesis

(Part of Elective in AI - HRI & Reasoning Agents
& National PhD Program in AI)

Prof. Giuseppe De Giacomo

2024 Edition

Announcements:

Welcome

The lectures on Game-theoretic Approach to Planning and Synthesis 2023/2024 (Prof. De Giacomo) will start on Thursday, May 2, 2024, and end on Monday, May 30, 2024. The course is scheduled Mondays from 17:00 to 19:00 in AULA A2  and Thursdays from 15:00 to 19:00 in AULA A5, Via Ariosto 25. 

From now on, on this page, you'll find all the required information. Enjoy the course!

Course Description

Objectives. This course introduces AI planning and program synthesis for tasks (goals) expressed over finite traces instead of states. Specifically, borrowing from Formal Methods, we will consider tasks and environment specifications expressed in LTL and in particular its finite trace variant LTLf. We will review the main results and algorithmic techniques to handle planning in nondeterministic domains. Then, we will draw connections with verification, and reactive synthesis, together with their game-theoretic solution techniques. The main catch is that working with these logics can be based on devising suitable 2-player games and finding strategies, i.e., plans, to win them. Specifically, we will cover the following topics: Planning in Nondeterministic Domains, Temporal Logics, LTL, LTLf, PPLTL Game-theoretic Techniques, Safety Games, Reachability Games, Games for LTL/LTLf/PPLTL objectives, and Reactive Synthesis. This course is partially based on the work carried out in ERC Advanced Grant WhiteMech and EU ICT-48 TAILOR. 

Schedule.

Teaching material. 

[1] Course slides 2023/2024 and additional readings which will be available on this page.

Streamed lectures on Zoom

The Zoom room for the streamed lectures is the following: 

https://uniroma1.zoom.us/j/7737376235


To get access please use your account studenti.uniroma1.it