Computing the Domain of Attraction of Switching Systems Subject to Non-Convex Constraints

DOI10.1145/2883817.2883823zbMath1364.93377arXiv1510.07483OpenAlexW2156918367MaRDI QIDQ2988960

Raphaël M. Jungers, Nikolaos Athanasopoulos

Publication date: 19 May 2017

Published in: Proceedings of the 19th International Conference on Hybrid Systems: Computation and Control (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1510.07483

zbMATH Keywords

algorithmsdomain of attractionswitching linear systemsmaximal admissible invariant setsemi-algebraic constraints

Mathematics Subject Classification ID

Semidefinite programming (90C22) Linear systems in control theory (93C05) Asymptotic stability in control theory (93D20) Attainable sets, reachability (93B03) Control/observation systems governed by functional relations other than differential equations (such as hybrid and switching systems) (93C30)

Related Items (3)

Computation of the maximal invariant set of discrete-time linear systems subject to a class of non-convex constraints ⋮ Sum-of-squares methods for controlled invariant sets with applications to model-predictive control ⋮ A novel strategy of extending the domain of attraction of affine nonlinear systems

This page was built for publication: Computing the Domain of Attraction of Switching Systems Subject to Non-Convex Constraints