Average consensus for networks of continuous-time agents with delayed information and jointly-connected topologies

Abstract

This paper investigates average consensus problem in networks of continuous-time agents with delayed information and jointly-connected topologies. A sufficient condition in terms of linear matrix inequalities (LMIs) is given under which all agents asymptotically reach average consensus, where the communication structures vary over time and the corresponding graphs may not be connected. Finally, simulation results are provided to demonstrate the effectiveness of our theoretical results.