arXiv subjects

Jianhui Wang

Publications and source records attributed to Jianhui Wang.

At least 73 records · Page 4Linked to original sources

arXiv2020

Global Sensitivity Analysis in Load Modeling via Low-rank Tensor

Growing model complexities in load modeling have created high dimensionality in parameter estimations, and thereby substantially increasing associated computational costs. In this paper, a tensor-based method is proposed for identifying composite load modeling (CLM) parameters and for conducting a global sensitivity analysis. Tensor format and Fokker-Planck equations are used to estimate the power output response of CLM in the context of simultaneously varying parameters under their full parameter distribution ranges. The proposed tensor structured is shown as effective for tackling high-dimensional parameter estimation and for improving computational performances in load modeling through global sensitivity analysis.

math.OC↗

arXiv2019

Reconstruction of Power System Measurements Based on Enhanced Denoising Autoencoder

This paper presents a new solution for reconstructing missing data in power system measurements. An Enhanced Denoising Autoencoder (EDAE) is proposed to reconstruct the missing data through the input vector space reconstruction based on the neighbor values correlation and Long Short-Term Memory (LSTM) networks. The proposed LSTM-EDAE is able to remove the noise, extract principle features of the dataset, and reconstruct the missing information for new inputs. The paper shows that the utilization of neighbor correlation can perform better in missing data reconstruction. Trained with LSTM networks, the EDAE is more effective in coping with big data in power systems and obtains a better performance than the neural network in conventional Denoising Autoencoder. A random data sequence and the simulated Phasor Measurement Unit (PMU) data of power system are utilized to verify the effectiveness of the proposed LSTM-EDAE.

eess.SP↗

arXiv2019

Energy Crowdsourcing and Peer-to-Peer Energy Trading in Blockchain-Enabled Smart Grids

The power grid is rapidly transforming, and while recent grid innovations increased the utilization of advanced control methods, the next-generation grid demands technologies that enable the integration of distributed energy resources (DERs)---and consumers that both seamlessly buy and sell electricity. This paper develops an optimization model and blockchain-based architecture to manage the operation of crowdsourced energy systems (CES), with peer-to-peer (P2P) energy trading transactions. An operational model of CESs in distribution networks is presented considering various types of energy trading transactions and crowdsourcees. Then, a two-phase operation algorithm is presented: Phase I focuses on the day-ahead scheduling of generation and controllable DERs, whereas Phase II is developed for hour-ahead or real-time operation of distribution networks. The developed approach supports seamless P2P energy trading between individual prosumers and/or the utility. The presented operational model can also be used to operate islanded microgrids. The CES framework and the operation algorithm are then prototyped through an efficient blockchain implementation, namely the IBM Hyperledger Fabric. This implementation allows the system operator to manage the network users to seamlessly trade energy. Case studies and prototype illustration are provided.

eess.SY↗

arXiv2019

Repair and Resource Scheduling in Unbalanced Distribution Systems using Neighborhood Search

This paper proposes an optimization strategy to assist utility operators to recover power distribution systems after large outages. Specifically, a mixed-integer linear programming (MILP) model is developed for co-optimizing crews, resources, and network operations. The MILP model coordinates damage isolation, network reconfiguration, distributed generator re-dispatch, and crew/resource logistics. In addition, a framework for integrating different types of photovoltaic (PV) systems in the restoration process is developed.} We consider two different types of crews, namely, line crews for damage repair and tree crews for obstacle removal. We also model the repair resource logistic constraints. Furthermore, a new algorithm is developed for solving the distribution system repair and restoration problem (DSRRP). The algorithm starts by solving DSRRP using an assignment-based method, then a neighborhood search method is designed to iteratively improve the solution. The proposed method is validated on modified IEEE 123- and 8500-bus distribution test systems.

math.OC↗

arXiv2019

Deep Generative Graph Distribution Learning for Synthetic Power Grids

Power system studies require the topological structures of real-world power networks; however, such data is confidential due to important security concerns. Thus, power grid synthesis (PGS), i.e., creating realistic power grids that imitate actual power networks, has gained significant attention. In this letter, we cast PGS into a graph distribution learning (GDL) problem where the probability distribution functions (PDFs) of the nodes (buses) and edges (lines) are captured. A novel deep GDL (DeepGDL) model is proposed to learn the topological patterns of buses/lines with their physical features (e.g., power injection and line impedance). Having a deep nonlinear recurrent structure, DeepGDL understands complex nonlinear topological properties and captures the graph PDF. Sampling from the obtained PDF, we are able to create a large set of realistic networks that all resemble the original power grid. Simulation results show the significant accuracy of our created synthetic power grids in terms of various topological metrics and power flow measurements.

