Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Behaviors of networks with antagonistic interactions and switching topologies
KTH, School of Electrical Engineering (EES), Automatic Control. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.ORCID iD: 0000-0001-9940-5929
Show others and affiliations
2016 (English)In: Automatica, ISSN 0005-1098, E-ISSN 1873-2836, Vol. 73, 110-116 p.Article in journal (Refereed) Published
Abstract [en]

In this paper, we study the discrete-time consensus problem over networks with antagonistic and cooperative interactions. A cooperative interaction between two nodes takes place when one node receives the true state of the other while an antagonistic interaction happens when the former receives the opposite of the true state of the latter. We adopt a quite general model where the node communications can be either unidirectional or bidirectional, the network topology graph may vary over time, and the cooperative or antagonistic relations can be time-varying. It is proven that, the limits of all the node states exist, and the absolute values of the node states reach consensus if the switching interaction graph is uniformly jointly strongly connected for unidirectional topologies, or infinitely jointly connected for bidirectional topologies. These results are independent of the switching of the interaction relations. We construct a counterexample to indicate a rather surprising fact that quasi-strong connectivity of the interaction graph, i.e., the graph contains a directed spanning tree, is not sufficient to guarantee the consensus in absolute values even under fixed topologies. Based on these results, we also propose sufficient conditions for bipartite consensus to be achieved over the network with joint connectivity. Finally, simulation results using a discrete-time Kuramoto model are given to illustrate the convergence results showing that the proposed framework is applicable to a class of networks with general nonlinear dynamics.

Place, publisher, year, edition, pages
PERGAMON-ELSEVIER SCIENCE LTD , 2016. Vol. 73, 110-116 p.
Keyword [en]
Network behavior, Antagonistic interactions, Switching topologies
National Category
Communication Systems
Identifiers
URN: urn:nbn:se:kth:diva-196379DOI: 10.1016/j.automatica.2016.06.022ISI: 000385327900014ScopusID: 2-s2.0-84986596584OAI: oai:DiVA.org:kth-196379DiVA: diva2:1046582
Note

QC 20161114

Available from: 2016-11-14 Created: 2016-11-14 Last updated: 2016-11-17Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Johansson, Karl H.
By organisation
Automatic ControlACCESS Linnaeus Centre
In the same journal
Automatica
Communication Systems

Search outside of DiVA

GoogleGoogle Scholar

Altmetric score

Total: 12 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf