Search

In this note, we study the stabilization problem of positive switched linear system (PSLS) with disturbance. By introducing a class of weak common linear copositive Lyapunov functions, we design time-dependent switching rules under which the system is asymptotically stable. Both continuous-time and discrete-time PSLS are taken into consideration, and the obtained results are also extended to nonpositive switched systems. Finally, the theoretical results are applied to consensus problem of multiagent systems with switching topologies and disturbance. [ABSTRACT FROM PUBLISHER]

This technical note establishes a novel result for adaptive asymptotic tracking control of uncertain switched linear systems. The result exploits a recently proposed stability condition for switched systems. In particular, a time-varying positive definite Lyapunov function is used to develop a novel piecewise continuous model-reference adaptive law and a dwell-time switching law. In contrast with previous research, where asymptotic tracking was possible only in the presence of a common Lyapunov function for the reference models, in this work asymptotic tracking is shown in a more general setting. Additionally, in the presence of persistence of excitation, the controller parameter estimation errors will converge to zero asymptotically. The main contribution of this work consists in establishing a symmetry between adaptive control of classical non-switched linear systems and adaptive control of switched linear systems. A practical example with an electro-hydraulic system is adopted to illustrate the results. [ABSTRACT FROM AUTHOR]

This paper introduces the notion of common zeroing-output systems (CZOS) to analyze the stability of switched systems. The concept of CZOS allows one to verify weak zero-state detectability. It characterizes a common behavior of any individual subsystem when the output signal for each subsystem is “approaching” zero. Heuristically speaking, it removes the effect of switching behavior, and thus enables one to analyze stability properties in systems with complex switching signals. With the help of CZOS, the Krasovskii–LaSalle theorem can be extended to switched nonlinear time-varying systems with both arbitrary switching and more general restricted switching cases. For switched nonlinear time-invariant systems, the needed detectability condition is further simplified, leading to several new stability results. Particularly, when a switched linear time-invariant system is considered, it is possible to generate a recursive method, which combines a Krasovskii–LaSalle result and a nested Matrosov result, to find a CZOS if it exists. The power of the proposed CZOS is demonstrated by consensus problems in literature to obtain a stronger convergence result with weaker conditions. [ABSTRACT FROM AUTHOR]

We show that existence of a global polynomial Lyapunov function for a homogeneous polynomial vector field or a planar polynomial vector field (under a mild condition) implies existence of a polynomial Lyapunov function that is a sum of squares (sos) and that the negative of its derivative is also a sum of squares. This result is extended to show that such sos-based certificates of stability are guaranteed to exist for all stable switched linear systems. For this class of systems, we further show that if the derivative inequality of the Lyapunov function has an sos certificate, then the Lyapunov function itself is automatically a sum of squares. These converse results establish cases where semidefinite programming is guaranteed to succeed in finding proofs of Lyapunov inequalities. Finally, we demonstrate some merits of replacing the sos requirement on a polynomial Lyapunov function with an sos requirement on its top homogeneous component. In particular, we show that this is a weaker algebraic requirement in addition to being cheaper to impose computationally. [ABSTRACT FROM AUTHOR]

In this technical note, a necessary and sufficient stability criterion for switched linear systems under dwell-time constraint is proposed by employing a class of time-scheduled homogeneous polynomial Lyapunov functions with a sufficiently large degree. The key feature of this nonconservative condition lies in its convexity in the system matrices, which explicitly facilitates its further extension to uncertain systems. Then, in order to obtain numerically testable condition, a family of LMI conditions are presented with the aid of the idea of dividing the dwell-time interval into a finite number of segments. It is proved that the non-conservativeness can be maintained with a sufficiently large interval dividing parameter. In the end, the result is straightforwardly extended to the uncertain case in virtue of the convexity in the system matrices. Numerical examples are presented to illustrate our findings. [ABSTRACT FROM PUBLISHER]