Minimization of distribution grid losses by consumption coordination

Juelsgaard, Morten; Andersen, Palle; Wisniewski, Rafael

doi:10.1109/cca.2013.6662799

Cited by 3 publications

(5 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…i . .k/ / is gathered from all subproblems in order to calculate the update (16), and the updated .kC1/ is scattered for the following iteration, thus requiring a central coordination among subproblems. In [21], central coordination was avoided by propagating the result from each subproblem through the network, whereby each unit can make correct local updates of the Lagrange multipliers.…”

Section: Proofmentioning

confidence: 99%

“…Designing the weight matrix as in (33) implies that each node can perform an individual update of (16), which can be written on the form…”

Section: Applying Distributed Averagingmentioning

confidence: 99%

“…Because we do not assume that portfolio units are located in the same grid section, we refrain from considering issues such as grid congestion and simply regard the grid as an ideal bus. For more detailed work on grid related issues such as power losses and congestion, the reader is referred to studies such as .…”

Section: Portfolio Descriptionmentioning

confidence: 99%

“…-(16), let the local Lagrange multipliers be updated as N is an error as described by (59), g .k;h.k// i 2 R N is an -gradient as described by (61), and V is compact, convex. Further, let ¹˛.…”

mentioning

confidence: 99%

See 3 more Smart Citations

Fault tolerant distributed portfolio optimization in smart grids

Juelsgaard

Wiśniewski

Bendtsen

2014

Intl J Robust & Nonlinear

View full text Add to dashboard Cite

SUMMARYThis work considers a portfolio of units for electrical power production and the problem of utilizing it to maintain power balance in the electrical grid. We treat the portfolio as a graph in which the nodes are distributed generators and the links are communication paths. We present a distributed optimization scheme for power balancing, where communication is allowed only between units that are linked in the graph. We include consumers with controllable consumption as an active part of the portfolio. We show that a suboptimal, but arbitrarily good power balancing, can be obtained in an uncoordinated, distributed optimization framework, and we argue that the scheme will work even if the computation time is limited. We further show that our approach can tolerate changes in the portfolio, in the sense that increasing or reducing the number of units in the portfolio requires only local updates. This ensures that units experiencing faults or need for maintenance can be removed from the graph without affecting the overall performance or convergence of the optimization. The results are illustrated by numerical case studies. Copyright © 2014 John Wiley & Sons, Ltd.

show abstract

Section: Proofmentioning

confidence: 99%

“…Designing the weight matrix as in (33) implies that each node can perform an individual update of (16), which can be written on the form…”

Section: Applying Distributed Averagingmentioning

confidence: 99%

Section: Portfolio Descriptionmentioning

confidence: 99%

mentioning

confidence: 99%

See 2 more Smart Citations

Fault tolerant distributed portfolio optimization in smart grids

Juelsgaard

Wiśniewski

Bendtsen

2014

Intl J Robust & Nonlinear

View full text Add to dashboard Cite

show abstract

“…This paper is a continuation of the work by Juelsgaard et al (2013), where it was illustrated how control of EV power consumption could be employed for coordination, in order to minimize the incurred power loss, and reduce the overall grid loading. In the work at hand, we expand on this idea, and show how loss minimization can be used for coordinating consumption by EVs against production from solar panels, in order to increase the possible installation of both, without unacceptable voltage variations.…”

Section: Introductionmentioning

confidence: 98%