Stability analysis of nonlinear impulsive switched positive systems

In this paper, the global asymptotic stability (GAS) of continuous-time and discrete-time nonlinear impulsive switched positive systems (NISPS) are studied. For continuous-time and discrete-time NISPS, switching signals and impulse signals coexist. For both of these systems, using the multiple max-separable Lyapunov function method and average dwell-time (ADT) method, some sufficient conditions on GAS are given. Based on these, the GAS criteria are also given for continuous-time and discrete-time linear impulsive switched positive systems (LISPS). From our criteria, the stability of the systems can be judged directly from the characteristics of the system functions, switching signals and impulse signals of the systems. Finally, simulation examples verify the validity of the results.

Sign Stability of Dual Switching Linear Continuous-Time Positive Systems

This paper investigates 1-moment exponential stability and exponential mean-square stability (EMS stability) under average dwell time (ADT) and the preset deterministic switching mechanism of dual switching linear continuous-time positive systems when a numerical realization does not exist. The signs of subsystem matrices, but not their structures of magnitude, are key information that causes a qualitative concept of stability called sign stability. Both 1-moment exponential stability and EMS stability, which are the traditional stability concepts, are generalized intrinsically. Hence, both 1-moment exponential sign stability and EMS sign stability are introduced and are proven based on sign equivalency. It is shown that they are symmetrically and qualitatively stable. Notably, the notion of stability can be checked quantitatively using some examples.

Output Reachable Set Analysis for Periodic Positive Systems

In this study, we use the union of the bounding hyperpyramids to estimate the output reachable set for periodic positive systems under two classes of exogenous disturbances. Optimization algorithms are used to obtain the smallest bounding hyperpyramids possible. Finally, numerical examples are given to verify the theoretical results.