Allowable sampling period for consensus control of multiple general linear dynamical agents in random networks

摘要

This article studies the consensus problem for a group of sampled-data general linear dynamical agents over random communication networks. Dynamic output feedback protocols are applied to solve the consensus problem. When the sampling period is sufficiently small, it is shown that as long as the mean topology has globally reachable nodes, the mean square consensus can be achieved by selecting protocol parameters so that n - 1 specified subsystems are simultaneously stabilised. However, when the sampling period is comparatively large, it is revealed that differing from low-order integrator multi-agent systems the consensus problem may be unsolvable. By using the hybrid dynamical system theory, an allowable upper bound of sampling period is further proposed. Two approaches to designing protocols are also provided. Simulations are given to illustrate the validity of the proposed approaches.