cs.SI↗

arXiv2019

A Stacked Autoencoder Application for Residential Load Curve Forecast and Peak Shaving

For the last ten years, utilities have observed on-going transitions on consumers' load curves. The previously flat load curves have more frequently turned into duck-shape. This is jointly caused by the increasing household loads as well as the popularity of rooftop solar photovoltaic. Such load curve transition challenges the operational flexibility of the existing systems and greatly increases the per-MWh energy costs. Peak shaving, in this context, becomes a critical task to demand-side management. Owing to the development of Battery Energy Storage Systems (BESS), numerous peak shaving strategies have been developed and implemented. In this paper, by applying a stacked autoencoder (SAE)-based residential peak load curve forecasting technology, we further lift the peaking shaving capabilities of BESSs to a new level. The proposed strategy takes into account the welfares of both generation-side and demand-side and reaches an optimal balance. A comprehensive case study using smart meter data demonstrates the effectiveness of the proposed method in peak shaving application.

eess.SP↗

arXiv2018

A Survey on State Estimation Techniques and Challenges in Smart Distribution Systems

This paper presents a review of the literature on State Estimation (SE) in power systems. While covering some works related to SE in transmission systems, the main focus of this paper is Distribution System State Estimation (DSSE). The paper discusses a few critical topics of DSSE, including mathematical problem formulation, application of pseudo-measurements, metering instrument placement, network topology issues, impacts of renewable penetration, and cyber-security. Both conventional and modern data-driven and probabilistic techniques have been reviewed. This paper can provide researchers and utility engineers with insights into the technical achievements, barriers, and future research directions of DSSE.

eess.SY↗

arXiv2018

Energy Disaggregation via Deep Temporal Dictionary Learning

This paper addresses the energy disaggregation problem, i.e. decomposing the electricity signal of a whole home to its operating devices. First, we cast the problem as a dictionary learning (DL) problem where the key electricity patterns representing consumption behaviors are extracted for each device and stored in a dictionary matrix. The electricity signal of each device is then modeled by a linear combination of such patterns with sparse coefficients that determine the contribution of each device in the total electricity. Although popular, the classic DL approach is prone to high error in real-world applications including energy disaggregation, as it merely finds linear dictionaries. Moreover, this method lacks a recurrent structure; thus, it is unable to leverage the temporal structure of energy signals. Motivated by such shortcomings, we propose a novel optimization program where the dictionary and its sparse coefficients are optimized simultaneously with a deep neural model extracting powerful nonlinear features from the energy signals. A long short-term memory auto-encoder (LSTM-AE) is proposed with tunable time dependent states to capture the temporal behavior of energy signals for each device. We learn the dictionary in the space of temporal features captured by the LSTM-AE rather than the original space of the energy signals; hence, in contrast to the traditional DL, here, a nonlinear dictionary is learned using powerful temporal features extracted from our deep model. Real experiments on the publicly available Reference Energy Disaggregation Dataset (REDD) show significant improvement compared to the state-of-the-art methodologies in terms of the disaggregation accuracy and F-score metrics.

cs.LG↗

arXiv2018

Convolutional Graph Auto-encoder: A Deep Generative Neural Architecture for Probabilistic Spatio-temporal Solar Irradiance Forecasting

Machine Learning on graph-structured data is an important and omnipresent task for a vast variety of applications including anomaly detection and dynamic network analysis. In this paper, a deep generative model is introduced to capture continuous probability densities corresponding to the nodes of an arbitrary graph. In contrast to all learning formulations in the area of discriminative pattern recognition, we propose a scalable generative optimization/algorithm theoretically proved to capture distributions at the nodes of a graph. Our model is able to generate samples from the probability densities learned at each node. This probabilistic data generation model, i.e. convolutional graph auto-encoder (CGAE), is devised based on the localized first-order approximation of spectral graph convolutions, deep learning, and the variational Bayesian inference. We apply our CGAE to a new problem, the spatio-temporal probabilistic solar irradiance prediction. Multiple solar radiation measurement sites in a wide area in northern states of the US are modeled as an undirected graph. Using our proposed model, the distribution of future irradiance given historical radiation observations is estimated for every site/node. Numerical results on the National Solar Radiation Database show state-of-the-art performance for probabilistic radiation prediction on geographically distributed irradiance data in terms of reliability, sharpness, and continuous ranked probability score.

