Game-theoretic Approach to Planning and Synthesis

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

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

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, Game-theoretic Techniques, Safety Games, Reachability Games, Games for LTL/LTLf 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.

• Thursday 13/04/2023: 13:00-17:00 CEST – Via Ariosto 25, A2 + online

• Monday 17/04/2023: 13:00-15:00 CEST – Via Ariosto 25, A4 + online

• Thursday 20/04/2023: 13:00-17:00 CEST – Via Ariosto 25, A2 + online

• Thursday 27/04/2023: 13:00-17:00 CEST – Via Ariosto 25, A2 + online

• Thursday 04/05/2023: 13:00-17:00 CEST – Via Ariosto 25, A2 + online

• Monday 08/04/2023: 13:00-15:00 CEST – Via Ariosto 25, A4 + online

Teaching material. 

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