اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدOptimizing Power-Water-Heat Flows via Decomposed Iterative Convex Approximation
69
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Joint operation of power, water, and heating networks is expected to improve overall efficiency of infrastructure while also known as a challenging problem, due to complex couplings of electric, hydraulic, and thermal models that are nonlinear and nonconvex. We formulate an optimal power-water-heat flow (OPWHF) problem and develop a computationally efficient and privacy preserving heuristic to solve it. The proposed heuristic decomposes OPWHF into subproblems, which are solved via convex relaxation and convex-concave procedure while iteratively exchanging information to reach consensus on coupling variables. Simulation results validate that the joint optimization can improve operational flexibility and social welfare of the interconnected system, wherein the water and heating networks respond to time-varying electricity price and electric load as virtual energy storage. We also compare two modes of heating network control: by flow rate and by temperature; case studies reveal that the latter is more effective for most practical systems.
قيم البحث
اقرأ أيضاً
Repurposing automotive batteries to second-use battery energy storage systems (2-BESS) may have environmental and economic benefits. The challenge with second-use batteries is the uncertainty and diversity of the expected packs in terms of their chem
istry, capacity and remaining useful life. This paper introduces a new strategy to optimize 2-BESS performance despite the diversity or heterogeneity of individual batteries while reducing the cost of power conversion. In this paper, the statistical distribution of the power heterogeneity in the supply of batteries is considered when optimizing the choice of power converters and designing the power flow within the battery energy storage system (BESS) to maximize battery utilization. By leveraging a new lite-sparse hierarchical partial power processing (LS-HiPPP) approach, we show a hierarchy in partial power processing (PPP) partitions power converters to a) significantly reduce converter ratings, b) process less power to achieve high system efficiency with lower cost (lower efficiency) converters, and c) take advantage of economies of scale by requiring only a minimal number of sets of identical converters. The results demonstrate that LS-HiPPP architectures offer the best tradeoff between battery utilization and converter cost and had higher system efficiency than conventional partial power processing (C-PPP) in all cases.
The existence of multiple solutions to AC optimal power flow (ACOPF) problems has been noted for decades. Existing solvers are generally successful in finding local solutions, which satisfy first and second order optimality conditions, but may not be
globally optimal. In this paper, we propose a simple iterative approach to improve the quality of solutions to ACOPF problems. First, we call an existing solver for the ACOPF problem. From the solution and the associated dual variables, we form a partial Lagrangian. Then we optimize this partial Lagrangian and use its solution as a warm start to call the solver again for the ACOPF problem. By repeating this process, we can iteratively improve the solution quality, moving from local solutions to global ones. We show the effectiveness of our algorithm on standard IEEE networks. The simulation results show that our algorithm can escape from local solutions to achieve global optimums within a few iterations.
We consider the problem of stability analysis for distribution grids with droop-controlled inverters and dynamic distribution power lines. The inverters are modeled as voltage sources with controllable frequency and amplitude. This problem is very ch
allenging for large networks as numerical simulations and detailed eigenvalue analysis are impactical. Motivated by the above limitations, we present in this paper a systematic and computationally efficient framework for stability analysis of inverter-based distribution grids. To design our framework, we use tools from singular perturbation and Lyapunov theories. Interestingly, we show that stability of the fast dynamics of the power grid depends only on the voltage droop gains of the inverters while, stability of the slow dynamics, depends on both voltage and frequency droop gains. Finally, by leveraging these timescale separation properties, we derive sufficient conditions on the frequency and voltage droop gains of the inverters that warrant stability of the full system. We illustrate our theoretical results through a numerical example on the IEEE 13-bus distribution grid.
In this paper, we present an iterative Model Predictive Control (MPC) design for piecewise nonlinear systems. We consider finite time control tasks where the goal of the controller is to steer the system from a starting configuration to a goal state
while minimizing a cost function. First, we present an algorithm that leverages a feasible trajectory that completes the task to construct a control policy which guarantees that state and input constraints are recursively satisfied and that the closed-loop system reaches the goal state in finite time. Utilizing this construction, we present a policy iteration scheme that iteratively generates safe trajectories which have non-decreasing performance. Finally, we test the proposed strategy on a discretized Spring Loaded Inverted Pendulum (SLIP) model with massless legs. We show that our methodology is robust to changes in initial conditions and disturbances acting on the system. Furthermore, we demonstrate the effectiveness of our policy iteration algorithm in a minimum time control task.
In chance-constrained OPF models, joint chance constraints (JCCs) offer a stronger guarantee on security compared to single chance constraints (SCCs). Using Booles inequality or its improv
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
