Qingling Wang

Dr. Qingling Wang


Research Focus & Metrics

Academic Career Length

16Years (2011-Present)

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

Representative Publications

View All Publications
24 August 2018 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
QWQingling Wang
Qingling Wang
HPHaris Psillakis
Haris Psillakis
CSChangyin Sun
Changyin Sun
Existing results on cooperative control of multi-agent systems with unknown control directions require that the underlying topology is either fixed with a strongly connected graph or switching between different strongly connected graphs. Furthermore, in most cases the graph is assumed to be balanced. This paper proposes a new class of nonlinear PI based algorithms to relax these requirements and allow for unbalanced and switching topologies having a jointly strongly connected basis. This is made possible for single-integrator (SI) and double-integrator (DI) agents with non-identical unknown control directions by a suitable selection of the distributed nonlinear PI functions. Moreover, as a special case, the proposed algorithms are applied to strongly connected and fixed graphs. Finally, simulation examples are given to show the validity of our theoretical results.

13 March 2018 in IEEE Transactions on Systems, Man, and Cybernetics: Systems
Verified
Journal Article
Closed access
QWQingling Wang
Qingling Wang
CSChangyin Sun
Changyin Sun
This paper solves the adaptive consensus problem for first-order linearly parameterized agents with completely nonidentical unknown high-frequency gain signs under directed graphs. A new class of Nussbaum-type function-based algorithms are proposed to handle the unknown high-frequency gain signs adaptively and cooperatively. It is shown that if the underlying topology is a fixed graph with strongly connected or switching topologies having a jointly strongly connected basis, the first-order linearly parameterized agents with nonidentical unknown high-frequency gain signs can achieve asymptotic consensus. Finally, the effectiveness of proposed algorithms are verified by one simulation example.

1 February 2014 in Systems & Control Letters
Verified
Journal Article
Closed access
QWQingling Wang
Qingling Wang
CYChangbin Yu
Changbin Yu
HGHuijun Gao
Huijun Gao

2 November 2021 in IEEE Transactions on Signal Processing
Verified
Journal Article
Closed access
YSYanxu Su
Yanxu Su
QWQingling Wang
Qingling Wang
CSChangyin Sun
Changyin Sun
Distributed primal-dual methods have been widely used for solving large-scale constrained optimization problems. The majority of existing results focus on the problems with decoupled constraints. Some recent works have studied the problems subject to separable globally coupled constraints. This paper considers the distributed optimization problems with globally coupled constraints over networks without requiring the separability of the globally coupled constraints. This is made possible by the local estimates of the constraint violations. For solving such a problem, we propose a primal-dual algorithm in the augmented Lagrangian framework, combining the average consensus technique. We first establish a non-ergodic convergence rate of $\mathcal {O}(1/k)$ in terms of the objective residual for solving a distributed constrained convex optimization problem, where $k$ is the iteration counter. Specifically, the global objective function is the aggregate of the local convex and possibly non-smooth costs, and the coupled constraint is the sum of the local linear equality constraints. The numerical results illustrate the performance of the proposed method.

7 August 2023 in IEEE Transactions on Network Science and Engineering
Verified
Journal Article
Closed access
WZWenbo Zhu
Wenbo Zhu
QWQingling Wang
Qingling Wang
This paper investigates distributed finite-time optimization problems for first-order multi-agent systems (MASs) with time-varying cost functions under arbitrary strongly connected digraphs. The objective is to seek the minimizer of the sum of cost functions within finite-time, where each cost function is only known by its corresponding agent. In order to realize the above optimization goal, by using finite-time stability theory and graphs theory, we propose a new class of distributed finite-time optimization algorithms which are independent of Hessian information and the partial derivatives of gradient with respect to time. Furthermore, as an application, the proposed distributed algorithms are extend to handle distributed finite-time economic dispatch problems of smart grids, where both the cost functions and loads are time-varying. Finally, simulation examples are illustrated to verify the theoretical results.

18 March 2024 in IEEE/CAA Journal of Automatica Sinica
Verified
Journal Article
Closed access
XWXuerao Wang
Xuerao Wang
QWQingling Wang
Qingling Wang
YSYanxu Su
Yanxu Su
YOYuncheng Ouyang
Yuncheng Ouyang
CSChangyin Sun
Changyin Sun
This paper investigates the tracking control problem for unmanned underwater vehicles (UUVs) systems with sensor faults, input saturation, and external disturbance caused by waves and ocean currents. An active sensor fault-tolerant control scheme is proposed. First, the developed method only requires the inertia matrix of the UUV, without other dynamic information, and can handle both additive and multiplicative sensor faults. Subsequently, an adaptive fault-tolerant controller is designed to achieve asymptotic tracking control of the UUV by employing robust integral of the sign of error feedback method. It is shown that the effect of sensor faults is online estimated and compensated by an adaptive estimator. With the proposed controller, the tracking error and estimation error can asymptotically converge to zero. Finally, simulation results are performed to demonstrate the effectiveness of the proposed method.