Paper Info
Title
Sign-Consensus Of Linear Multi-Agent Systems Over Signed Graphs Using A Fully Distributed Protocol
Abstract
This paper aims at solving the sign-consensus problem of linear multi-agents system, i.e., the signs of all agents' states achieve consensus. The communication network is modeled by a signed directed graph, where both cooperative and competitive interactions coexist among the agents. Each individual agent is assumed to access only the local information, and a fully distributed control protocol is proposed. Using this control protocol, we find that sign consensus can be achieved without requiring the graph to have an eventually positive adjacency matrix.
Year
Venue
Field
2016
2016 IEEE 55TH CONFERENCE ON DECISION AND CONTROL (CDC)
Adjacency matrix,Graph,Telecommunications network,Decentralised system,Linear system,Computer science,Directed graph,Multi-agent system,Theoretical computer science,Distributed computing
DocType
ISSN
Citations 
Conference
0743-1546
0
PageRank 
References 
Authors
0.34
0
3
Name
Order
Citations
PageRank
Ye Jiang181.49
Hongwei Zhang242714.56
Jie Chen3647124.78