]>
2021-05-12T07:24:26+00:00
An Iterative Abstraction Algorithm for Reactive Correct-by-Construction Controller Synthesis
0
en
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) (GR1) 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 underand 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 e�ciency of the new abstraction algorithm is illustrated by numerical examples.
Robert Mattila, Yilin Mo and Richard M. Murray
2014j
Submitted, 2015 International Conference on Hybrid Systems: Computation and Control (HSCC)
mmm15-hscc
Conference Paper
2016-05-15T06:14:41Z
2457523.7601968
An Iterative Abstraction Algorithm for Reactive Correct-by-Construction Controller Synthesis
Title
102
en
Title