Guaranteed cost consensus protocol design for linear multi-agent systems with sampled-data information: An input delay approach

To investigate the energy consumption involved in a sampled-data consensus process, the problem of guaranteed cost consensus for sampled-data linear multi-agent systems is considered. By using an input delay approach, an equivalent system is constructed to convert the guaranteed cost consensus problem to a guaranteed cost stabilization problem. A sufficient condition for guaranteed cost consensus is given in terms of linear matrix inequalities (LMIs), based on a refined time-dependent Lyapunov functional analysis. Reduced-order protocol design methodologies are proposed, with further discussions on determining sub-optimal protocol gain and enlarging allowable sampling interval bound made as a complement. Simulation results illustrate the effectiveness of the theoretical results.