Set-Theoretical Stability Analysis of LPV Systems via Minkowski–Lyapunov Functions

A set-theoretical approach based on Minkowski–Lyapunov functions is proposed to study the stability of polytopic systems in the linear parameter-varying (LPV) form. In contrast to the one based on quadratic Lyapunov functions, the proposed approach provides necessary and sufficient conditions for stability in both discrete and continuous time. Remarkably, the resulting conditions are computationally tractable and can be verified using algorithms with guaranteed convergence, in contrast to other set-theoretical tools. In addition, the proposed method is shown to be flexible enough to incorporate knowledge of the system, such as restrictions on the rate of variation of the parameters or the kind of disturbances and/or unmodeled dynamics encompassed, allowing to establish nonconservative robust stability conditions. Two illustrative examples are added to show the main advantages.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Automatic Control
Published
2024-08-09
DOI
https://doi.org/10.1109/tac.2024.3441325
Citations
2
Primary Topic
Stability and Controllability of Differential Equations
Type
article
Field-Weighted Citation Impact
0.66
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Set-Theoretical Stability Analysis of LPV Systems via Minkowski–Lyapunov Functions

Karina A. Barbosa, Javier A. Gallegos
2 citations
IEEE Transactions on Automatic Control
Stability and Controllability of Differential Equations
0.66
article

Set-Theoretical Stability Analysis of LPV Systems via Minkowski–Lyapunov Functions

Karina A. Barbosa, Javier A. Gallegos
article en
2 citations

Abstract

A set-theoretical approach based on Minkowski–Lyapunov functions is proposed to study the stability of polytopic systems in the linear parameter-varying (LPV) form. In contrast to the one based on quadratic Lyapunov functions, the proposed approach provides necessary and sufficient conditions for stability in both discrete and continuous time. Remarkably, the resulting conditions are computationally tractable and can be verified using algorithms with guaranteed convergence, in contrast to other set-theoretical tools. In addition, the proposed method is shown to be flexible enough to incorporate knowledge of the system, such as restrictions on the rate of variation of the parameters or the kind of disturbances and/or unmodeled dynamics encompassed, allowing to establish nonconservative robust stability conditions. Two illustrative examples are added to show the main advantages.

IEEE Transactions on Automatic ControlVol. 70(1)
Universidad de Santiago de Chile (CL), Pontificia Universidad Católica de Chile (CL)
Affordable and clean energy
Openalex Percentile: Top 31%
Stability and Controllability of Differential Equations
0.66
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.