اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدDecentralized Low-Rank State Estimation for Power Distribution Systems
85
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
This paper 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 infeasible 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, thus 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.
قيم البحث
اقرأ أيضاً
We propose a framework for integrating optimal power flow (OPF) with state estimation (SE) in the loop for distribution networks. Our approach combines a primal-dual gradient-based OPF solver with a SE feedback loop based on a limited set of sensors
for system monitoring, instead of assuming exact knowledge of all states. The estimation algorithm reduces uncertainty on unmeasured grid states based on a few appropriate online state measurements and noisy pseudo-measurements. We analyze the convergence of the proposed algorithm and quantify the statistical estimation errors based on a weighted least squares (WLS) estimator. The numerical results on a 4521-node network demonstrate that this approach can scale to extremely large networks and provide robustness to both large pseudo measurement variability and inherent sensor measurement noise.
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 const
raints 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.
The tremendous bandwidth available in the millimeter wave (mmW) frequencies between 30 and 300 GHz have made these bands an attractive candidate for next-generation cellular systems. However, reliable communication at these frequencies depends extens
ively on beamforming with very high-dimensional antenna arrays. Estimating the channel sufficiently accurately to perform beamforming can thus be challenging both due to low coherence time and large number of antennas. Also, the measurements used for channel estimation may need to be made with analog beamforming where the receiver can look in only direction at a time. This work presents a novel method for estimation of the receive-side spatial covariance matrix of a channel from a sequence of power measurements made at different angular directions. The method reduces the spatial covariance estimation to a matrix completion optimization problem. To reduce the number of measurements, the optimization can incorporate the low-rank constraints in the channels that are typical in the mmW setting. The optimization is convex and fast, iterative methods are presented to solving the problem. Simulations are presented for both single and multi-path channels using channel models derived from real measurements in New York City at 28 GHz.
This paper considers the problem of simultaneous estimation of the attitude, position and linear velocity for vehicles navigating in a three-dimensional space. We propose two types of hybrid nonlinear observers using continuous angular velocity and l
inear acceleration measurements as well as intermittent landmark position measurements. The first type relies on a fixed-gain design approach based on an infinite-dimensional optimization, while the second one relies on a variable-gain design approach based on a continuous-discrete Riccati equation. For each case, we provide two different observers with and without the estimation of the gravity vector. The proposed observers are shown to be exponentially stable with a large domain of attraction. Simulation and experimental results are presented to illustrate the performance of the proposed observers.
The low-rank matrix completion problem can be solved by Riemannian optimization on a fixed-rank manifold. However, a drawback of the known approaches is that the rank parameter has to be fixed a priori. In this paper, we consider the optimization pro
blem on the set of bounded-rank matrices. We propose a Riemannian rank-adaptive method, which consists of fixed-rank optimization, rank increase step and rank reduction step. We explore its performance applied to the low-rank matrix completion problem. Numerical experiments on synthetic and real-world datasets illustrate that the proposed rank-adaptive method compares favorably with state-of-the-art algorithms. In addition, it shows that one can incorporate each aspect of this rank-adaptive framework separately into existing algorithms for the purpose of improving performance.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
