Paper Info
Title
Group Consensus with Switching Topology of Multi-agent Systems
Abstract
In this paper, we consider group consensus problem with switching topology by giving a kind of new protocol in which communication graph weights are all nonnegative. This is also consistent with classic protocols. The sufficient conditions which group consensus under this kind of protocols can reach for both single and second order multi-agent system are obtained. Finally, numerical examples are given to illustrate our theoretical results.
Year
DOI
Venue
2013
10.1109/CIS.2013.68
CIS
Keywords
Field
DocType
sufficient condition,communication graph weight,classic protocol,new protocol,group consensus,group consensus problem,theoretical result,switching topology,order multi-agent system,numerical example,multi-agent systems,group theory,directed graphs
Consensus,Topology,Graph,Computer science,Group theory,Continuous time system,Directed graph,Multi-agent system,Uniform consensus
Conference
Citations 
PageRank 
References 
0
0.34
5
Authors
4
Name
Order
Citations
PageRank
Xin-Lei Feng131.45
Xiao-Li Yang200.34
Zhi-He Zhang311.73
Zhongwei Si4585.87