Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Yutong Li 0001

dblp:55/10759-1 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
3since 2021 · last 2026
0009-0001-3609-5043ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 since 2021Computer networks · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Multi-agent systems · 100%
Network and information security
1 paper
Privacy and data protection · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 100%
Theoretical computer science
1 paper
Mathematical optimization · 100%

Topics — the 4 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Privacy and data protection
privacy-preserving computation
1.012026
On distributed privacy-preserving k-WTA networks · Sci. China Inf. Sci. 2026
Knowledge, reasoning and agents › Multi-agent systems › multi-agent coordination
distributed coordination
0.812024
A Distributed Competitive and Collaborative Coordination for Multirobot Systems · IEEE Trans. Mob. Comput. 2024
Knowledge, reasoning and agents › Multi-agent systems
multi-robot coordination
0.812024
A Distributed Competitive and Collaborative Coordination for Multirobot Systems · IEEE Trans. Mob. Comput. 2024
Mathematical optimization
distributed optimization
0.212024
A Distributed Competitive and Collaborative Coordination for Multirobot Systems · IEEE Trans. Mob. Comput. 2024

Methods — techniques the papers use, named apart from their topics

secure multiparty computation · 2.0recurrent neural dynamics · 1.5optimality theory · 1.5k-winner-take-all · 1.5consensus · 1.5
YearPublicationVenuePosition
2026 On distributed privacy-preserving k-WTA networks
Yutong Li 0001, Kewei Zhang 0001, Yongji Guan, Long Jin 0001
Sci. China Inf. Sci.1
2024 Fuzzy k-Winner-Take-All Network for Competitive Coordination in Multirobot Systems
abstract
This study focuses on exploring the solution to coordination in multirobot systems faced with competitive states, where the competition behavior can be described as a$k$-winner-take-all ($k$WTA) operation. To address the$k$WTA problem, a fuzzy$k$WTA (F-$k$WTA) network is proposed, which incorporates a fuzzy mechanism into the network that adapts the convergence rate of the F-$k$WTA network based on the error, leading to exceptional convergence behavior. In addition, a set of activation functions are provided to further enhance the capabilities of the F-$k$WTA network. In addition, the proposed network demonstrates remarkable convergence performance, as illustrated through both theorems and simulations. Finally, the practical application value of the F-$k$WTA network is demonstrated on a multirobot system.
Long Jin 0001, Yutong Li 0001, Xin Luo 0001
IEEE Trans. Fuzzy Syst.2
2024 A Distributed Competitive and Collaborative Coordination for Multirobot Systems
abstract
Enlightened by competitive and collaborative coordination behaviors widely observed in natural swarm systems, this work emphasizes these coordinating modes in multirobot systems and optimizes system stability along with resource utilization. Then, schemes are constructed to describe and model these two modes, where a$k$-winner-take-all concept is introduced as the driving principle of multirobot competition. In addition, a distributed coordination approach is established to effectively handle the above schemes aided with optimality theory, which is developed by a fusion of a recurrent neural dynamics solver and a distributed solver. The former is a single-layer neural dynamics model with a simple structure, and the latter transforms the involved global information to a distributed type via consensus. Both of them are carried out in the discrete-time domain to fit the actual application. Finally, the convergence and stability of the proposed coordination approach are proved via theoretical analysis and further demonstrated through simulations and experiments.
Yutong Li 0001, Yimeng Qi, Long Jin 0001
IEEE Trans. Mob. Comput.2