Roman Geiselhart

Roman Geiselhart, Fabian R. Wirth

In this paper ISS small-gain theorems for discrete-time systems are stated, which do not require input-to-state stability (ISS) of each subsystem. This approach weakens conservatism in ISS small-gain theory, and for the class of exponentially ISS systems we are able to prove that the proposed relaxed small-gain theorems are non-conservative in a sense to be made precise. The proofs of the small-gain theorems rely on the construction of a dissipative finite-step ISS Lyapunov function which is introduced in this work. Furthermore, dissipative finite-step ISS Lyapunov functions, as relaxations of ISS Lyapunov functions, are shown to be sufficient and necessary to conclude ISS of the overall system.

Roman Geiselhart, Fabian R. Wirth

In the stability analysis of large-scale interconnected systems it is frequently desirable to be able to determine a decay point of the gain operator, i.e., a point whose image under the monotone operator is strictly smaller than the point itself. The set of such decay points plays a crucial role in checking, in a semi-global fashion, the local input-to-state stability of an interconnected system and in the numerical construction of a LISS Lyapunov function. We provide a homotopy algorithm that computes a decay point of a monotone op- erator. For this purpose we use a fixed point algorithm and provide a function whose fixed points correspond to decay points of the monotone operator. The advantage to an earlier algorithm is demonstrated. Furthermore an example is given which shows how to analyze a given perturbed interconnected system.

Seyed Hossein Mousavi, Navid Noroozi, Anton H. J. de Ruiter et al.

This note studies (practical) asymptotic stability of nonlinear networked control systems whose protocols are not necessarily uniformly globally exponentially stable. In particular, we propose a Lyapunov-based approach to establish (practical) asymptotic stability of the networked control systems. Considering so-called modified Round Robin and Try-Once-Discard protocols, which are only uniformly globally asymptotically stable, we explicitly construct Lyapunov functions for these two protocols, which fit our proposed setting. In order to optimize the usage of communication resource, we exploit the following transmission policy: wait for a certain minimum amount of time after the last sampling instant and then check a state-dependent criterion. When the latter condition is violated, a transmission occurs. In that way, the existence of the minimum amount of time between two consecutive transmission is established and so-called Zeno phenomenon, therefore, is avoided. Finally, illustrative examples are given to verify the effectiveness of our results.