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.

Comment: arXiv admin note: text overlap with arXiv:2209.10319

• 03B70 - Logic in computer science
• 68-XX - Computer science
• 68Q45 - Formal languages and automata
• 68Q60 - Specification and verification (program logics, model checking, etc.)
• 68T20 - Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
• 91A44 - Games involving topology, set theory, or logic