Stability Analysis and Stabilization of Systems Presenting Nested Saturations
Open accessAbstract
This note addresses the problems of stability analysis and stabilization of systems presenting nested saturations. Depending on the open-loop stability assumption, the global stability analysis and stabilization problems are considered. In the (local) analysis problem, the objective is the determination of estimates of the basin of attraction of the system. Considering the stabilization problem, the goal is to design a set of gains in order to enlarge the basin of attraction of the closed-loop system. Based on the modelling of the system presenting nested saturations as a linear system with dead-zone nested nonlinearities and the use of a generalized sector condition, linear matrix inequality (LMI) stability conditions are formulated. From these conditions, convex optimization strategies are proposed to solve both problems
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The use of model (2) to describe magnitude and rate saturating actuators can be seen as a particular case of nested saturation [16].
“As stated by [15] and [14], the use of model (2) to describe magnitude and rate saturating actuators can be seen as a particular case of nested saturation [16].”
From Sampled-Data Control of LPV Systems With Magnitude and Rate Saturating Actuators (2025) · cites this paper as [16]
Cited by
Sorted by citations
Sampled-Data Control of LPV Systems With Magnitude and Rate Saturating Actuators
Oliveira, L. A. L., Guelton, K., Motchon, K. M. D., & Leite, V. J. S. (2025) · IEEE Control Systems Letters · doi:10.1109/lcsys.2025.3580489 · Cited by 2 · see citing works
- Authors
- Tarbouriech, S., Prieur, C., & Gomes Da Silva, J. M.
- Affiliations
- Centre National de la Recherche Scientifique (FR)
- ORCID
- Tarbouriech, S.
- Venue
- IEEE Transactions on Automatic Control
- Published
- 2006-08
- Volume
- 51
- Issue
- 8
- Pages
- 1364-1371
- ISSN
- 0018-9286 (ISSN-L)
- OpenAlex
- W1968114261
- Cited by
- 285
- References
- 0
- Citations by year
- 2026: 3 · 2025: 22 · 2024: 16 · 2023: 14 · 2022: 12 · 2021: 8 · 2020: 10 · 2019: 11 · 2018: 15 · 2017: 25 · 2016: 24 · 2015: 17 · 2014: 12 · 2013: 17 · 2012: 13
- FWCI
- 25.92
- Type
- journal article
- Language
- en
- Open access
- green
- americanae.aecid.es
- Locations
- IEEE Transactions on Automatic Control (publishedVersion)
- Americanae (AECID Library) (submittedVersion, other-oa)
- Lume (Universidade Federal do Rio Grande do Sul) (submittedVersion, other-oa)
- LA Referencia (Red Federada de Repositorios Institucionales de Publicaciones Científicas) (submittedVersion, cc-by-nc-sa)
- Topics
- Physical Sciences › Engineering › Control and Systems Engineering › Stability and Control of Uncertain Systems
- Physical Sciences › Engineering › Control and Systems Engineering › Advanced Control Systems Design
- Physical Sciences › Engineering › Control and Systems Engineering › Adaptive Control of Nonlinear Systems
- Keywords
- nested saturation, nonlinear saturation, dead-zone nonlinearity, global stability analysis, stabilization, linear matrix inequalities, generalized sector condition, convex optimization
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review