Search arXivSearch

arXiv · 1710.10621

Data-Driven Power Flow Linearization: A Regression Approach

Abstract

The linearization of a power flow (PF) model is an important approach for simplifying and accelerating the calculation of a power system's control, operation, and optimization. Traditional model-based methods derive linearized PF models by making approximations in the analytical PF model according to the physical characteristics of the power system. Today, more measurements of the power system are available and thus facilitate data-driven approaches beyond model-driven approaches. This work studies a linearized PF model through a data-driven approach. Both a forward regression model ((P, Q) as a function of (theta, V)) and an inverse regression model ((theta, V) as a function of (P, Q)) are proposed. Partial least square (PLS)- and Bayesian linear regression (BLR)-based algorithms are designed to address data collinearity and avoid overfitting. The proposed approach is tested on a series of IEEE standard cases, which include both meshed transmission grids and radial distribution grids, with both Monte Carlo simulated data and public testing data. The results show that the proposed approach can realize a higher calculation accuracy than model-based approaches can. The results also demonstrate that the obtained regression parameter matrices of data-driven models reflect power system physics by demonstrating similar patterns with some power system matrices (e.g., the admittance matrix).

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yuxiao Liu, Ning Zhang, Yi Wang, Jingwei Yang, Chongqing Kang. 2017-10-29. Data-Driven Power Flow Linearization: A Regression Approach. https://arxiv.org/abs/1710.10621

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Observability and parameter estimation of a generic model for aggregated distributed energy resources

We propose a novel framework for estimating the parameters of an aggregated distributed energy resources (DER A) model. First, we introduce a rigorous method to determine whether all model parameters are estimable. When they are not, our approach identifies the subset of parameters that can be estimated. The proposed framework offers new insights into the number and specific parameters that can be reliably estimated based on commonly available measurements. It also highlights the limitations of calibrating such models. Second, we introduce a Kalman filtering method to calibrate the DER A model. Since we account for nonlinear effects such as saturation and deadbands, we develop a specific mechanism to handle smoothing functions within the Kalman filter. Specifically, we consider the extended and the unscented Kalman filter. We demonstrate the effectiveness of the proposed framework on a modified IEEE 34-node distribution feeder with inverter- based resources. Our findings align with the North American Electric Reliability Corporation's parameterization guideline and underscore the importance of model calibration in accurately capturing the collective dynamics of distributed energy resources installed on distribution systems.

eess.SY

Salted Fisher Information for Hybrid Systems

Discrete events change how parameter-influence propagates in hybrid systems. Prevailing Fisher information for- mulations assume that sensitivities evolve smoothly according to continuous-time variational equations and therefore neglect the sensitivity updates induced by discrete events. This paper derives a Fisher information matrix formulation compatible with hybrid systems. To do so, we use the saltation matrix, which encodes the first-order transformation of sensitivities induced by discrete events. We call the resulting formulation the salted Fisher information matrix (SFIM). The proposed framework unifies continuous information accumulation during flows with discrete updates at event times. We also show that hybrid persistence of excitation is sufficient for the SFIM to be positive definite

eess.SY

Min-Max Grassmannian Optimization for Online Subspace Tracking

We propose GeRoST (Geometrically Robust Subspace Tracking), an online subspace tracking algorithm that models uncertainty in a subspace using a Grassmannian ball. We derive an exact scalar dual for the worst-case subspace problem, establish conditions for a unique worst-case subspace and a Riemannian gradient, and characterize the minimum radius needed to cover a dimensional extension of the target subspace. Each update uses either a spectral direction computed in a reduced subspace or the gradient of the window reconstruction loss. Our numerical experiments show that GeRoST achieves lower mean post-fault prediction error than GREAT in system identification. In video separation, it achieves higher precision and a better precision--recall balance, as measured by the F$_1$ score, than both GREAT and GRASTA at the reported thresholds, with lower recall and longer runtime.

eess.SY