Consensus of multiple double-integrators with aperiodic sampled-data and switching topology

This paper is concerned with the sampled-data consensus problem in networks of multiple double-integrator agents. It is assumed that the sampling intervals are nonuniform and the communication topology is dynamically changing. By employing the tools of nonnegative matrix theory and graph theory, it is proved that consensus can be reached if the communication digraph contains a directed spanning tree jointly and the sampling intervals are restricted to a feasible region with respect to the control gain and the max in-degree of the associated communication digraph. A numerical example is provided to illustrate the theoretical result.