1,404 research outputs found
A Characterization of Lyapunov Inequalities for Stability of Switched Systems
We study stability criteria for discrete-time switched systems and provide a
meta-theorem that characterizes all Lyapunov theorems of a certain canonical
type. For this purpose, we investigate the structure of sets of LMIs that
provide a sufficient condition for stability. Various such conditions have been
proposed in the literature in the past fifteen years. We prove in this note
that a family of languagetheoretic conditions recently provided by the authors
encapsulates all the possible LMI conditions, thus putting a conclusion to this
research effort. As a corollary, we show that it is PSPACE-complete to
recognize whether a particular set of LMIs implies stability of a switched
system. Finally, we provide a geometric interpretation of these conditions, in
terms of existence of an invariant set.Comment: arXiv admin note: text overlap with arXiv:1201.322
Analysis of switched and hybrid systems - beyond piecewise quadratic methods
This paper presents a method for stability analysis of switched and hybrid systems using polynomial and piecewise polynomial Lyapunov functions. Computation of such functions can be performed using convex optimization, based on the sum of squares decomposition of multivariate polynomials. The analysis yields several improvements over previous methods and opens up new possibilities, including the possibility of treating nonlinear vector fields and/or switching surfaces and parametric robustness analysis in a unified way
Lower Bounds on Complexity of Lyapunov Functions for Switched Linear Systems
We show that for any positive integer , there are families of switched
linear systems---in fixed dimension and defined by two matrices only---that are
stable under arbitrary switching but do not admit (i) a polynomial Lyapunov
function of degree , or (ii) a polytopic Lyapunov function with facets, or (iii) a piecewise quadratic Lyapunov function with
pieces. This implies that there cannot be an upper bound on the size of the
linear and semidefinite programs that search for such stability certificates.
Several constructive and non-constructive arguments are presented which connect
our problem to known (and rather classical) results in the literature regarding
the finiteness conjecture, undecidability, and non-algebraicity of the joint
spectral radius. In particular, we show that existence of an extremal piecewise
algebraic Lyapunov function implies the finiteness property of the optimal
product, generalizing a result of Lagarias and Wang. As a corollary, we prove
that the finiteness property holds for sets of matrices with an extremal
Lyapunov function belonging to some of the most popular function classes in
controls
Joint Spectral Radius and Path-Complete Graph Lyapunov Functions
We introduce the framework of path-complete graph Lyapunov functions for
approximation of the joint spectral radius. The approach is based on the
analysis of the underlying switched system via inequalities imposed among
multiple Lyapunov functions associated to a labeled directed graph. Inspired by
concepts in automata theory and symbolic dynamics, we define a class of graphs
called path-complete graphs, and show that any such graph gives rise to a
method for proving stability of the switched system. This enables us to derive
several asymptotically tight hierarchies of semidefinite programming
relaxations that unify and generalize many existing techniques such as common
quadratic, common sum of squares, and maximum/minimum-of-quadratics Lyapunov
functions. We compare the quality of approximation obtained by certain classes
of path-complete graphs including a family of dual graphs and all path-complete
graphs with two nodes on an alphabet of two matrices. We provide approximation
guarantees for several families of path-complete graphs, such as the De Bruijn
graphs, establishing as a byproduct a constructive converse Lyapunov theorem
for maximum/minimum-of-quadratics Lyapunov functions.Comment: To appear in SIAM Journal on Control and Optimization. Version 2 has
gone through two major rounds of revision. In particular, a section on the
performance of our algorithm on application-motivated problems has been added
and a more comprehensive literature review is presente
Switched networks and complementarity
A modeling framework is proposed for circuits that are subject both to externally induced switches (time events) and to state events. The framework applies to switched networks with linear and piecewise-linear elements, including diodes. We show that the linear complementarity formulation, which already has proved effective for piecewise-linear networks, can be extended in a natural way to also cover switching circuits. To achieve this, we use a generalization of the linear complementarity problem known as the cone-complementarity problem. We show that the proposed framework is sound in the sense that existence and uniqueness of solutions is guaranteed under a passivity assumption. We prove that only first-order impulses occur and characterize all situations that give rise to a state jump; moreover, we provide rules that determine the jump. Finally, we show that within our framework, energy cannot increase as a result of a jump, and we derive a stability result from this
On feedback stabilization of linear switched systems via switching signal control
Motivated by recent applications in control theory, we study the feedback
stabilizability of switched systems, where one is allowed to chose the
switching signal as a function of in order to stabilize the system. We
propose new algorithms and analyze several mathematical features of the problem
which were unnoticed up to now, to our knowledge. We prove complexity results,
(in-)equivalence between various notions of stabilizability, existence of
Lyapunov functions, and provide a case study for a paradigmatic example
introduced by Stanford and Urbano.Comment: 19 pages, 3 figure
- …