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

  • Authors:

  • Peng Lin;Yingmin Jia;Junping Du;Fashan Yu

  • Affiliations:

  • Seventh Research Division, Beihang University, Beijing, P.R.China;Seventh Research Division, Beihang University, Beijing, P.R.China;Beijing Key Laboratory of Intelligent Telecommunications Software and Multimedia, School of Computer Science and Technology, Beijing University of Posts and Telecommunications, Beijing, P.R.China;School of Electrical and Automation, Henan Polytechnic University, Jiaozuo, Henan, P.R.China

  • Venue:
  • ACC'09 Proceedings of the 2009 conference on American Control Conference
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

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.