Asynchronous consensus of second-order multi-agent systems with aperiodic sampled-data

This paper addresses the asynchronous consensus problem of continuous-time second-order multi-agent systems with aperiodic sampled-data. Based on nonnegative matrix theory and graph theory, sufficient conditions guaranteeing the consensus of system are derived. It is proved that consensus can be reached if the communication digraph is strongly connected and the sampling intervals are restricted to a feasible region with respect to the control gain and the maximum in-degree of the communication digraph. A numerical example is provided to validate the theoretical result.