Search NASA⌕ Search

Engineering topics

Liu, Yajing

Publications and source records attributed to Liu, Yajing.

Multiarea Distribution System State Estimation via Distributed Tensor Completion

Here, this paper proposes a model-free distribution system state estimation method based on tensor completion using canonical polyadic decomposition. In particular, we consider a setting where the network is divided into multiple areas. The measured physical quantities at buses located in the same area are processed by an area controller. A three-way tensor is constructed to collect these measured quantities. The measurements are analyzed locally to recover the full state information of the network. A distributed closed-form iterative algorithm based on the alternating direction method of multipliers is developed to obtain the low-rank factors of the whole network state tensor where information exchange happens only between neighboring areas. The convergence properties of the distributed algorithm and the sufficient conditions on the number of samples for each smaller network that guarantee the identifiability of the factors of the state tensor are presented. To demonstrate the efficacy of the proposed algorithm and to check the identifiability conditions, numerical simulations are carried out using the IEEE 123-bus system and a large-scale real utility feeder.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Grid Optimization with Solar (GO-Solar)

This presentation discusses the goal to accelerate industry adoption of ADMS to improve normal operations with high DERs and improve resilience and reliability.

GO-Solar↗

Multi-Area Model-Free State Estimation via Distributed Tensor Decomposition

This paper proposes a model-free method for distribution system state estimation based on tensor completion using canonical polyadic decomposition. In particular, we consider a setting where the network is divided into multiple areas. The measured physical quantities at buses located in the same area are processed by an area controller. A third-order tensor is constructed to collect these measured quantities. The measurements are analyzed locally to recover the full state information of the network. A closed-form iterative algorithm based on the alternating direction method of multipliers is developed to obtain the low-rank factors of the whole network state tensor where information exchange happens only between neighboring areas. To demonstrate the efficacy of the developed algorithm, numerical simulations are carried out using an IEEE test system.

alternating direction method of multipliers↗

Analyzing the Effects of Cyberattacks on Distribution System State Estimation

Key components of power systems—such as energy management systems, automatic generation control, and state estimation—are under serious vulnerability from cyberattacks. Cyber threats in electric grids have increased significantly because of the increased interconnectivity of supervisory control and data acquisition systems and public network infrastructure. As the penetration level of distributed energy resources increases, it is imperative to employ system-monitoring techniques such as state estimation for the reliable operation of distribution systems. Recently, multiple methods have been developed that exploit the low rank property of distribution system state matrix and are robust to bad data, such as matrix completion. This paper analyzes the impact of various realistic cyberattack scenarios on matrix completion. Realistic cyberattack scenarios are converted into data corruption models that are used in an extensive simulation of a custom IEEE 123-bus system.

41 EE - Solar Energy Technologies Office (EE-4S)↗

Decentralized Low-Rank State Estimation for Power Distribution Systems

This article considers the low-observability state estimation problem in power distribution networks and develops a decentralized state estimation algorithm leveraging the matrix completion methodology. Matrix completion has been shown to be an effective technique in state estimation that exploits the low dimensionality of the power system measurements to recover missing information. This technique can utilize an approximate (linear) load flow model, or it can be used with no physical models in a network where no information about the topology or line admittance is available. The direct application of matrix completion algorithms requires solving a semi-definite programming (SDP) problem, which becomes computationally challenging for large networks. We therefore develop a decentralized algorithm that capitalizes on the popular proximal alternating direction method of multipliers (proximal ADMM). The method allows us to distribute the computation among different areas of the network, leading to a scalable algorithm. By doing all computations at individual control areas and only communicating with neighboring areas, the algorithm eliminates the need for data to be sent to a central processing unit and thus increases efficiency and contributes to the goal of autonomous control of distribution networks. We illustrate the advantages of the proposed algorithm numerically using standard IEEE test cases.

41 EE - Solar Energy Technologies Office (EE-4S)↗

An Integrated Paradigm for the Management of Delivery Risk in Electricity Markets: From Batteries to Insurance and Beyond

This presentation discusses the objectives to quantify flexibility from distributed energy resources (DERs) through DER risk scores, increase the number of hedging options for resources with uncertain output by tapping system-wide resources through a system-wide flexibility auction, and create transparent flexibility prices ahead of time, alleviating the need for forecasting of balancing prices.

27 ARPA - Advanced Research Projects Agency-Energy↗

Matrix Completion Using Alternating Minimization for Distribution System State Estimation

