# Controller Synthesis for Timeline-based Games

arXiv: https://arxiv.org/abs/2307.12289 · HTML: https://mlsanity.com/paper/2307.12289/

## Key facts

- No citing papers in the map yet (data through 14 Oct 2026).
- Builds on 1 of its 35 references that are in the map.
- First posted on arXiv 23 Jul 2023.

## Builds on (most cited first, 1 of 1)

- [Timeline-based planning: Expressiveness and Complexity](https://mlsanity.com/paper/1902.06123/) (2019)

## Abstract (arXiv)

In the timeline-based approach to planning, the evolution over time of a set of state variables (the timelines) is governed by a set of temporal constraints. Traditional timeline-based planning systems excel at the integration of planning with execution by handling temporal uncertainty. In order to handle general nondeterminism as well, the concept of timeline-based games has been recently introduced. It has been proved that finding whether a winning strategy exists for such games is 2EXPTIME-complete. However, a concrete approach to synthesize controllers implementing such strategies is missing. This paper fills this gap, by providing an effective and computationally optimal approach to controller synthesis for timeline-based games.