Jingqiu Zhou

Jingqiu Zhou

Auto-generated profile, based on publicly available information

Jingqiu Zhou

AAE, Purdue University, West Lafayette, Indiana United States of America 47906

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
22 January 2019 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
XWXuan Wang
Xuan Wang
JZJingqiu Zhou
Jingqiu Zhou
SMShaoshuai Mou
Shaoshuai Mou
MCMartin J. Corless
Martin J. Corless

30 July 2019 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
JZJingqiu Zhou
Jingqiu Zhou
XWXuan Wang
Xuan Wang
SMShaoshuai Mou
Shaoshuai Mou
BABrian D.O. Anderson
Brian D.O. Anderson
This paper proposes a continuous-time distributed algorithm for multi-agent networks to achieve a solution with the minimum $l_1$ -norm to under-determined linear equations. The proposed algorithm comes from a combination of the Filippov set-valued map with the projection-consensus flow. Given the underlying network is undirected and fixed, it is shown that the proposed algorithm drives all agents' individual states to converge in finite time to a common value, which is the minimum $l_1$ -norm solution.

28 September 2017 in arXiv
Verified
Preprint
Open access
PDF file
JZJingqiu Zhou
Jingqiu Zhou
XWXuan Wang
Xuan Wang
SMShaoshuai Mou
Shaoshuai Mou
BABrian D.O. Anderson
Brian D.O. Anderson
This paper proposes distributed algorithms for multi-agent networks to achieve a solution in finite time to a linear equation $Ax=b$ where $A$ has full row rank, and with the minimum $l_1$-norm in the underdetermined case (where $A$ has more columns than rows). The underlying network is assumed to be undirected and fixed, and an analytical proof is provided for the proposed algorithm to drive all agents' individual states to converge to a common value, viz a solution of $Ax=b$, which is the minimum $l_1$-norm solution in the underdetermined case. Numerical simulations are also provided as validation of the proposed algorithms.

28 September 2017 in arXiv
Verified
Preprint
Open access
PDF file
XWXuan Wang
Xuan Wang
JZJingqiu Zhou
Jingqiu Zhou
SMShaoshuai Mou
Shaoshuai Mou
MCMartin J. Corless
Martin J. Corless
A distributed discrete-time algorithm is proposed for multi-agent networks to achieve a common least squares solution of a group of linear equations, in which each agent only knows some of the equations and is only able to receive information from its nearby neighbors. For fixed, connected, and undirected networks, the proposed discrete-time algorithm results in each agents solution estimate to converging exponentially fast to the same least squares solution. Moreover, the convergence does not require careful choices of time-varying small step sizes.