pith. sign in

arxiv: 1704.03951 · v1 · pith:OJIQG4JZnew · submitted 2017-04-12 · 💻 cs.SY

Sparsity-Sensitive Finite Abstraction

classification 💻 cs.SY
keywords abstractionalgorithmcontrollerdimensionaldimensionsfiniteinputmodel
0
0 comments X
read the original abstract

Abstraction of a continuous-space model into a finite state and input dynamical model is a key step in formal controller synthesis tools. To date, these software tools have been limited to systems of modest size (typically $\leq$ 6 dimensions) because the abstraction procedure suffers from an exponential runtime with respect to the sum of state and input dimensions. We present a simple modification to the abstraction algorithm that dramatically reduces the computation time for systems exhibiting a sparse interconnection structure. This modified procedure recovers the same abstraction as the one computed by a brute force algorithm that disregards the sparsity. Examples highlight speed-ups from existing benchmarks in the literature, synthesis of a safety supervisory controller for a 12-dimensional and abstraction of a 51-dimensional vehicular traffic network.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.