Security Constrained Optimal Power Flow via proximal message passing

Chakrabarti, Sambuddha; Kraning, Matt; Chu, Eric; Baldick, Ross; Boyd, Stephen

doi:10.1109/psc.2014.6808131

Cited by 33 publications

(47 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The pioneering work on the Security Constrained OPF (SCOPF) was done by Stott et al in [30]. Some of the recent references include works by Chiang et al [31], Phan et al [32], Chakrabarti et al [2] etc. The last two deal with application of distributed algorithms to the SCOPF problem.…”

Section: Literature Survey and Related Workmentioning

confidence: 99%

“…In this paper we build on the static SCOPF problem formulation in [2]. We will develop the mathematical model for a look-ahead dispatch calculation that considers an upcoming and several subsequent dispatch intervals at the onset of each current dispatch interval and takes into account the possible variations of operating parameters across different scenarios represented in different subsequent dispatch intervals, so that at each interval the entire system is secure.…”

Section: Look-ahead Dispatch: Generalized Case Of Demand Variation Fomentioning

confidence: 99%

“…For the sake of brevity, we are presenting here the terms corresponding to line flow limit constraint (F (P (c)(τ ) )), power-angle relation (χ(P (c)(τ ) , θ (c)(τ ) )), and ramp constraint (∆(P (0)(τ ) )) in the most general and condensed forms. The details of these can be found in [2] and [50].…”

Section: Dt N Reformulations Of the Scopf Problemsmentioning

confidence: 99%

“…Therefore we present a distributed algorithm to solve this problem, whereby we break the problem into several smaller independent sub-problems and solve them in parallel, such that the only co-ordination required is local, through the Locational Marginal Prices (LMP) updates. Specifically, we use a suitably modified version of the message passing algorithm from [1] and [2] to solve this problem efficiently.…”

Section: Introductionmentioning

confidence: 99%

“…In the previous works in [1], [9], and [2], Kraning et al, applied the Proximal Message Passing Algorithm to solve the standard Static Optimal Power Flow (OPF) Problem while Liu et al and Chakrabarti et al respectively applied it to solve the (N − 1) Security Constrained OPF (SCOPF). In this paper, we extend this approach to solving a look-ahead dispatch problem, which considers the variation of load over a time horizon.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Look-Ahead SCOPF (LASCOPF) for Tracking Demand Variation via Auxiliary Proximal Message Passing (APMP) Algorithm

Chakrabarti

Baldick

2020

International Journal of Electrical Power & Energy Systems

Self Cite

View full text Add to dashboard Cite

In this paper, we will consider the Look-Ahead Security Constrained Optimal Power Flow (LASCOPF) problem looking forward multiple dispatch intervals, in which the load demand varies over dispatch intervals according to some forecast. We will consider the base-case and several contingency scenarios in the upcoming as well as in the subsequent dispatch intervals. We will formulate and solve the problem in a Model Predictive Control (MPC) paradigm. We will present the Auxiliary Proximal Message Passing (APMP) algorithm to solve this problem, which is a bi-layered decomposition-coordination type distributed algorithm, consisting of an outer Auxiliary Problem Principle (APP) layer and an inner Proximal Message Passing (PMP) layer. The APP part of the algorithm distributes the computation across several dispatch intervals and the PMP part performs the distributed computation within each of the dispatch interval across different devices (i.e. generators, transmission lines, loads) and nodes or nets. We will demonstrate the effectiveness of our method with a series of numerical simulations.

show abstract

Section: Literature Survey and Related Workmentioning

confidence: 99%

Section: Look-ahead Dispatch: Generalized Case Of Demand Variation Fomentioning

confidence: 99%

Section: Dt N Reformulations Of the Scopf Problemsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Look-Ahead SCOPF (LASCOPF) for Tracking Demand Variation via Auxiliary Proximal Message Passing (APMP) Algorithm

Chakrabarti

Baldick

2020

International Journal of Electrical Power & Energy Systems

Self Cite

View full text Add to dashboard Cite

show abstract

Agent-Based Security Constrained Optimal Power Flow with Primary Frequency Control

Velay

Vinyals

Bésanger

et al. 2018

Multi-Agent Systems and Agreement Technologies

View full text Add to dashboard Cite

We propose in this paper a distributed method to solve the security constrained optimal power flow problem (SCOPF) that considers not only contingencies on transmission lines but also on generators. With this aim, we extend the formulation of the SCOPF problem to consider the primary frequency response of generators as well as the short term constraints of generators and transmission lines. Then, we distribute the problem among different agents and we use a decentralized decision making algorithm, based on the Alternating Direction Method of Multipliers (ADMM), to optimize the grid power supply while being resilient to violations that would occur during contingencies. Finally, we prove the effectiveness of this formulation and implementation on a simple test system.

show abstract