Guannan Qu

Guannan Qu

Auto-generated profile, based on publicly available information

Guannan Qu

Department of Electrical and Computer Engineering, Carnegie Mellon University, Pittsburgh, PA, USA

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

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

Representative Publications

View All Publications
26 April 2017 in IEEE Transactions on Control of Network Systems
Verified
Journal Article
Closed access
GQGuannan Qu
Guannan Qu
NLNa Li
Na Li
There has been a growing effort in studying the distributed optimization problem over a network. The objective is to optimize a global function formed by a sum of local functions, using only local computation and communication. The literature has developed consensus-based distributed (sub)gradient descent (DGD) methods and has shown that they have the same convergence rate $O(\frac{\log t}{\sqrt{t}})$ as the centralized (sub)gradient methods (CGD), when the function is convex but possibly nonsmooth. However, when the function is convex and smooth, under the framework of DGD, it is unclear how to harness the smoothness to obtain a faster convergence rate comparable to CGD's convergence rate. In this paper, we propose a distributed algorithm that, despite using the same amount of communication per iteration as DGD, can effectively harnesses the function smoothness and converge to the optimum with a rate of $O(\frac{1}{t})$ . If the objective function is further strongly convex, our algorithm has a linear convergence rate. Both rates match the convergence rate of CGD. The key step in our algorithm is a novel gradient estimation scheme that uses history information to achieve fast and accurate estimation of the average gradient. To motivate the necessity of history information, we also show that it is impossible for a class of distributed algorithms like DGD to achieve a linear convergence rate without using history information even if the objective function is strongly convex and smooth.

25 February 2022 in IEEE Transactions on Smart Grid
Verified
Journal Article
Closed access
XCXin Chen
Xin Chen
GQGuannan Qu
Guannan Qu
YTYujie Tang
Yujie Tang
SLSteven Low
Steven Low
NLNa Li
Na Li
With large-scale integration of renewable generation and distributed energy resources, modern power systems are confronted with new operational challenges, such as growing complexity, increasing uncertainty, and aggravating volatility. Meanwhile, more and more data are becoming available owing to the widespread deployment of smart meters, smart sensors, and upgraded communication networks. As a result, data-driven control techniques, especially reinforcement learning (RL), have attracted surging attention in recent years. This paper provides a comprehensive review of various RL techniques and how they can be applied to decision-making and control in power systems. In particular, we select three key applications, i.e., frequency regulation, voltage control, and energy management, as examples to illustrate RL-based models and solutions. We then present the critical issues in the application of RL, i.e., safety, robustness, scalability, and data. Several potential future directions are discussed as well.

26 August 2019 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
GQGuannan Qu
Guannan Qu
NLNa Li
Na Li
This paper considers the distributed optimization problem over a network, where the objective is to optimize a global function formed by a sum of local functions, using only local computation and communication. We develop an accelerated distributed Nesterov gradient descent method. When the objective function is convex and $L$ -smooth, we show that it achieves a $O(\frac{1}{t^{1.4-\epsilon }})$ convergence rate for all $\epsilon \in (0,1.4)$ . We also show the convergence rate can be improved to $O(\frac{1}{t^2})$ if the objective function is a composition of a linear map and a strongly convex and smooth function. When the objective function is $\mu$ -strongly convex and $L$ -smooth, we show that it achieves a linear convergence rate of $O([ 1 - C (\frac{\mu }{L})^{5/7} ]^t)$ , where $\frac{L}{\mu }$ is the condition number of the objective, and $C>0$ is some constant that does not depend on $\frac{L}{\mu }$ .

28 June 2018 in IEEE Control Systems Letters
Verified
Journal Article
Closed access
GQGuannan Qu
Guannan Qu
NLNa Li
Na Li
Continuous time primal-dual gradient dynamics (PDGD) that find a saddle point of a Lagrangian of an optimization problem have been widely used in systems and control. While the global asymptotic stability of such dynamics has been well-studied, it is less studied whether they are globally exponentially stable. In this letter, we study the PDGD for convex optimization with strongly convex and smooth objectives and affine equality or inequality constraints, and prove global exponential stability for such dynamics. Bounds on decaying rates are provided.

29 July 2019 in IEEE Transactions on Power Systems
Verified
Journal Article
Closed access
GQGuannan Qu
Guannan Qu
NLNa Li
Na Li
In this paper, we propose a distributed voltage control in power distribution networks through reactive power compensation. The proposed control can (i) operate in a distributed fashion where each bus makes its decision based on local voltage measurements and communication with neighboring buses, (ii) always satisfy the reactive power capacity constraint, (iii) drive the voltage magnitude into an acceptable range, and (iv) minimize an operational cost. We also perform various numerical case studies to demonstrate the effectiveness and robustness of the controller using the nonlinear power flow model.

20 October 2017 in IEEE Transactions on Smart Grid
Verified
Journal Article
Closed access
XTXiaoqi Tan
Xiaoqi Tan
GQGuannan Qu
Guannan Qu
BSBo Sun
Bo Sun
NLNa Li
Na Li
DTDanny H. K. Tsang
Danny H. K. Tsang
A battery charging station (BCS) is a charging facility that supplies electric energy for recharging electric vehicles’ depleted batteries (DBs). A BCS has a certain number of charging bays and maintains a dynamic inventory of fully-charged batteries (FBs). This paper studies a BCS scheduling (BCSS) problem whose target is to schedule the charging processes of the charging bays such that the charging cost is minimized while satisfying the FB demand. Specifically, the BCSS problem has two types of operations: i) loading DBs into the charging bays and then unloading them to the FB inventory when they are fully-charged, and ii) controlling the charging rate of each charging bay. We formulate the BCSS problem as a mixed-integer program with quadratic battery degradation cost. A generalized Benders decomposition algorithm is then developed to solve the problem efficiently. The salience of the developed algorithm is that i) each charging bay can solve its own subproblem separately, and ii) each subproblem can be further partitioned into multiple independent and identically-structured quadratic programming problems, and thus the algorithm facilitates an efficient parallel implementation. We perform extensive real data simulation to validate the optimization model and demonstrate the efficiency of the proposed algorithm.