Sign-consensus over cooperative-antagonistic networks with switching topologies
Research output: Journal Publications and Reviews (RGC: 21, 22, 62) › 21_Publication in refereed journal › Not applicable › peer-review
Author(s)
Related Research Unit(s)
Detail(s)
| Original language | English |
|---|---|
| Pages (from-to) | 6146-6162 |
| Journal / Publication | International Journal of Robust and Nonlinear Control |
| Volume | 28 |
| Issue number | 18 |
| Early online date | 9 Oct 2018 |
| Publication status | Published - 1 Dec 2018 |
Link(s)
Abstract
This paper studies sign consensus, a collective behavior of multiagent systems, when both cooperative and antagonistic interactions coexist among agents. By sign consensus, it means that the states of all agents will eventually achieve the same sign but may with different magnitudes. Compared with some recent works on sign-consensus problems, where only fixed graphs are considered and the graph adjacency matrix needs to be eventually positive, this paper allows the graph to be switching over time. Control laws are proposed and analyzed with respect to three classes of switching graphs. Examples illustrate the efficacy of the control algorithms.
Research Area(s)
- multiagent system, sign-consensus, signed graph, switching topology
Citation Format(s)
Sign-consensus over cooperative-antagonistic networks with switching topologies. / Jiang, Ye; Zhang, Hongwei; Chen, Jie.
In: International Journal of Robust and Nonlinear Control, Vol. 28, No. 18, 01.12.2018, p. 6146-6162.Research output: Journal Publications and Reviews (RGC: 21, 22, 62) › 21_Publication in refereed journal › Not applicable › peer-review
