Criteria of asymptotic stability of differential and difference inclusions encountered in control theory

doi:10.1016/0167-6911(89)90021-2

Systems & Control Letters

Volume 13, Issue 1, July 1989, Pages 59-64

https://doi.org/10.1016/0167-6911(89)90021-2 Get rights and content

Abstract

For a class of differential inclusions, to which many of the practically important control systems can be reduced, necessary and sufficient conditions for asymptotic stability of the zero solution are established by the method of Lyapunov functions. Similar results are obtained for the corresponding class of difference inclusions.

References (13)

A. Lasota et al.
Asymptotic behavior for differential equations which cannot be locally
J. Differential Equations
(1971)
A.F. Filippov
Stability for differential equations with discontinuous and many-valued right-hand sides
Differents. Uravn.
(1979)
P.S. Pyatnitskii
Absolute stability of nonstationary nonlinear systems
Automat. Remote Control
(1970)
A.P. Molchanov et al.
Absolute instability of nonlinear nonstationary systems I
Automat. Remote Control
(1982)
A.P. Molchanov et al.
Absolute instability of nonlinear nonstationary systems, II
Automat. Remote Control
(1982)
Ye.S. Pyatnitskiy
On uniform stability with parametric perturbations
Differents. Uravn.
(1973)
A.F. Filippov
Differential Equations with Discontinuous Right-hand Side
(1985)

There are more references available in the full text version of this article.

Cited by (356)

Optimal stabilizing rates of switched linear control systems under arbitrary known switchings
2024, Automatica
The problem of stabilizing discrete-time switched linear control systems using continuous control input under arbitrary mode switchings is studied. It is assumed that at each time instance the switching mode can be arbitrarily chosen but is always known by the controller designing the continuous control input; thus the continuous controller is of the general form of an ensemble of mode-dependent state feedback controllers. Under this setting, the fastest (worst-case) stabilizing rate is proposed as a quantitative metric of the systems’ stabilizability. Conditions are derived on when this stabilizing rate can be exactly achieved by an admissible control policy and a counter example is given to show that the stabilizing rate may not always be attained by a mode-dependent linear state feedback control policy. Bounds on the stabilizing rate are derived using (semi)norms. When such bounds are tight, the corresponding extremal norms are characterized geometrically. Numerical algorithms based on ellipsoid and polytope norms are developed for computing bounds of the stabilizing rate and illustrated through examples.
On universal classes of Lyapunov functions for linear switched systems
2023, Automatica
In this paper we discuss the notion of universality for classes of candidate common Lyapunov functions for linear switched systems. On the one hand, we prove that a family of absolutely homogeneous functions is universal as soon as it approximates arbitrarily well every convex absolutely homogeneous function for the $C^{0}$ topology of the unit sphere. On the other hand, we prove several obstructions for a class to be universal, showing, in particular, that families of piecewise-polynomial continuous functions whose construction involves at most $l$ polynomials of degree at most $m$ (for given positive integers $l, m$ ) cannot be universal.
Passive linear discrete-time systems: Characterization through structure
2021, Linear Algebra and Its Applications
We here show that the family of finite-dimensional, discrete-time, passive, linear time-invariant systems can be characterized through the structure of a matrix-convex set, which is maximal in the sense of being closed under products of its elements Moreover, this observation unifies three setups: (i) difference inclusions, (ii) matrix-valued rational functions, (iii) realization arrays associated with rational functions.
It turns out that in the continuous-time case the corresponding structure is of a maximal matrix-convex cone closed under inversion.
Switching systems with dwell time: Computing the maximal Lyapunov exponent
2021, Nonlinear Analysis: Hybrid Systems
We study asymptotic stability of continuous-time systems with mode-dependent guaranteed dwell time. These systems are reformulated as special cases of a general class of mixed (discrete–continuous) linear switching systems on graphs, in which some modes correspond to discrete actions and some others correspond to continuous-time evolutions. Each discrete action has its own positive weight which accounts for its time-duration. We develop a theory of stability for the mixed systems; in particular, we prove the existence of an invariant Lyapunov norm for mixed systems on graphs and study its structure in various cases, including discrete-time systems for which discrete actions have inhomogeneous time durations. This allows us to adapt recent methods for the joint spectral radius computation (Gripenberg’s algorithm and the Invariant Polytope Algorithm) to compute the Lyapunov exponent of mixed systems on graphs.
Stable Autonomous Flow Matching
2024, arXiv
Stability under dwell time constraints: Discretization revisited
2024, arXiv

View all citing articles on Scopus

View full text

Criteria of asymptotic stability of differential and difference inclusions encountered in control theory

Abstract

J. Differential Equations

Stability for differential equations with discontinuous and many-valued right-hand sides

Differents. Uravn.

Absolute stability of nonstationary nonlinear systems

Automat. Remote Control

Absolute instability of nonlinear nonstationary systems I

Automat. Remote Control

Absolute instability of nonlinear nonstationary systems, II

Automat. Remote Control

On uniform stability with parametric perturbations

Differents. Uravn.

Differential Equations with Discontinuous Right-hand Side