An iterative abstraction algorithm for reactive correct-by-construction controller synthesis
2016 (English)In: Proceedings of the IEEE Conference on Decision and Control, IEEE conference proceedings, 2016, 6147-6152 p.Conference paper (Refereed)Text
In this paper, we consider the problem of synthesizing correct-by-construction controllers for discrete-time dynamical systems. A commonly adopted approach in the literature is to abstract the dynamical system into a Finite Transition System (FTS) and thus convert the problem into a two player game between the environment and the system on the FTS. The controller design problem can then be solved using synthesis tools for general linear temporal logic or generalized reactivity(1) specifications. In this article, we propose a new abstraction algorithm. Instead of generating a single FTS to represent the system, we generate two FTSs, which are under- and over-approximations of the original dynamical system. We further develop an iterative abstraction scheme by exploiting the concept of winning sets, i.e., the sets of states for which there exists a winning strategy for the system. Finally, the efficiency of the new abstraction algorithm is illustrated by numerical examples.
Place, publisher, year, edition, pages
IEEE conference proceedings, 2016. 6147-6152 p.
Aerospace electronics, Autonomous automobiles, Complexity theory, Computational modeling, Control systems, Heuristic algorithms, Partitioning algorithms
IdentifiersURN: urn:nbn:se:kth:diva-188272DOI: 10.1109/CDC.2015.7403186ScopusID: 2-s2.0-84962020091ISBN: 9781479978861OAI: oai:DiVA.org:kth-188272DiVA: diva2:937323
54th IEEE Conference on Decision and Control, CDC 2015, 15 December 2015 through 18 December 2015
QC 201606152016-06-152016-06-092016-06-15Bibliographically approved