Agreement of General Sampled-data Multi-agent Systems

Abstract

This paper focuses on looking for the maximum allowable sampling period for multi-agent systems with general linear dynamical agents. As long as the sampling period is less than the bound, there exists a linear agreement protocol solving the agreement problem of the sampled-data multi-agent systems. Firstly, the agreement problem is converted to the simultaneously stabilizing problem of some specific systems. Secondly, the maximum allowable sampling period for SISO sampled-data multi-agent systems is provided based on the instable eigenvalues of continuous-time system matrix. Then by solving the <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">H</i> <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">∞</sub> optimal control problem of certain system with uncertainty, an allowable bound of sampling period is obtained.