Search

A general upper bound for topological entropy of switched nonlinear systems is constructed, using an asymptotic average of upper limits of the matrix measures of Jacobian matrices of strongly persistent individual modes, weighted by their active rates. A general lower bound is constructed as well, using a similar weighted average of lower limits of the traces of these Jacobian matrices. In a case of interconnected structure, the general upper bound is readily applied to derive upper bounds for entropy that depend only on "network-level" information. In a case of block-diagonal structure, less conservative upper and lower bounds for entropy are constructed. In each case, upper bounds for entropy that require less information about the switching signal are also derived. The upper bounds for entropy and their relations are illustrated by numerical examples of a switched Lotka–Volterra ecosystem model. [ABSTRACT FROM AUTHOR]

The problem of input-to-state stability (ISS) and its integral version (iISS) are considered for switched nonlinear systems with inputs, resets and possibly unstable subsystems. For the dissipation inequalities associated with the Lyapunov function of each subsystem, it is assumed that the supply functions, which characterize the decay rate and ISS/iISS gains of the subsystems, are nonlinear. The change in the value of Lyapunov functions at switching instants is described by a sum of growth and gain functions, which are also nonlinear. Using the notion of average dwell-time (ADT) to limit the number of switching instants on an interval, and the notion of average activation time (AAT) to limit the activation time for unstable systems, a formula relating ADT and AAT is derived to guarantee ISS/iISS of the switched system. Case studies of switched systems with saturating dynamics and switched bilinear systems are included for illustration of the results. [ABSTRACT FROM AUTHOR]

This paper studies a notion of topological entropy for switched systems, formulated in terms of the minimal number of trajectories needed to approximate all trajectories with a finite precision. For general switched linear systems, we prove that the topological entropy is independent of the set of initial states. We construct an upper bound for the topological entropy in terms of an average of the measures of system matrices of individual modes, weighted by their corresponding active times, and a lower bound in terms of an active-time-weighted average of their traces. For switched linear systems with scalar-valued state and those with pairwise commuting matrices, we establish formulae for the topological entropy in terms of active-time-weighted averages of the eigenvalues of system matrices of individual modes. For the more general case with simultaneously triangularizable matrices, we construct upper bounds for the topological entropy that only depend on the eigenvalues, their order in a simultaneous triangularization, and the active times. In each case above, we also establish upper bounds that are more conservative but require less information on the system matrices or on the switching, with their relations illustrated by numerical examples. Stability conditions inspired by the upper bounds for the topological entropy are presented as well. [ABSTRACT FROM AUTHOR]