Tools for Stability of Switching Linear Systems: Gain Automata and Delay Compensation.

The topic of this paper is the analysis of stability for a class of switched linear systems, modeled by hybrid automata. In each location of the hybrid automaton the dynamics is assumed to be linear and asymptotically stable; the guards on the transitions are hyperplanes in the state space. For each location an estimate is made of the gain via a Lyapunov function for the dynamics in that location, given a pair of ingoing and outgoing transitions. It is shown how to obtain the best possible estimate by optimizing the Lyapunov function. The estimated gains are used in defining a so-called gain automaton that forms the basis of an algorithmic criterion for the stability of the hybrid automaton. The associated gain automaton provides a systematic tool to detect potential sources of instability as well as an indication on to how to stabilize the hybrid systems by requiring appropriate delays for specific transitions

Time-Delay Systems

Time delay is very often encountered in various technical systems, such as electric, pneumatic and hydraulic networks, chemical processes, long transmission lines, robotics, etc. The existence of pure time lag, regardless if it is present in the control or/and the state, may cause undesirable system transient response, or even instability. Consequently, the problem of controllability, observability, robustness, optimization, adaptive control, pole placement and particularly stability and robustness stabilization for this class of systems, has been one of the main interests for many scientists and researchers during the last five decades

A review of convex approaches for control, observation and safety of linear parameter varying and Takagi-Sugeno systems

This paper provides a review about the concept of convex systems based on Takagi-Sugeno, linear parameter varying (LPV) and quasi-LPV modeling. These paradigms are capable of hiding the nonlinearities by means of an equivalent description which uses a set of linear models interpolated by appropriately defined weighing functions. Convex systems have become very popular since they allow applying extended linear techniques based on linear matrix inequalities (LMIs) to complex nonlinear systems. This survey aims at providing the reader with a significant overview of the existing LMI-based techniques for convex systems in the fields of control, observation and safety. Firstly, a detailed review of stability, feedback, tracking and model predictive control (MPC) convex controllers is considered. Secondly, the problem of state estimation is addressed through the design of proportional, proportional-integral, unknown input and descriptor observers. Finally, safety of convex systems is discussed by describing popular techniques for fault diagnosis and fault tolerant control (FTC).Peer ReviewedPostprint (published version

Dwell-time computation for stability of switched systems with time delays

Cataloged from PDF version of article.The aim of this study is to find an improved dwell time that guarantees the stability of switched systems with heterogeneous constant time-delays. Piecewise Lyapunov-Krasovkii functionals are used for each candidate system to investigate the stability of the switched time-delayed system. Under the assumption that each candidate system is stable for small delay values, a sufficient condition for dwell-time that guarantees the asymptotic stability is derived. Numerical examples are given to compare the results with the previously obtained dwell-time bounds. © The Institution of Engineering and Technology 2013

On the Necessary and Sufficient Condition for a Set of Matrices to Commute and Some Further Linked Results

Es reproducción del documento publicado en http://dx.doi.org/10.1155/2009/650970This paper investigates the necessary and sufficient condition for a set of (real or complex) matrices to commute. It is proved that the commutator [A,B]=0 for two matrices A and B if and only if a vector v(B) defined uniquely from the matrix B is in the null space of a well-structured matrix defined as the Kronecker sum A⊕(−A∗), which is always rank defective. This result is extendable directly to any countable set of commuting matrices. Complementary results are derived concerning the commutators of certain matrices with functions of matrices f(A) which extend the well-known sufficiency-type commuting result [A,f(A)]=0.Ministerio de Educación DPI2006-00714 ; Gobierno Vasco GIC07143-IT-269-07 y SAIOTEK S-PE08UN1