اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدOptimal Power Flow with State Estimation In the Loop for Distribution Networks
90
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
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.
قيم البحث
اقرأ أيضاً
Optimal power flow (OPF) is the fundamental mathematical model in power system operations. Improving the solution quality of OPF provide huge economic and engineering benefits. The convex reformulation of the original nonconvex alternating current OP
F (ACOPF) model gives an efficient way to find the global optimal solution of ACOPF but suffers from the relaxation gaps. The existence of relaxation gaps hinders the practical application of convex OPF due to the AC-infeasibility problem. We evaluate and improve the tightness of the convex ACOPF model in this paper. Various power networks and nodal loads are considered in the evaluation. A unified evaluation framework is implemented in Julia programming language. This evaluation shows the sensitivity of the relaxation gap and helps to benchmark the proposed tightness reinforcement approach (TRA). The proposed TRA is based on the penalty function method which penalizes the power loss relaxation in the objective function of the convex ACOPF model. A heuristic penalty algorithm is proposed to find the proper penalty parameter of the TRA. Numerical results show relaxation gaps exist in test cases especially for large-scale power networks under low nodal power loads. TRA is effective to reduce the relaxation gap of the convex ACOPF model.
For optimal power flow problems with chance constraints, a particularly effective method is based on a fixed point iteration applied to a sequence of deterministic power flow problems. However, a priori, the convergence of such an approach is not nec
essarily guaranteed. This article analyses the convergence conditions for this fixed point approach, and reports numerical experiments including for large IEEE networks.
The uncertainty of multiple power loads and re-newable energy generations in power systems increases the complexity of power flow analysis for decision-makers. The chance-constraint method can be applied to model the optimi-zation problems of power f
low with uncertainty. This paper develops a novel solution approach for chance-constrained AC optimal power flow (CCACOPF) problem based on the da-ta-driven convexification of power flow and the fast algorithm for scenario technique (FAST). This method is computationally effective for mainly two reasons. First, the original nonconvex AC power flow constraints are approximated by a set of learn-ing-based quadratic convex ones. Second, FAST is a more ad-vanced distribution-free scenario-based solution method using far less scenarios than the conventional one, retaining a high confidence level. Eventually, the CCACOPF is converted into a computationally tractable convex optimization problem. The simulation results on IEEE test cases indicate that 1) the pro-posed solution method can excel the conventional one and ro-bust program in computational efficiency, 2) the data-driven convexification of power flow is effective in approximating original complex AC power flow.
This chapter presents recent solutions to the optimal power flow (OPF) problem in the presence of renewable energy sources (RES), {such} as solar photo-voltaic and wind generation. After introducing the original formulation of the problem, arising fr
om the combination of economic dispatch and power flow, we provide a brief overview of the different solution methods proposed in the literature to solve it. Then, we explain the main difficulties arising from the increasing RES penetration, and the ensuing necessity of deriving robust solutions. Finally, we present the state-of-the-art techniques, with a special focus on recent methods we developed, based on the application on randomization-based methodologies.
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 effecti
ve 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.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
