A data-driven method for computing polyhedral invariant sets of black-box switched linear systems
Z Wang, RM Jungers - IEEE Control Systems Letters, 2020 - ieeexplore.ieee.org
In this letter, we consider the problem of invariant set computation for black-box switched
linear systems using merely a finite set of observations of system trajectories. In particular …
linear systems using merely a finite set of observations of system trajectories. In particular …
Computing controlled invariant sets for hybrid systems with applications to model-predictive control
In this paper, we develop a method for computing controlled invariant sets using
Semidefinite Programming. We apply our method to the controller design problem for …
Semidefinite Programming. We apply our method to the controller design problem for …
Inner approximations of domains of attraction for a class of switched systems by computing Lyapunov‐like functions
X Zheng, Z She, Q Liang, M Li - International Journal of Robust …, 2018 - Wiley Online Library
Domain of attraction plays an important role in control systems analysis, which is usually
estimated by sublevel sets of Lyapunov functions. In this paper, based on the concept of …
estimated by sublevel sets of Lyapunov functions. In this paper, based on the concept of …
Data-driven computation of invariant sets of discrete time-invariant black-box systems
Z Wang, RM Jungers - arXiv preprint arXiv:1907.12075, 2019 - arxiv.org
We consider the problem of computing the maximal invariant set of discrete-time black-box
nonlinear systems without analytic dynamical models. Under the assumption that the system …
nonlinear systems without analytic dynamical models. Under the assumption that the system …
Sum-of-squares methods for controlled invariant sets with applications to model-predictive control
We develop a method for computing controlled invariant sets of discrete-time affine systems
using Sum-of-Squares programming. We apply our method to the controller design problem …
using Sum-of-Squares programming. We apply our method to the controller design problem …
Computation of the maximal invariant set of discrete-time linear systems subject to a class of non-convex constraints
We consider the problem of computing the maximal invariant set of discrete-time linear
systems subject to a class of non-convex constraints that admit quadratic relaxations. These …
systems subject to a class of non-convex constraints that admit quadratic relaxations. These …
Robust-to-dynamics optimization
AA Ahmadi, O Günlük - Mathematics of Operations …, 2024 - pubsonline.informs.org
A robust-to-dynamics optimization (RDO) problem is an optimization problem specified by
two pieces of input:(i) a mathematical program (an objective function f: R n→ R and a …
two pieces of input:(i) a mathematical program (an objective function f: R n→ R and a …
Computation of the maximal invariant set of linear systems with quasi-smooth nonlinear constraints
In this paper, we consider the problem of computing the maximal invariant set of linear
systems with a class of nonlinear constraints that admit quadratic relaxations. With these …
systems with a class of nonlinear constraints that admit quadratic relaxations. With these …
Correct-by-construction control synthesis for high-dimensional systems
LP Nilsson - 2017 - deepblue.lib.umich.edu
There is a need for controller design methodologies that enable early detection and
elimination of unsafe designs. This thesis is about correct-by-construction synthesis methods …
elimination of unsafe designs. This thesis is about correct-by-construction synthesis methods …
Safety and invariance for constrained switching systems
N Athanasopoulos, K Smpoukis… - 2016 IEEE 55th …, 2016 - ieeexplore.ieee.org
We study discrete time linear switching systems subject to additive disturbances. We
consider two types of constraints, namely on the states and on the switching signal. A …
consider two types of constraints, namely on the states and on the switching signal. A …