cs.LG↗

arXiv2018

Comparing Kalman Filters and Observers for Power System Dynamic State Estimation with Model Uncertainty and Malicious Cyber Attacks

Kalman filters and observers are two main classes of dynamic state estimation (DSE) routines. Power system DSE has been implemented by various Kalman filters, such as the extended Kalman filter (EKF) and the unscented Kalman filter (UKF). In this paper, we discuss two challenges for an effective power system DSE: (a) model uncertainty and (b) potential cyber attacks. To address this, the cubature Kalman filter (CKF) and a nonlinear observer are introduced and implemented. Various Kalman filters and the observer are then tested on the 16-machine, 68-bus system given realistic scenarios under model uncertainty and different types of cyber attacks against synchrophasor measurements. It is shown that CKF and the observer are more robust to model uncertainty and cyber attacks than their counterparts. Based on the tests, a thorough qualitative comparison is also performed for Kalman filter routines and observers.

eess.SY↗

arXiv2018

Optimizing Service Restoration in Distribution Systems with Uncertain Repair Time and Demand

This paper proposes a novel method to co-optimize distribution system operation and repair crew routing for outage restoration after extreme weather events. A two-stage stochastic mixed integer linear program is developed. The first stage is to dispatch the repair crews to the damaged components. The second stage is distribution system restoration using distributed generators, and reconfiguration. We consider demand uncertainty in terms of a truncated normal forecast error distribution, and model the uncertainty of the repair time using a lognormal distribution. A new decomposition approach, combined with the Progressive Hedging algorithm, is developed for solving large-scale outage management problems in an effective and timely manner. The proposed method is validated on modified IEEE 34- and 8500-bus distribution test systems.

math.OC↗

arXiv2018

Robust Estimation of Reactive Power for an Active Distribution System

Increasing distributed energy resources (DERs) may result in reactive power imbalance in a transmission power system (TPS). An active distribution power system (DPS) having DERs reportedly can work as a reactive power prosumer to help balance the reactive power in the TPS. The reactive power potential (RPP) of a DPS, which is the range between the maximal inductive and capacitive reactive power the DPS can reliably provide, should be accurately estimated. However, an accurate estimation is difficult because of the network constraints, mixed discrete and continuous variables, and the nonnegligible uncertainty in the DPS. To solve this problem, this paper proposes a robust RPP estimation method based on two-stage robust optimization, where the uncertainty in DERs and the boundary-bus voltage is considered. In this two-stage robust model, the RPP is pre-estimated in the first stage and its robust feasibility for any possible instance of the uncertainty is checked via a tractable problem in the second stage. The column-and-constraint generation algorithm is adopted, which solves this model in finite iterations. Case studies show that this robust method excels in yielding a completely reliable RPP, and also that a DPS, even under the uncertainty, is still an effective reactive power prosumer for the TPS.

eess.SY↗

arXiv2018

Blockchain-Assisted Crowdsourced Energy Systems

Crowdsourcing relies on people's contributions to meet product- or system-level objectives. Crowdsourcing-based methods have been implemented in various cyber-physical systems and realtime markets. This paper explores a framework for Crowdsourced Energy Systems (CES), where small-scale energy generation or energy trading is crowdsourced from distributed energy resources, electric vehicles, and shapable loads. The merits/pillars of energy crowdsourcing are discussed. Then, an operational model for CESs in distribution networks with different types of crowdsourcees is proposed. The model yields a market equilibrium depicting traditional and distributed generator and load setpoints. Given these setpoints, crowdsourcing incentives are designed to steer crowdsourcees to the equilibrium. As the number of crowdsourcees and energy trading transactions scales up, a secure energy trading platform is required. To that end, the presented framework is integrated with a lightweight Blockchain implementation and smart contracts. Numerical tests are provided to showcase the overall implementation.

eess.SY↗

arXiv2018

Scheduling Post-Disaster Repairs in Electricity Distribution Networks

