Least Squares based Estimation of Thevenin Equivalent in Noisy Distribution Grid
This work presents a novel approach that synergizes the extremum seeking method with an online least squares estimation technique to accurately estimate Thevenin equivalent circuit being seen at each node in distribution grids. Thevenin's theorem offers a simplified representation of electrical networks, critical for the effective monitoring, control, and optimization of grid operations. However, real-time identification of Thevenin parameters, particularly impedance, poses significant challenges due to the dynamic nature of distribution grids. By integrating extremum seeking algorithms, which are adept at locating optima in dynamic systems without explicit model information, with the robustness of least squares estimation, we develop a novel methodology that continuously adapts to grid fluctuations. These fusion harnesses the strengths of both techniques: the extremum seeking method's non-model-based optimization capabilities and the least squares method's proficiency in estimating parameter value in a noisy environment. The result is a robust, adaptive algorithm capable of delivering reliable Thevenin parameter estimations in real-time. Our simulation results demonstrate the efficacy of the proposed method, showcasing its potential as a tool for enhanced grid management and resilience.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Online SOC Estimation of Lithium-ion Battery Based on Improved Adaptive H Infinity Extended Kalman Filter
For the battery management system of electric vehicle, accurate estimation of the State of Charge of Lithium-ion battery can effectively avoid structural damage caused by overcharge or over discharge inside the battery. …
ManagementMismatched Estimation in the Distance Geometry Problem
We investigate mismatched estimation in the context of the distance geometry problem (DGP). In the DGP, for a set of points, we are given noisy measurements of pairwise distances between the points, and our objective is …
Outlier-robust Autocovariance Least Square Estimation via Iteratively Reweighted Least Square
The autocovariance least squares (ALS) method is a computationally efficient approach for estimating noise covariances in Kalman filters without requiring specific noise models. However, conventional ALS and its variants…
On Suboptimality of Least Squares with Application to Estimation of Convex Bodies
We develop a technique for establishing lower bounds on the sample complexity of Least Squares (or, Empirical Risk Minimization) for large classes of functions. As an application, we settle an open problem regarding opti…
Nearest Neighbor Matching as Least Squares Density Ratio Estimation and Riesz Regression
This study proves that Nearest Neighbor (NN) matching can be interpreted as an instance of Riesz regression for automatic debiased machine learning. Lin et al. (2023) shows that NN matching is an instance of density-rati…