Non-local approximation of power flow equations with guaranteed error bounds

Heidari, Rahmat; Serón, María M.; Braslavsky, Julio H.

doi:10.1109/anzcc.2017.8298490

Cited by 8 publications

(7 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The above set of equations are nonlinear due to (4). By leveraging the incidence matrix B of the distribution network and following the method adopted in [15], (2) and (3) can be expressed through the following matrix equations:…”

Section: A Mathematical Modelmentioning

confidence: 99%

“…Based on (15) and (16), the optimization problem to determine the maximum feasible operating region of the network can be obtained from the solution of the two optimization problems shown below for p + and p − :…”

Section: B Optimization Problem Formulationmentioning

confidence: 99%

“…In order to achieve this, a convex inner approximation is developed to determine the feasible operating region for the dispatchable resources in the distribution network. Previous works in literature such as [14], [15] determine error bounds in linear power flow approximations. This paper builds upon these works but develops a convex inner approximation for determining the operating region of dispachable resources that guarantees feasibility of solution.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Convex inner approximation of the feeder hosting capacity limits on dispatchable demand

Nazir

Almassalkhi

2019

2019 IEEE 58th Conference on Decision and Control (CDC)

View full text Add to dashboard Cite

This paper presents a method to obtain a convex inner approximation that aims to improve the feasibility of optimal power flow (OPF) models in distribution feeders. For a resistive distribution network, both real and reactive power effect the node voltages and this makes it necessary to consider both when formulating the OPF problem. Inaccuracy in linearized OPF models may lead to under and over voltages when dispatching flexible demand, at scale, in response to whole-sale market or grid conditions. In order to guarantee feasibility, this paper obtains an inner convex set in which the dispatchable resources can operate, based on their real and reactive power capabilities, that guarantees network voltages to be feasible. Test simulations are conducted on a standard IEEE distribution test network to validate the approach. arXiv:1905.05743v1 [math.OC]

show abstract

Section: A Mathematical Modelmentioning

confidence: 99%

Section: B Optimization Problem Formulationmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Convex inner approximation of the feeder hosting capacity limits on dispatchable demand

Nazir

Almassalkhi

2019

2019 IEEE 58th Conference on Decision and Control (CDC)

View full text Add to dashboard Cite

show abstract

“…2. Diagram of a radial distribution network from [30]. constrained variables as a linear function of the power injections and the branch currents.…”

Section: A Distribution Grid Modelmentioning

confidence: 99%

“…From the incidence matrix B of the radial network and following the method adopted in [30], ( 2) and ( 3) can be expressed through the following matrix equations:…”

Section: A Distribution Grid Modelmentioning

confidence: 99%

Voltage positioning using co-optimization of controllable grid assets in radial networks

Nazir¹,

Almassalkhi²

2019

Preprint

View full text Add to dashboard Cite

With increasing penetration of solar PV, some distribution feeders are experiencing highly variable net-load flows and even reverse flows. To optimize distribution systems under such conditions, the scheduling of mechanical devices, such as OLTCs and capacitor banks, needs to take into account forecasted solar PV and actual grid conditions. However, these legacy switching assets are operated on a daily or hourly timescale, due to the wear and tear associated with mechanical switching, which makes them unsuitable for real-time control. Therefore, there is a natural timescaleseparation between these slower mechanical assets and the responsive nature of inverter-based resources. In this paper, we present a network admissible convex formulation for holistically scheduling controllable grid assets to position voltage optimally against solar PV. An optimal hourly schedule is presented that utilizes mechanical resources to position the predicted voltages close to nominal values, while minimizing the use of inverter-based resources (i.e., DERs), making them available for control at a faster time-scale (after the uncertainty reveals itself). A convex, inner approximation of the OPF problem is adapted to a mixed-integer linear program that minimizes voltage deviations from nominal (i.e., maximizes voltage margins). The resulting OPF solution respects all the network constraints and is, hence, robust against modeling simplifications. Simulation based analysis on IEEE distribution feeders validates the approach.

show abstract

Decomposed phase analysis for DER hosting capacity in unbalanced distribution feeders

Mavalizadeh,

Almassalkhi

2024

Electric Power Systems Research

View full text Add to dashboard Cite

Non-local approximation of power flow equations with guaranteed error bounds

Cited by 8 publications

References 17 publications

Convex inner approximation of the feeder hosting capacity limits on dispatchable demand

Convex inner approximation of the feeder hosting capacity limits on dispatchable demand

Voltage positioning using co-optimization of controllable grid assets in radial networks

Decomposed phase analysis for DER hosting capacity in unbalanced distribution feeders

Contact Info

Product

Resources

About