Lyapunov-Metzler Inequalities for Switched Systems

• Lyapunov–Metzler inequalities are matrix inequalities that combine Lyapunov functions with Metzler matrices to enforce stability in systems with prescribed dwell times.
• They facilitate both state-feedback regulation and performance guarantees by leveraging LMI relaxations for linear and affine switched systems.
• Practical applications include stabilization of unstable dynamics in engineering systems such as boost converters and traffic models.

Lyapunov–Metzler inequalities are matrix inequalities developed for the analysis and synthesis of switching control laws in continuous-time switched linear and affine systems subject to dwell-time constraints. They provide a framework for expressing stability conditions and guaranteed cost bounds via a combined Lyapunov and Metzler-matrix approach, enabling both the rigorous regulation of linear systems to the origin and the practical stabilization of affine systems to a neighborhood around the origin. Their formulation and use leverage irreducible Metzler matrices to encode mode-dependent cost-to-go comparisons over intervals defined by a prescribed minimum dwell time, with matrix inequalities ensuring negativity of aggregated Lyapunov increments at switching events.

1. Formulation of Lyapunov–Metzler Inequalities

Lyapunov–Metzler inequalities are constructed for systems with a finite set of modes $\Omega=\{1,\dots,M\}$, where each mode $i$ is described by dynamics $A_i\in\mathbb{R}^{n\times n}$ and output matrix $C\in\mathbb{R}^{p\times n}$. A dwell time $T>0$ dictates the minimum time spent in each mode before switching. The switching structure is encoded via an irreducible Metzler matrix $\Pi=[\pi_{i,j}]_{i,j=1}^M\in\mathcal{M}$, characterized by $\pi_{i,j}\geq0$ for $i\neq j$ and zero row sums $\sum_j \pi_{i,j}=0$.

For the linear switched case, the algebraic Lyapunov–Metzler inequality for each $i\in\Omega$ is: $i$0 where $i$1 and

$i$2

For switched affine systems $i$3, the system is augmented to a linear form in $i$4, and the inequalities become

$i$5

with $i$6, and corresponding block matrices: $i$7

2. Differential and Algebraic Structure; Connection to Dwell-Time

The Lyapunov–Metzler inequalities incorporate both algebraic and differential forms. During each dwell interval $i$8, the candidate Lyapunov matrix $i$9 (or affine extension $A_i\in\mathbb{R}^{n\times n}$0) evolves according to the backward-flow differential equation: $A_i\in\mathbb{R}^{n\times n}$1 with terminal constraint: $A_i\in\mathbb{R}^{n\times n}$2 This ensures $A_i\in\mathbb{R}^{n\times n}$3 flows backwards in time from $A_i\in\mathbb{R}^{n\times n}$4, resetting at switching points. The transformation between algebraic and integral forms links the differential equation solution to the terms in the Lyapunov–Metzler inequality. The Metzler-summed increments $A_i\in\mathbb{R}^{n\times n}$5 enforce the negativity of cost-to-go jumps at switching events, mediating stability across modes and encoding the dwell-time dependence in the comparison principle.

3. Stability Analysis and Guaranteed Cost Bounds

In the linear switched case, the existence of matrices $A_i\in\mathbb{R}^{n\times n}$6 and a Metzler $A_i\in\mathbb{R}^{n\times n}$7 satisfying the Lyapunov–Metzler inequalities yields a state-feedback switching law under dwell time $A_i\in\mathbb{R}^{n\times n}$8 that ensures:

• Global exponential stability of the origin,
• A guaranteed quadratic cost bound:

$A_i\in\mathbb{R}^{n\times n}$9

where $C\in\mathbb{R}^{p\times n}$0 is the regulated output.

For switched affine systems, the corresponding construction using $C\in\mathbb{R}^{p\times n}$1, $C\in\mathbb{R}^{p\times n}$2, and $C\in\mathbb{R}^{p\times n}$3 produces:

• Practical stability: the state enters and remains in a neighborhood of the origin,
• Cost bound:

$C\in\mathbb{R}^{p\times n}$4

with the long-term average cost satisfying $C\in\mathbb{R}^{p\times n}$5.

These results rely on the feasibility of the Lyapunov–Metzler inequalities and enforcement of a fixed minimum dwell time.

4. Computation and Selection of Metzler Matrix and Lyapunov Parameters

