-
Notifications
You must be signed in to change notification settings - Fork 1
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
add bones of FPL SinglePhase model (from LinearPowerFlow.jl
- Loading branch information
Showing
8 changed files
with
715 additions
and
2 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
|
@@ -3,6 +3,11 @@ uuid = "20cea600-32a0-4edf-8dad-2de078d2a706" | |
authors = ["Nick Laws <[email protected]> and contributors"] | ||
version = "0.1.0" | ||
|
||
[deps] | ||
CommonOPF = "dad7ea18-2b21-482e-81c1-e84414cc4b03" | ||
JuMP = "4076af6c-e467-56ae-b986-b466b2749572" | ||
LinearAlgebra = "37e2e46d-f89d-539d-b4ee-838fcccc9c8e" | ||
|
||
[compat] | ||
julia = "1.10" | ||
|
||
|
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1,5 +1,28 @@ | ||
module BusInjectionModel | ||
|
||
# Write your package code here. | ||
|
||
using CommonOPF | ||
using JuMP | ||
using LinearAlgebra | ||
|
||
|
||
""" | ||
ModelType | ||
An enum with values: | ||
1. `FixedPointLinear` | ||
""" | ||
@enum ModelType begin | ||
FixedPointLinear # only SinglePhase | ||
end | ||
|
||
|
||
export | ||
build_bim!, | ||
FixedPointLinear | ||
|
||
|
||
include("single_phase_model.jl") | ||
include("single_phase_fpl_model.jl") | ||
|
||
end |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,165 @@ | ||
|
||
|
||
""" | ||
build_bim!(m::JuMP.AbstractModel, net::Network{SinglePhase}, ::Val{FixedPointLinear}) | ||
Add variables and constraints to `m` using the values in `net` to make an FixedPointLinear branch flow | ||
model. Calls the following functions: | ||
- [`add_bim_variables`](@ref) | ||
- [`constrain_voltage`](@ref) | ||
``` | ||
""" | ||
function build_bim!(m::JuMP.AbstractModel, net::Network{SinglePhase}, ::Val{FixedPointLinear}) | ||
add_bim_variables(m, net) | ||
# constrain_voltage(m, net) | ||
end | ||
|
||
|
||
function build_lpf(m::JuMP.AbstractModel, net::Network{SinglePhase}) | ||
add_variables(m, p) | ||
constrain_voltage(m, p) | ||
constrain_substation_power(m, p) | ||
constrain_bounds(m, p) | ||
end | ||
|
||
|
||
function add_bim_variables(m::JuMP.AbstractModel, net::Network{SinglePhase}) | ||
N = length(busses(net)) | ||
T = net.Ntimesteps | ||
|
||
@variable(m, P₀[1:T]) | ||
@variable(m, Q₀[1:T]) | ||
# TODO Pj Qj variables and change p.P/Qref to P/Qload dicts ? | ||
|
||
@variable(m, v[1:N, 1:T] >=0) # vlo and vhi applied in constraints s.t. they end up in C matrix | ||
end | ||
|
||
|
||
function constrain_voltage(m::JuMP.AbstractModel, net::Network{SinglePhase}) | ||
v = m[:v] | ||
N = length(busses(net)) | ||
|
||
# Bernstein & Dall'anese 2017 equ. 5b, 9b, 9c | ||
for t = 1:net.Ntimesteps | ||
# TODO should we update the M matrices with each time step? Depends on if Vref is updated with time | ||
invDiagConjVref = inv(Diagonal(vec(conj(p.vref[:, t])))) # TODO mv to Inputs so only calculated once (and Mwye) | ||
Mwye = [p.invYLL * invDiagConjVref -im * p.invYLL * invDiagConjVref] | ||
Kwye = inv(Diagonal(abs.(p.vref[:,t]))) * real( Diagonal(conj(p.vref[:,t])) * Mwye ) | ||
b = abs.(p.vref[:,t]) - Kwye * vec([p.Pref[:,t] / p.Sbase; p.Qref[:,t]] / p.Sbase) | ||
|
||
KL = Kwye[:, 1:N] | ||
KR = Kwye[:, N+1:end] | ||
|
||
@constraint(m, [j = 1:N], | ||
v[j,t] == sum( KL[j,n] * p.Pref[n,t] / p.Sbase for n in N) | ||
+ sum( KR[j,n] * p.Qref[n,t] / p.Sbase for n in N) | ||
+ b[j] | ||
) | ||
end | ||
#= | ||
equ (10) distributable voltage estimation, less accurate | ||
v₀ = [complex(net.v0, 0)] | ||
w = -p.invYLL * p.YL0 * v₀ | ||
W = Diagonal(w) | ||
big_one = vec(ones(N)) | ||
abs.(W) * (big_one + real(inv(W) * Mwye) * vec([p.Pref[:,t] / p.Sbase; p.Qref[:,t]] / p.Sbase)) | ||
=# | ||
p.Nequality_cons += N * net.Ntimesteps | ||
nothing | ||
end | ||
|
||
|
||
|
||
""" | ||
constrain_substation_power(m::JuMP.AbstractModel, params::YPQVarraysNodeByTime) | ||
P₀ & Q₀ definitions ∀ t ∈ T | ||
""" | ||
function constrain_substation_power(m::JuMP.AbstractModel, net::Network{SinglePhase}) | ||
P₀ = m[:P₀] | ||
Q₀ = m[:Q₀] | ||
v₀ = [complex(net.v0, 0)] | ||
# parameters using notation from Bernstein and Dall'anese 2017 equ.s 5c, 13a, 13b | ||
w = -p.invYLL * p.YL0 * v₀ # can be replaced with ntwk.vnom? | ||
c = Diagonal(v₀) * (conj(p.Y₀₀) * conj(v₀) + conj(p.Y0L) * conj(w)) | ||
creal = real(c)[1] | ||
cimag = imag(c)[1] | ||
|
||
# s₀ = G*x + c | ||
for t = 1:net.Ntimesteps | ||
invDiagConjVref = inv(Diagonal(vec(conj(p.vref[:, t])))) | ||
Mwye = [p.invYLL * invDiagConjVref -im * p.invYLL * invDiagConjVref] | ||
gwye = Diagonal(v₀) * conj(p.Y0L) * conj(Mwye) | ||
|
||
@constraint(m, | ||
P₀[t] == 1/p.Sbase * dot(real(gwye), [p.Pref[:,t]; p.Qref[:,t]]) + creal | ||
) | ||
@constraint(m, | ||
Q₀[t] == 1/p.Sbase * dot(imag(gwye), [p.Pref[:,t]; p.Qref[:,t]]) + cimag | ||
) | ||
end | ||
|
||
p.Nequality_cons += 2 * net.Ntimesteps | ||
nothing | ||
end | ||
|
||
|
||
function constrain_bounds(m::JuMP.AbstractModel, net::Network{SinglePhase}) | ||
N = length(busses(net)) | ||
|
||
@constraint(m, con_vhi[n=1:N, t=1:net.Ntimesteps], | ||
m[:v][n, t] ≤ net.bounds.v_upper_mag | ||
) | ||
p.Nlte_cons += N * net.Ntimesteps | ||
|
||
@constraint(m, con_vlo[n=1:N, t=1:net.Ntimesteps], | ||
p.vlo - m[:v][n, t] ≤ 0 | ||
) | ||
p.Nlte_cons += N * net.Ntimesteps | ||
|
||
@constraint(m, con_P0hi[t=1:net.Ntimesteps], | ||
m[:P₀][t] ≤ p.P0hi | ||
) | ||
p.Nlte_cons += net.Ntimesteps | ||
|
||
@constraint(m, con_P0lo[t=1:net.Ntimesteps], | ||
p.P0lo - m[:P₀][t] ≤ 0 | ||
) | ||
p.Nlte_cons += net.Ntimesteps | ||
|
||
@constraint(m, con_Q0hi[t=1:net.Ntimesteps], | ||
m[:Q₀][t] ≤ p.Q0hi | ||
) | ||
p.Nlte_cons += net.Ntimesteps | ||
|
||
@constraint(m, con_Q0lo[t=1:net.Ntimesteps], | ||
p.Q0lo - m[:Q₀][t] ≤ 0 | ||
) | ||
p.Nlte_cons += net.Ntimesteps | ||
nothing | ||
end | ||
|
||
|
||
function check_existence_condition(m, net::Network{SinglePhase}) | ||
# TODO: still applies? if so update the P,Q vectors | ||
N = length(busses(net)) | ||
upperbound = net.v0^2 / (4 * matrixnormstar(p.Z)) | ||
Snorm = zeros(Float64, net.Ntimesteps) | ||
for t in 1:net.Ntimesteps | ||
P = value.(m[:P][:,t]) | ||
Q = value.(m[:P][:,t]) | ||
Snorm[t] = LinearAlgebra.norm( sqrt(sum( P[j]^2 + Q[j]^2 for j in 0:N)) ) | ||
end | ||
return all(Snorm[t] < upperbound for t in 1:net.Ntimesteps) | ||
end | ||
|
||
|
||
function matrixnormstar(A::AbstractArray{<:Complex{Float64}, 2}) | ||
rownorms = zeros(Float64, size(A, 1)) | ||
for r = 1:size(A,1) | ||
rownorms[r] += LinearAlgebra.norm(abs.(A[r,:])) | ||
end | ||
return maximum(rownorms) | ||
end |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,8 @@ | ||
""" | ||
build_bim!(m::JuMP.AbstractModel, net::Network{MultiPhase}, mtype::ModelType=FixedPointLinear) | ||
Top-level multiphase builder that dispatches the ModelType enum | ||
""" | ||
function build_bim!(m::JuMP.AbstractModel, net::Network{MultiPhase}, mtype::ModelType=FixedPointLinear) | ||
build_bim!(m::JuMP.AbstractModel, net::Network{MultiPhase}, Val(mtype)) | ||
end |
Oops, something went wrong.
b3d70e2
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
@JuliaRegistrator register
b3d70e2
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Registration pull request updated: JuliaRegistries/General/115285
Tip: Release Notes
Did you know you can add release notes too? Just add markdown formatted text underneath the comment after the text
"Release notes:" and it will be added to the registry PR, and if TagBot is installed it will also be added to the
release that TagBot creates. i.e.
To add them here just re-invoke and the PR will be updated.
Tagging
After the above pull request is merged, it is recommended that a tag is created on this repository for the registered package version.
This will be done automatically if the Julia TagBot GitHub Action is installed, or can be done manually through the github interface, or via: