DocumentCode
550439
Title
Consensus of discrete-time linear multi-agent systems under switching network topology
Author
Su Youfeng ; Huang Jie
Author_Institution
Dept. of Mech. & Autom. Eng., Chinese Univ. of Hong Kong, Hong Kong, China
fYear
2011
fDate
22-24 July 2011
Firstpage
6469
Lastpage
6474
Abstract
In this paper, we study the consensus problem of discrete-time linear multi-agent systems under switching network topology. Under the assumption that the system matrix is neutrally stable, we will show that the consensus can be achieved via the state feedback protocol provided that the dynamic graph is jointly connected. This result will contain several existing results as special cases.
Keywords
discrete time systems; graph theory; linear systems; matrix algebra; multi-robot systems; network topology; state feedback; switching networks; consensus problem; discrete-time linear multiagent systems; dynamic graph; neutrally stable; state feedback protocol; switching network topology; system matrix; Artificial neural networks; Switches; Consensus; Discrete-time systems; Jointly connected; Multi-agent systems; Switching network;
fLanguage
English
Publisher
ieee
Conference_Titel
Control Conference (CCC), 2011 30th Chinese
Conference_Location
Yantai
ISSN
1934-1768
Print_ISBN
978-1-4577-0677-6
Electronic_ISBN
1934-1768
Type
conf
Filename
6000777
Link To Document