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

Zhengquan Yang

dblp:119/0725 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
2since 2021 · last 2021
—ORCID · conflict

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

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

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.

Theoretical computer science
1 paper
Mathematical optimization · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 100%

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

TopicWeightPapersLastEvidence papers
Distributed systems
distributed coordination
0.512021
Finite-time distributed projection scheme for intersections of convex sets · Sci. China Inf. Sci. 2021
Mathematical optimization › continuous optimization
convex optimization
0.512021
Finite-time distributed projection scheme for intersections of convex sets · Sci. China Inf. Sci. 2021
Mathematical optimization › distributed optimization
distributed convex optimization
0.512021
Finite-time distributed projection scheme for intersections of convex sets · Sci. China Inf. Sci. 2021

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

finite-time projection · 1.0
YearPublicationVenuePosition
2021 Finite-time distributed projection scheme for intersections of convex sets
Zhengquan Yang, Qing Zhang 0005, Zengqiang Chen 0001
Sci. China Inf. Sci.1
2021 Finite-time formation control for first-order multi-agent systems with region constraints
abstract
In this study, the finite-time formation control of multi-agent systems with region constraints is studied. Multiple agents have first-order dynamics and a common target area. A novel control algorithm is proposed using local information and interaction. If the communication graph is undirected and connected and the desired framework is rigid, it is proved that the controller can be used to solve the formation problem with a target area. That is, all agents can enter the desired region in finite time while reaching and maintaining the desired formation shapes. Finally, a numerical example is given to illustrate the results.
Zhengquan Yang, Xiaofang Pan, Qing Zhang 0005, Zengqiang Chen 0001
Frontiers Inf. Technol. Electron. Eng.1
2018 TOA Estimation Algorithm Based on Noncoherent Detection in IR-UWB System
Yuanfa Ji, Jianguo Song, Xiyan Sun, Suqing Yan, Zhengquan Yang
WASA5
2016 Adaptive flocking of heterogeneous multi-agents systems with nonlinear dynamics
Qing Zhang 0005, Yaru Hao, Zhengquan Yang, Zengqiang Chen 0001
Neurocomputing3