Skip to Main Content
This paper investigates the consensus problem of multi-agent networks with aperiodic sampled communication and nonuniform time-delays under switching topology. A distributed impulsive algorithm is introduced to achieve consensus, where only position measurements are utilized. It is shown that under certain assumptions upon the sampling intervals, the diagonal elements of Laplace matrix and the control gains, consensus of the controlled multi-agent network is achieved if the communication graph has a spanning tree jointly. A numerical example is given to illustrate the effectiveness of the proposed algorithm.