.png){kind=icon}
返回
A Distributed k-Winners-Take-All Model With Binary Consensus Protocols
.png){kind=icon}
PRE
AI
DOI：10.1109/TCYB.2023.3328716.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This article concentrates on solving the k-winner-stake-all (kWTA) problem with large-scale inputs in a distributed setting. We propose a multiagent system with a relatively simple structure, in which each agent is equipped with a 1-D system and interacts with others via binary consensus protocols. That is, only the signs of the relative state information between neighbors are required. By virtue of differential inclusion theory, we prove that the system converges from arbitrary initial states. In addition, we derive the convergence rate as O(1/t). Furthermore, in comparison to the existing models, we introduce a novel comparison filter to eliminate the resolution ratio requirement on the input signal, that is, the difference between the kth and (k + 1)th largest inputs must be larger than a positive threshold. As a result, the proposed distributed kWTA model is capable of solving the kWTA problem, even when more than two elements of the input signal share the same value. Finally, we validate the effectiveness of the theoretical results through two simulation examples.
Keyword:
Binary consensus protocol
distributed optimization
exact penalty method
k-winners-take-all
multiagent system
期刊
IF:
10.5
论文数:
1.1W
被引数:
5.0W
机构
引用论文
Developmental Progression to Infectivity in
Trypanosoma brucei
Triggered by an RNA-Binding Protein.png)
Science
OAAI
ScienceIF0
OAAI分享收藏分享收藏分享收藏Optoelectronic terahertz radiation system based on femtosecond 1 µm laser pulses and GaBiAs detector
PREAI
分享收藏
查看更多内容