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

Author

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

Author_Institution

Seventh Res. Div., Beihang Univ. (BUAA), Beijing, China

fYear

2009

fDate

10-12 June 2009

Firstpage

3884

Lastpage

3889

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.

Keywords

continuous time systems; delays; graph theory; linear matrix inequalities; multi-robot systems; topology; average consensus; average consensus problem; continuous-time agent; delayed information; graph theory; jointly-connected topology; linear matrix inequality; Communication switching; Communication system control; Control systems; Delay; Distributed control; Multiagent systems; Network topology; Sufficient conditions; Symmetric matrices; Telecommunication network topology; average consensus; multi-agent systems; switching jointly-connected topologies; time-delay;

fLanguage

English

Publisher

ieee

Conference_Titel

American Control Conference, 2009. ACC '09.

Conference_Location

St. Louis, MO

ISSN

0743-1619

Print_ISBN

978-1-4244-4523-3

Electronic_ISBN

0743-1619

Type

conf

DOI

10.1109/ACC.2009.5160356

Filename

5160356