Distributed Winner-Take-All in Dynamic Networks

This paper is concerned with the winner-take-all (WTA) problem on networks. We propose the first distributed protocol to address this problem dynamically. This protocol features strong nonlinearity. Theoretical analysis reveals that it contains invariant quantities, symmetric solutions, and multiple...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on automatic control Vol. 62; no. 2; pp. 577 - 589
Main Authors Li, Shuai, Zhou, MengChu, Luo, Xin, You, Zhu-Hong
Format Journal Article
LanguageEnglish
Published New York IEEE 01.02.2017
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects
Competitive control
consensus
Convergence
cooperative control
distributed control
dynamic networks
Heuristic algorithms
Mathematical model
Modeling
Network topology
networked control system
Networks
Protocols
Stability
Topology
winner-take-all
Online AccessGet full text

Cover

More Information
Summary:This paper is concerned with the winner-take-all (WTA) problem on networks. We propose the first distributed protocol to address this problem dynamically. This protocol features strong nonlinearity. Theoretical analysis reveals that it contains invariant quantities, symmetric solutions, and multiple equilibrium points. By leveraging these properties, this work proves the instability of its non-WTA solutions, and global convergence to the WTA solution via Lyapunov theory. Two simulations over networks with 10 and 200 nodes, respectively, are conducted. Simulation results have well verified the theoretical conclusions drawn in this paper.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0018-9286
1558-2523
DOI:10.1109/TAC.2016.2578645