This paper examines the problem of state estimation in power distribution systems under low-observability conditions. The recently proposed constrained matrix completion method which combines the standard matrix completion method and power flow constraints has been shown to be effective in estimating voltage phasors under low-observability conditions using single-snapshot information. However, the method requires solving a semidefinite programming (SDP) problem, which becomes computationally infeasible for large systems and if multiple-snapshot (time-series) information is used. This paper proposes an efficient algorithm to solve the constrained matrix completion problem with time-series data. This algorithm is based on reformulating the matrix completion problem as a bilinear (non-convex) optimization problem, and applying the alternating minimization algorithm to solve this problem. This paper proves the summable convergence of the proposed algorithm, and demonstrates its efficacy and scalability via IEEE 123-bus system and a real utility feeder system. This paper also explores the value of adding more data from the history in terms of computation time and estimation accuracy.

41 EE - Solar Energy Technologies Office (EE-4S)↗

Analyzing the Effects of Cyberattacks on Distribution System State Estimation: Preprint

Key components of power systems—such as energy management systems, automatic generation control, and state estimation—are under serious vulnerability from cyber attacks. Cyber threats in electric grids have increased significantly because of the increased interconnectivity of supervisory control and data acquisition systems and public network infrastructure. As the penetration level of distributed energy resources increases, it is imperative to employ system-monitoring techniques such as state estimation for the reliable operation of distribution systems. Recently, multiple methods have been developed that exploit the low rank property of distribution system state matrix and are robust to bad data, such as matrix completion. This paper analyzes the impact of various realistic cyber attack scenarios on matrix completion. Realistic cyber attack scenarios are converted into data corruption models that are used in an extensive simulation of a custom IEEE 123-bus system.

41 EE - Solar Energy Technologies Office (EE-4S)↗

Matrix Completion Using Alternating Minimization for Distribution System State Estimation: Preprint

This paper examines the problem of state estimation in power distribution systems under low-observability conditions. The recently proposed constrained matrix completion method which combines the standard matrix completion method and power flow constraints has been shown to be effective in estimating voltage phasors under low-observability conditions using single-snapshot information. However, the method requires solving a semidefinite programming (SDP) problem, which becomes computationally infeasible for large systems and if multiple-snapshot (time-series) information is used. This paper proposes an efficient algorithm to solve the constrained matrix completion problem with time-series data. This algorithm is based on reformulating the matrix completion problem as a bilinear (non-convex) optimization problem, and applying the alternating minimization algorithm to solve this problem. This paper proves the summable convergence of the proposed algorithm, and demonstrates its efficacy and scalability via IEEE 123-bus system and a real utility feeder system. This paper also explores the value of adding more data from the history in terms of computation time and estimation accuracy.

41 EE - Solar Energy Technologies Office (EE-4S)↗

Model-Free State Estimation Using Low-Rank Canonical Polyadic Decomposition

As electric grids experience high penetration levels of renewable generation, fundamental changes are required to address real-time situational awareness. Here, we utilize unique traits of tensors to devise a model-free situational awareness and energy forecasting framework for distribution networks. This work formulates the state of the network at multiple time instants as a three-way tensor; hence, recovering full state information of the network is tantamount to estimating all the values of the tensor. Given measurements received from µphasor measurement units and/or smart meters, the recovery of unobserved quantities is carried out using the low-rank canonical polyadic decomposition of the state tensor—that is, the state estimation task is posed as a tensor imputation problem utilizing observed patterns in measured (sampled) quantities. Two structured sampling schemes are considered, namely, asynchronous slab and fiber sampling. For both schemes, we present sufficient conditions on the number of sampled slabs and fibers that guarantee identifiability of the factors of the state tensor. Numerical results demonstrate the ability of the proposed framework to achieve high estimation accuracy in multiple sampling scenarios.

42 ENGINEERING↗

A General Framework for Bounding Approximate Dynamic Programming Schemes

For years, there has been interest in approximation methods for solving dynamic programming problems, because of the inherent complexity in computing optimal solutions characterized by Bellman’s principle of optimality. A wide range of approximate dynamic programming (ADP) methods now exists. It is of great interest to guarantee that the performance of an ADP scheme be at least some known fraction, say ß , of optimal. This letter introduces a general approach to bounding the performance of ADP methods, in this sense, in the stochastic setting. The approach is based on new results for bounding greedy solutions in string optimization problems, where one has to choose a string (ordered set) of actions to maximize an objective function. This bounding technique is inspired by submodularity theory, but submodularity is not required for establishing bounds. Instead, the bounding is based on quantifying certain notions of curvature of string functions; the smaller the curvatures the better the bound. The key insight is that any ADP scheme is a greedy scheme for some surrogate string objective function that coincides in its optimal solution and value with those of the original optimal control problem. The ADP scheme then yields to the bounding technique mentioned above, and the curvatures of the surrogate objective determine the value ß of the bound. The surrogate objective and its curvatures depend on the specific ADP.

