اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدOptimal Allocation of ESSs in Active Distribution Networks to achieve their Dispatchability
69
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
This paper presents a method for the optimal siting and sizing of energy storage systems (ESSs) in active distribution networks (ADNs) to achieve their dispatchability. The problem formulation accounts for the uncertainty inherent to the stochastic nature of distributed energy sources and loads. Thanks to the operation of ESSs, the main optimization objective is to minimize the dispatch error, which accounts for the mismatch between the realization and prediction of the power profile at the ADN connecting point to the upper layer grid, while respecting the grid voltages and ampacity constraints. The proposed formulation relies on the so-called Augmented Relaxed Optimal Power Flow (AR-OPF) method: it expresses a convex full AC optimal power flow, which is proven to provide a global optimal and exact solution in the case of radial power grids. The AR-OPF is coupled with the proposed dispatching control resulting in a two-level optimization problem. In the first block, the site and size of the ESSs are decided along with the level of dispatchability that the ADN can achieve. Then, in the second block, the adequacy of the ESS allocations and the feasibility of the grid operating points are verified over operating scenarios using the Benders decomposition technique. Consequently, the optimal size and site of the ESSs are adjusted. To validate the proposed method, simulations are conducted on a real Swiss ADN hosting a large amount of stochastic Photovoltaic (PV) generation.
قيم البحث
اقرأ أيضاً
This paper considers the problem of fault detection and localization in active distribution networks using PMUs. The proposed algorithm consists in computing a set of weighted least squares state estimates whose results are used to detect, characteri
ze and localize the occurrence of a fault. Moreover, a criteria to minimize the number of PMUs required to correctly perform the proposed algorithm is defined. Such a criteria, based on system observability conditions, allows the design of an optimization problem to set the positions of PMUs along the grid, in order to get the desired fault localization resolution. The performances of the strategy are tested via simulations on a benchmark distribution system.
We derive novel results on the ergodic theory of irreducible, aperiodic Markov chains. We show how to optimally steer the network flow to a stationary distribution over a finite or infinite time horizon. Optimality is with respect to an entropic dist
ance between distributions on feasible paths. When the prior is reversible, it shown that solutions to this discrete time and space steering problem are reversible as well. A notion of temperature is defined for Boltzmann distributions on networks, and problems analogous to cooling (in this case, for evolutions in discrete space and time) are discussed.
The uncertainty in distributed renewable generation poses security threats to the real-time operation of distribution systems. The real-time dispatchable region (RTDR) can be used to assess the ability of power systems to accommodate renewable genera
tion at a given base point. DC and linearized AC power flow models are typically used for bulk power systems, but they are not suitable for low-voltage distribution networks with large r/x ratios. To balance accuracy and computational efficiency, this paper proposes an RTDR model of AC distribution networks using tight convex relaxation. Convex hull relaxation is adopted to reformulate the AC power flow equations, and the convex hull is approximated by a polyhedron without much loss of accuracy. Furthermore, an efficient adaptive constraint generation algorithm is employed to construct an approximate RTDR to meet the requirements of real-time dispatch. Case studies on the modified IEEE 33-bus distribution system validate the computational efficiency and accuracy of the proposed method.
This paper proposes a joint input and state dynamic estimation scheme for power networks in microgrids and active distribution systems with unknown inputs. The conventional dynamic state estimation of power networks in the transmission system relies
on the forecasting methods to obtain the state-transition model of state variables. However, under highly dynamic conditions in the operation of microgrids and active distribution networks, this approach may become ineffective as the forecasting accuracy is not guaranteed. To overcome such drawbacks, this paper employs the power networks model derived from the physical equations of branch currents. Specifically, the power network model is a linear state-space model, in which the state vector consists of branch currents, and the input vector consists of bus voltages. To estimate both state and input variables, we propose linear Kalman-based dynamic filtering algorithms in batch-mode regression form, considering the cross-correlation between states and inputs. For the scalability of the proposed scheme, the distributed implementation is also presented. Complementarily, the predicted state and input vectors are leveraged for bad data detection. Results carried out on a 13-bus microgrid system in real-time Opal-RT platform demonstrate the effectiveness of the proposed method in comparison with the traditional weighted least square and tracking state estimation methods.
Mobile edge computing (MEC)-enabled Internet of Things (IoT) networks have been deemed a promising paradigm to support massive energy-constrained and computation-limited IoT devices. IoT with mobility has found tremendous new services in the 5G era a
nd the forthcoming 6G eras such as autonomous driving and vehicular communications. However, mobility of IoT devices has not been studied in the sufficient level in the existing works. In this paper, the offloading decision and resource allocation problem is studied with mobility consideration. The long-term average sum service cost of all the mobile IoT devices (MIDs) is minimized by jointly optimizing the CPU-cycle frequencies, the transmit power, and the user association vector of MIDs. An online mobility-aware offloading and resource allocation (OMORA) algorithm is proposed based on Lyapunov optimization and Semi-Definite Programming (SDP). Simulation results demonstrate that our proposed scheme can balance the system service cost and the delay performance, and outperforms other offloading benchmark methods in terms of the system service cost.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
