Semistability and Stochastic Semistability for Switched Nonlinear Systems by Means of Fixed Point Theory: Application to Constrained Distributed Consensus over Random Networks

摘要

In this paper, semistability and stochastic semistability for switched discrete-time nonlinear systems are considered. The main results of this paper involve sufficient conditions for (stochastic) semistability of discrete-time nonlinear/linear dynamical systems under time-varying or random switching by means of Fixed Point Theory, that has not been considered in the literature. As an application of the results, an iterative algorithm is derived for constrained distributed consensus over random multi-agent networks. The algorithm is a totally asynchronous algorithm without requiring B-connectivity or distribution dependency of switching graphs. The algorithm is able to converge even if the weighted matrix of the graph is periodic and irreducible under synchronous protocol.