discrete event systems↗

Submodular optimization problems and greedy strategies: A survey

The greedy strategy is an approximation algorithm to solve optimization problems arising in decision making with multiple actions. How effective is the greedy strategy compared to the optimal solution? In this survey, we mainly consider two classes of optimization problems where the objective function is submodular. The first is set submodular optimization, which is to choose a set of actions to optimize a set submodular objective function, and the second is string submodular optimization, which is to choose an ordered set of actions to optimize a string submodular function. Our emphasis here is on performance bounds for the greedy strategy in submodular optimization problems. Specifically, we review performance bounds for the greedy strategy, more general and improved bounds in terms of curvature, performance bounds for the batched greedy strategy, and performance bounds for Nash equilibria.

97 MATHEMATICS AND COMPUTING↗

Effect of V{sub Zn}/V{sub O} on Stability, Magnetism, and Electronic Characteristic of Oxygen Ions for Li-Doped ZnO

The effects of Zn/O vacancy (V{sub Zn}/V{sub O}) and different proportions of Li/V{sub Zn} on the magnetism of Li-doped ZnO are analyzed through first-principle calculation by using generalized gradient approximation+ U (GGA + U) under density functional theory. Results reveal that Li-doped ZnO with V{sub Zn} can realize ferromagnetic long-range order and has a Curie temperature above room temperature. Under different proportions of Li/V{sub Zn} (i.e., 1:1, 1:2, and 2:2) in ZnO (2 × 2 × 4), the doping system containing 2Li/2V{sub Zn} (Zn{sub 28}Li{sub 2}O{sub 32}) shows the greatest magnetic moment and the smallest differential charge density. These characteristics pave the way for enhancing the magnetic properties of dilute magnetic semiconductors. The oxygen atoms in Zn{sub 28}Li{sub 2}O{sub 32} show acceptor and donor characteristics and exist in the forms of itinerant electrons (O{sup 1−}) and local electrons (O{sup 2−}), which have different effects on Zn{sub 28}Li{sub 2}O{sub 32} magnetism. The spin-polarization double-exchange effect among the unpaired itinerant electron (O{sup 1−}) orbit, local electron (O{sup 2−}) orbit, and unpaired Zn-3d electron orbit is the origin of magnetism for Li-doped ZnO with V{sub Zn}. By contrast, the doping systems of Li-doped ZnO with V{sub O} are nonmagnetic, rendering such systems inapplicable.

36 MATERIALS SCIENCE↗

Soybean CCA1-like MYB transcription factor GmMYB133 modulates isoflavonoid biosynthesis

Highlights: • A CCA1-like GmMYB133 was functionally characterized as a new positive regulator in isoflavonoid synthesis. • GmMYB133 might form hetero- and homodimers with an isoflavonoid regulator GmMYB176 and itself, respectively. • The subcellular localization of GmMYB133 can be altered by its interaction with 14-3-3 protein. MYB transcription factors play important roles in the regulation of phenylpropanoid biosynthesis. However, the knowledge regarding the roles of CCA1-like MYBs in phenylpropanoid pathway is limited in plants. Previously, we identified 54 CCA1-like proteins in soybean. In the study, a CCA1-like MYB (GmMYB133) was functionally characterized as a positive regulator in isoflavonoid synthesis. GmMYB133 encodes a 330 aa protein featured with one CCA1 conserved motif. Further analysis indicated that the expression pattern of GmMYB133 was near-perfectly correlated with isoflavonoid accumulation as soybean embryos develop. GmMYB133 over-expression promoted the expression of two key isoflavonoid biosynthetic genes (GmCHS8 and GmIFS2) and increased total isoflavonoid content in hairy roots. Protein-protein interaction assays indicated that GmMYB133 might form hetero- and homodimers with an isoflavonoid regulator GmMYB176 and itself, respectively, while the subcellular localization of GmMYB133 can be altered by its interaction with 14-3-3 protein. These findings provided new insights into the functional roles of CCA1-like MYB proteins in the regulation of phenylpropanoid pathway, and will contribute to the future genetic engineering in the improvement of soybean seed quality.

60 APPLIED LIFE SCIENCES↗