Journal article Open Access

On timeline-based games and their complexity

Gigante Nicola; Montanari Angelo; Orlandini Andrea; Cialdea Mayer Marta; Reynolds Mark

In timeline-based planning, domains are described as sets of independent, but interacting, components, whose behaviour over time (the set of timelines) is governed by a set of temporal constraints. A distinguishing feature of timeline-based planning systems is the ability to integrate planning with execution by synthesising control strategies for flexible plans. However, flexible plans can only represent temporal uncertainty, while more complex forms of nondeterminism are needed to deal with a wider range of real-world domains. In this paper, we propose a novel game-theoretic approach to timeline-based planning problems, generalising the state of the art while uniformly handling temporal uncertainty and nondeterminism. We define a general concept of timeline-based game and we show that the notion of winning strategy for these games is strictly more general than that of control strategy for dynamically controllable flexible plans. Moreover, we show that the problem of establishing the existence of such winning strategies is 2EXPTIME-complete.

Files (534.1 kB)
Name Size
tcs2019.pdf
md5:d72d46f2e1100a39333818899c0d3597
534.1 kB Download
31
49
views
downloads
Views 31
Downloads 49
Data volume 27.3 MB
Unique views 23
Unique downloads 44

Share

Cite as