10.1016/j.tcs.2020.02.011
https://zenodo.org/records/3859876
oai:zenodo.org:3859876
Gigante Nicola
Gigante Nicola
Università Udine
Montanari Angelo
Montanari Angelo
Università Udine
Orlandini Andrea
Orlandini Andrea
CNR-ISTC
Cialdea Mayer Marta
Cialdea Mayer Marta
Università ROMA TRE
Reynolds Mark
Reynolds Mark
University of Western Australia
On timeline-based games and their complexity
Zenodo
2020
2020-05-02
https://zenodo.org/communities/sharework
https://zenodo.org/communities/eu
preprint
Creative Commons Attribution 4.0 International
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.
European Commission
10.13039/501100000780
820807
Safe and effective HumAn-Robot coopEration toWards a better cOmpetiveness on cuRrent automation lacK manufacturing processes.