Sign-consensus over cooperative-antagonistic networks with switching topologies

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)21_Publication in refereed journalNot applicablepeer-review

View graph of relations

Author(s)

Related Research Unit(s)

Detail(s)

Original languageEnglish
Pages (from-to)6146-6162
Journal / PublicationInternational Journal of Robust and Nonlinear Control
Volume28
Issue number18
Early online date9 Oct 2018
StatePublished - 1 Dec 2018

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