Distributed winner-take-all in dynamic networks

Document Type

Article

Publication Date

2-1-2017

Abstract

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.

Identifier

85011636363 (Scopus)

Publication Title

IEEE Transactions on Automatic Control

External Full Text Location

https://doi.org/10.1109/TAC.2016.2578645

e-ISSN

15582523

ISSN

00189286

First Page

577

Last Page

589

Issue

2

Volume

62

Grant

G.UA7L

Fund Ref

National Natural Science Foundation of China

This document is currently not available here.

Share

COinS