Input-to-state stability and gain computation for networked control systems

关键词:  Small gain theorem · Networked systems · Input-to-state stability · Robust stability · Distributed algorithm

Key words:  Small gain theorem · Networked systems · Input-to-state stability · Robust stability · Distributed algorithm

摘要:

This paper studies the stability problem for networked control systems. A general result, called network gain theorem, is introduced to determine the input-to-state stability (ISS) for interconnected nonlinear systems. We show how this result generalises the previously known small gain theorem and cyclic small gain theorem for ISS. For the case of linear networked systems, a complete characterisation of the stability condition is provided, together with two distributed algorithms for computing the network gain: the classical Jacobi iterations and a message-passing algorithm. For the case of nonlinear networked systems, characterisation of the ISS condition can be done using M-functions, and Jacobi iterations can be used to compute the network gain.

Abstract:

This paper studies the stability problem for networked control systems. A general result, called network gain theorem, is introduced to determine the input-to-state stability (ISS) for interconnected nonlinear systems. We show how this result generalises the previously known small gain theorem and cyclic small gain theorem for ISS. For the case of linear networked systems, a complete characterisation of the stability condition is provided, together with two distributed algorithms for computing the network gain: the classical Jacobi iterations and a message-passing algorithm. For the case of nonlinear networked systems, characterisation of the ISS condition can be done using M-functions, and Jacobi iterations can be used to compute the network gain.