Containment Control of Linear Multi-Agent Systems with Self-Feedback via Aperiodic Sampling

Abstract

The present paper deal with the containment control problem for a class of continuous-time linear multi-agent systems. Using the neighborhood information of aperiodic sampled data, we propose a protocol based on aperiodic sampled data and with self-feedback. Utilizing the proposed protocol, the containment control problem is equivalently transformed into the stability problem for some complex-value linear discrete-time equations. By using the differential inequality technique, a very simple necessary and sufficient condition is obtained to ensure linear multi-agent systems achieves state containment, which gives a formula for calculating the maximum sampling interval.