Natural disasters, such as hurricanes, earthquakes and large wind or ice storms, typically require the repair of a large number of components in electricity distribution networks. Since power cannot be restored before these repairs have been completed, optimally scheduling the available crews to minimize the cumulative duration of the customer interruptions reduces the harm done to the affected community. Considering the radial network structure of the distribution system, this repair and restoration process can be modeled as a scheduling problem with soft precedence constraints. As a benchmark, we first formulate this problem as a time-indexed ILP with valid inequalities. Three practical methods are then proposed to solve the problem: (i) an LP-based list scheduling algorithm, (ii) a single to multi-crew repair schedule conversion algorithm, and (iii) a dispatch rule based on $ρ$-factors which can be interpreted as Component Importance Measures. We show that the first two algorithms are $2$ and $\left(2 - \frac{1}{m}\right)$ approximations respectively. We also prove that the latter two algorithms are equivalent. Numerical results validate the effectiveness of the proposed methods.

math.OC↗

arXiv2018

Efficiency and power of minimally nonlinear irreversible heat engines with broken time-reversal symmetry

We study the minimally nonlinear irreversible heat engines in which the time-reversal symmetry for the systems may b e broken. The expressions for the power and the efficiency are derived, in which the effects of the nonlinear terms due to dissipations are included. We show that, as within the linear responses, the minimally nonlinear irreversible heat engines enable attainment of Carnot efficiency at positive power. We also find that the Curzon-Ahlborn limit imposed on the efficiency at maximum power can be overcomed if the time-reversal symmetry is broken.

cond-mat.stat-mech↗

arXiv2017

A Response-Function-Based Coordination Method for Transmission-Distribution-Coupled AC OPF

With distributed generation highly integrated into the grid, the transmission-distribution-coupled AC OPF (TDOPF) becomes increasingly important. This paper proposes a response-function-based coordination method to solve the TDOPF. Different from typical decomposition methods, this method employs approximate response functions of the power injections with respect to the bus voltage magnitude in the transmission-distribution (T-D) interface to reflect the "reaction" of the distribution to the transmission system control. By using the response functions, only one or two iterations between the transmission system operator (TSO) and the distribution system operator(s) (DSO(s)) are required to attain a nearly optimal TDOPF solution. Numerical tests confirm that, relative to a typical decomposition method, the proposed method does not only enjoy a cheaper computational cost but is workable even when the objectives of the TSO and the DSO(s) are in distinct scales.

eess.SY↗

arXiv2017

Risk-Based Distributionally Robust Optimal Power Flow With Dynamic Line Rating

In this paper, we propose a risk-based data-driven approach to optimal power flow (DROPF) with dynamic line rating. The risk terms, including penalties for load shedding, wind generation curtailment and line overload, are embedded into the objective function. To hedge against the uncertainties on wind generation data and line rating data, we consider a distributionally robust approach. The ambiguity set is based on second-order moment and Wasserstein distance, which captures the correlations between wind generation outputs and line ratings, and is robust to data perturbation. We show that the proposed DROPF model can be reformulated as a conic program. Considering the relatively large number of constraints involved, an approximation of the proposed DROPF model is suggested, which significantly reduces the computational costs. A Wasserstein distance constrained DROPF and its tractable reformulation are also provided for practical large-scale test systems. Simulation results on the 5-bus, the IEEE 118-bus and the Polish 2736-bus test systems validate the effectiveness of the proposed models.

math.OC↗

arXiv2017

An Adjustable Chance-Constrained Approach for Flexible Ramping Capacity Allocation

With the fast growth of wind power penetration, power systems need additional flexibility to cope with wind power ramping. Several electricity markets have established requirements for flexible ramping capacity (FRC) reserves. This paper addresses two crucial issues that have rarely been discussed in the literature: 1) how to characterize wind power ramping under different forecast values and 2) how to achieve a reasonable trade-off between operational risks and FRC costs. Regarding the first issue, this paper proposes a concept of conditional distributions of wind power ramping, which is empirically verified by using simulation and real-world data. For the second issue, this paper develops an adjustable chance-constrained approach to optimally allocate FRC reserves. Equivalent tractable forms of the original problem are devised to improve computational efficiency. Tests carried out on a modified IEEE 118-bus system demonstrate the effectiveness and efficiency of the proposed method.

physics.soc-ph↗