Khái niệm cốt lõi
This paper presents an effective and computationally optimal approach to synthesize controllers for timeline-based games, which can handle both temporal uncertainty and general nondeterminism in a uniform way.
Tóm tắt
The paper introduces the concept of timeline-based games, which extends the timeline-based planning paradigm to handle general nondeterminism. It has been shown that determining the existence of a winning strategy for such games is 2EXPTIME-complete. However, a concrete approach to synthesize controllers implementing such strategies was missing.
The key contributions of this work are:
It provides a detailed account of the general timeline-based planning and game framework.
It develops an effective and computationally optimal approach to directly construct a deterministic finite-state automaton that recognizes solution plans for a given timeline-based game.
It shows how to turn such an automaton into the arena of a reachability game, for which many controller synthesis techniques are available.
The proposed method addresses the limitations of previous techniques by avoiding the construction of large and complex intermediate structures, and directly building a deterministic automaton of an optimal doubly-exponential size.
Thống kê
There are no key metrics or important figures used to support the author's key logics.
Trích dẫn
There are no striking quotes supporting the author's key logics.