DocumentCode
1732183
Title
Average dwell-time conditions of switching information topologies for consensus of linear multi-agent systems
Author
Chen Yangzhou ; Zhang Yaxiao ; He Zhonghe ; Ge Yanrong
Author_Institution
Coll. of Electron. Inf. & Control Eng., Beijing Univ. of Technol., Beijing, China
fYear
2013
Firstpage
7115
Lastpage
7120
Abstract
In this paper, we study the consensus problem of linear multi-agent systems (LMAS) in directed networks with switching information topology. The consensus problem is transformed into the partial stability problem of a corresponding auxiliary system by a linear transformation. For a pre-given set of topologies, We address two cases: 1) The LMAS achieves the consensus under each fixed information topology in this set; 2) The LMAS achieves the consensus under some information topologies in this set. For both cases, we present sufficient conditions that sustain the consensus of the LMAS with switching topology under an average dwell time scheme, respectively. Simulation results are also given to demonstrate the effectiveness of the theoretical results.
Keywords
directed graphs; linear systems; multi-agent systems; network theory (graphs); LMAS; auxiliary system; average dwell time scheme; average dwell-time conditions; consensus problem; directed networks; fixed information topology; linear multiagent systems; linear transformation; partial stability problem; sufficient conditions; switching information topology; Asymptotic stability; Linear systems; Multi-agent systems; Network topology; Protocols; Switches; Topology; Average dwell-time; Consensus; Linear multi-agent systems (LMAS); Switching information topology;
fLanguage
English
Publisher
ieee
Conference_Titel
Control Conference (CCC), 2013 32nd Chinese
Conference_Location
Xi´an
Type
conf
Filename
6640689
Link To Document