2018
DOI: 10.1109/tac.2017.2760284
|View full text |Cite
|
Sign up to set email alerts
|

An Incentive-Based Online Optimization Framework for Distribution Grids

Abstract: Abstract-This paper formulates a time-varying social-welfare maximization problem for distribution grids with distributed energy resources (DERs) and develops online distributed algorithms to identify (and track) its solutions. In the considered setting, network operator and DER-owners pursue given operational and economic objectives, while concurrently ensuring that voltages are within prescribed limits. The proposed algorithm affords an online implementation to enable tracking of the solutions in the presenc… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
100
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
4
3
2

Relationship

3
6

Authors

Journals

citations
Cited by 93 publications
(100 citation statements)
references
References 40 publications
0
100
0
Order By: Relevance
“…[2] RC k P K calculates and sends ř iPN k`µ i pt`1q´µ i pt`1q˘to CC; unclustered node i P N 0 sends pµ i pt`1q´µ i pt`1qq to CC. [3] CC computes within the reduced network…”
Section: A Distribution Feeder As Networked Autonomous Gridsmentioning
confidence: 99%
“…[2] RC k P K calculates and sends ř iPN k`µ i pt`1q´µ i pt`1q˘to CC; unclustered node i P N 0 sends pµ i pt`1q´µ i pt`1qq to CC. [3] CC computes within the reduced network…”
Section: A Distribution Feeder As Networked Autonomous Gridsmentioning
confidence: 99%
“…Furthermore, the discrepancy due to the regularization term can be bounded and is proportional to η. We refer the details to [7], [33]. For the rest of this section, we will focus on solving the saddle point of the regularized Lagrangian (7).…”
Section: B Opf and Primal-dual Gradient Algorithmmentioning
confidence: 99%
“…Several different market-based coordination mechanisms have been proposed in the literature [2], [3], [23]. For analysis purposes, we primarily focus on the mechanism proposed in [2] (also given in Section II of [3]) and suggest generalizations in later sections.…”
Section: B Market Clearing Mechanismmentioning
confidence: 99%
“…6(b) and 6(c). By (22), (23), B on and B off will then act on X on k and X off k , respectively, to give X k+1 .…”
Section: Reformulation Of the Transition Equationsmentioning
confidence: 99%