A $k$-Winners-Take-All $(k\text{WTA})$ Network with Noise Characteristics Captured

Competition-based <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$k-\mathbf{winners}-\mathbf{take}-\mathbf{all}\ \ (k \mathbf{WTA})$</tex> networks play a crucial role in multi-agent systems. However, existing <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$k \mathbf{WTA}$</tex> networks either neglect the impact of noise or only consider simple forms, such as constant noise. In practice, noises often exhibit time-varying and nonlinear characteristics, which can be modeled using nonlinear functions and approximated by high-order polynomials. Such noises pose significant challenges for current <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$k \mathbf{WTA}$</tex> networks, limiting their practical applications. To address this, a <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$k \mathbf{WTA}$</tex>. network with noise characteristics captured <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$(k \mathbf{WTA}-\mathbf{NCC})$</tex> is proposed in this article. Theoretical analyses demonstrate that the residual error of the proposed <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$k\mathbf{WTA}- \mathbf{NCC}$</tex> network converges to zero globally, while simulation results confirm its robustness against polynomial noises. Additionally, a <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$k \mathbf{WTA}$</tex> coordination model is constructed by integrating the proposed network with a consensus estimator to achieve multi-agent tracking tasks. Finally, simulations and physical experiments are conducted further to demonstrate the validity and practicality of the <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$k$</tex> WTA coordination model.

Authors

Institutions

Publication Details

Journal
IEEE/CAA Journal of Automatica Sinica
Published
2025-03-31
DOI
https://doi.org/10.1109/jas.2025.125153
Citations
5
Primary Topic
Interconnection Networks and Systems
Type
article
Field-Weighted Citation Impact
7.44

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A $k$-Winners-Take-All $(k\text{WTA})$ Network with Noise Characteristics Captured

Zhengtai Xie, Yulin Cao, Jiexing Li, Long Jin
5 citations
IEEE/CAA Journal of Automatica Sinica
Interconnection Networks and Systems
7.44
article

A $k$-Winners-Take-All $(k\text{WTA})$ Network with Noise Characteristics Captured

Zhengtai Xie, Yulin Cao, Jiexing Li, Long Jin
article en
5 citations

Abstract

Competition-based <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$k-\mathbf{winners}-\mathbf{take}-\mathbf{all}\ \ (k \mathbf{WTA})$</tex> networks play a crucial role in multi-agent systems. However, existing <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$k \mathbf{WTA}$</tex> networks either neglect the impact of noise or only consider simple forms, such as constant noise. In practice, noises often exhibit time-varying and nonlinear characteristics, which can be modeled using nonlinear functions and approximated by high-order polynomials. Such noises pose significant challenges for current <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$k \mathbf{WTA}$</tex> networks, limiting their practical applications. To address this, a <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$k \mathbf{WTA}$</tex>. network with noise characteristics captured <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$(k \mathbf{WTA}-\mathbf{NCC})$</tex> is proposed in this article. Theoretical analyses demonstrate that the residual error of the proposed <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$k\mathbf{WTA}- \mathbf{NCC}$</tex> network converges to zero globally, while simulation results confirm its robustness against polynomial noises. Additionally, a <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$k \mathbf{WTA}$</tex> coordination model is constructed by integrating the proposed network with a consensus estimator to achieve multi-agent tracking tasks. Finally, simulations and physical experiments are conducted further to demonstrate the validity and practicality of the <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$k$</tex> WTA coordination model.

IEEE/CAA Journal of Automatica SinicaVol. 12(4)
Qinghai Normal University (CN), Lanzhou University (CN)
National Natural Science Foundation of China, Qinghai Normal University, Fundamental Research Funds for the Central Universities
Gender equality
Openalex Percentile: Top 3%
Interconnection Networks and Systems
7.44
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.