Zhiyuan Liu

Zhiyuan Liu

Auto-generated profile, based on publicly available information

Zhiyuan Liu

University of Colorado,Boulder, USA

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

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

Representative Publications

View All Publications
12 May 2020 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
XZXinyang Zhou
Xinyang Zhou
MFMasoud Farivar
Masoud Farivar
ZLZhiyuan Liu
Zhiyuan Liu
LCLijun Chen
Lijun Chen
SLSteven H. Low
Steven H. Low
The increasing penetration of renewable and distributed energy resources in distribution networks calls for real-time and distributed voltage control. In this article, we investigate local Volt/VAR control with a general class of control functions, and show that the power system dynamics with nonincremental local voltage control can be seen as a distributed algorithm for solving a well-defined optimization problem (reverse engineering). The reverse engineering further reveals a fundamental limitation of the nonincremental voltage control: the convergence condition is restrictive and prevents better voltage regulation at equilibrium. This motivates us to design two incremental local voltage control schemes based on the subgradient and pseudo-gradient algorithms, respectively, for solving the same optimization problem (forward engineering). The new control schemes decouple the dynamical property from the equilibrium property, and have much less restrictive convergence conditions. This article presents another step toward developing a new foundation—network dynamics as optimization algorithms—for distributed real-time control and optimization of future power networks.

22 June 2020 in IEEE Transactions on Smart Grid
Verified
Journal Article
Closed access
XZXinyang Zhou
Xinyang Zhou
ZLZhiyuan Liu
Zhiyuan Liu
YGYi Guo
Yi Guo
CZChanghong Zhao
Changhong Zhao
JHJianqiao Huang
Jianqiao Huang
LCLijun Chen
Lijun Chen
The increasing distributed and renewable energy resources and controllable devices in distribution systems make fast distribution system state estimation (DSSE) crucial in system monitoring and control. We consider a large multi-phase distribution system and formulate DSSE as a weighted least squares (WLS) problem. We divide the large distribution system into smaller areas of subtree structure, and by jointly exploring the linearized power flow model and the network topology, we propose a gradient-based multi-area algorithm to exactly and efficiently solve the WLS problem. The proposed algorithm enables distributed and parallel computation of the state estimation problem without compromising any performance. Numerical results on a 4,521-node test feeder show that the designed algorithm features fast convergence and accurate estimation results. Comparison with traditional Gauss-Newton method shows that the proposed method has much better performance in distribution systems with a limited amount of reliable measurement. The real-time implementation of the algorithm tracks time-varying system states with high accuracy.

1 July 2019
Verified
Conference Paper
Open access
XZXinyang Zhou
Xinyang Zhou
ZLZhiyuan Liu
Zhiyuan Liu
WWWenbo Wang
Wenbo Wang
CZChanghong Zhao
Changhong Zhao
FDFei Ding
Fei Ding
LCLijun Chen
Lijun Chen

11 November 2020
Verified
Conference Paper
Open access
XZXinyang Zhou
Xinyang Zhou
YCYue Chen
Yue Chen
ZLZhiyuan Liu
Zhiyuan Liu
CZChanghong Zhao
Changhong Zhao
LCLijun Chen
Lijun Chen
Solving optimal power flow (OPF) problems for large distribution networks incurs high computational complexity. We consider a large multi-phase distribution network of tree topology with a deep penetration of active devices. We divide the network into collaborating areas featuring subtree topology and subareas featuring subsubtree topology. We design a multilevel implementation of the primal-dual gradient algorithm to solve the voltage regulation OPF problems while preserving nodal voltage information and topological information within areas and subareas. Numerical results on a 4,521-node system verify that the proposed algorithm can significantly improve the computational speed without compromising any optimality.

14 September 2023
Verified
Conference Paper
Open access
HWHuazheng Wang
Huazheng Wang
HXHaifeng Xu
Haifeng Xu
CLChuanhao Li
Chuanhao Li
ZLZhiyuan Liu
Zhiyuan Liu
HWHongning Wang
Hongning Wang
Contextual bandit algorithms have been popularly used to address interactive recommendation, where the users are assumed to be cooperative to explore all recommendations from a system. In this paper, we relax this strong assumption and study the problem of incentivized exploration with myopic users, where the users are only interested in recommendations with their currently highest estimated reward. As a result, in order to obtain long-term optimality, the system needs to offer compensation to incentivize the users to take the exploratory recommendations. We consider a new and practically motivated setting where the context features employed by the user are more informative than those used by the system: for example, features based on users’ private information are not accessible by the system. We develop an effective solution for incentivized exploration under such an information gap, and prove that the method achieves a sublinear rate in both regret and compensation. We theoretically and empirically analyze the added compensation due to the information gap, compared with the case where the system has access to the same context features as the user does, i.e., without information gap. Moreover, we also provide a compensation lower bound of this problem.