The practical application of Lyapunov–Metzler inequalities involves selection or optimization of the Metzler matrix $C\in\mathbb{R}^{p\times n}$6 and Lyapunov matrices $C\in\mathbb{R}^{p\times n}$7 (and $C\in\mathbb{R}^{p\times n}$8 for the affine case):

• The direct approach jointly optimizes $C\in\mathbb{R}^{p\times n}$9 to minimize the cost bound, subject to the inequalities, but this is nonconvex due to bilinear terms in $T>0$0.
• To address tractability, a line-search/LMI relaxation fixes $T>0$1 to a scalar-diagonal Metzler form (e.g., $T>0$2, $T>0$3 for $T>0$4). This reduces the inequalities to a set of LMIs in $T>0$5 and $T>0$6, solvable with standard LMI solvers and yielding conservative but practical solutions.
• For application-driven choices, if a convex Hurwitz average $T>0$7 exists, $T>0$8 may be chosen so that $T>0$9. When operating under Markovian switching with dwell times $\Pi=[\pi_{i,j}]_{i,j=1}^M\in\mathcal{M}$0, one takes $\Pi=[\pi_{i,j}]_{i,j=1}^M\in\mathcal{M}$1 for preferred transitions.

5. Expressions for Quadratic Cost Bounds

The guaranteed cost bounds resulting from Lyapunov–Metzler inequalities are of quadratic form:

System Type	Cost Bound Expression	Bound Type
Linear switched	$\Pi=[\pi_{i,j}]_{i,j=1}^M\in\mathcal{M}$2	State-dependent
Affine switched	$\Pi=[\pi_{i,j}]_{i,j=1}^M\in\mathcal{M}$3	State- and time-dependent

In both cases, $\Pi=[\pi_{i,j}]_{i,j=1}^M\in\mathcal{M}$4 is computed as the initial value of the Lyapunov matrix solving the backward-flow differential Lyapunov equation over the dwell interval.

6. Systematic Examples and Numerical Verification

Three illustrative examples demonstrate the feasibility and effect of Lyapunov–Metzler inequalities:

• Unstable-linear system: Two unstable $\Pi=[\pi_{i,j}]_{i,j=1}^M\in\mathcal{M}$5 are stabilized by choosing $\Pi=[\pi_{i,j}]_{i,j=1}^M\in\mathcal{M}$6 and $\Pi=[\pi_{i,j}]_{i,j=1}^M\in\mathcal{M}$7. Numerical simulations show convergence even though individual modes are unstable.
• Boost–boost converter: A 4-mode switched affine representation, with $\Pi=[\pi_{i,j}]_{i,j=1}^M\in\mathcal{M}$8 and $\Pi=[\pi_{i,j}]_{i,j=1}^M\in\mathcal{M}$9 such that $\pi_{i,j}\geq0$0, delivers successful regulation at $\pi_{i,j}\geq0$1 s and achieves small $\pi_{i,j}\geq0$2-like cost. Comparative analysis indicates performance similar to existing dwell-time stabilization methods.
• Traffic-congestion: A 3-mode switched affine queue model without a Hurwitz convex combination is stabilized by a cyclically-structured Metzler matrix (Markov-chain form) with $\pi_{i,j}\geq0$3. The Lyapunov–Metzler approach produces a stable limit cycle, matching behavior from periodic controllers in established literature.

In all cases, feasibility of the inequalities is validated numerically with LMI solvers or line-search relaxation, and the switching law is observed to enforce dwell-time while maintaining costs within the prescribed bounds.

7. Assumptions, Limitations, and Applicability

Key assumptions are the existence of an irreducible Metzler matrix $\pi_{i,j}\geq0$4, feasibility of the Lyapunov–Metzler inequalities (linear or affine), and enforcement of a fixed dwell time $\pi_{i,j}\geq0$5. The nonconvex optimization for optimal $\pi_{i,j}\geq0$6 and $\pi_{i,j}\geq0$7 may limit general computational tractability; however, line-search/LMI relaxations provide practical conservative solutions. The framework accommodates both systems with Hurwitz convex combinations and those without such structures, extending applicability to switched systems with arbitrary mode dynamics. This suggests that Lyapunov–Metzler inequalities are broadly suitable for engineering systems requiring guaranteed performance under constrained switching, including systems lacking conventional stability in any individual mode.