Publication

Distributed Coordination of DERs With Storage for Dynamic Economic Dispatch

Cherukuri, A. & Cortes, J., Mar-2018, In : IEEE Transactions on Automatic Control. 63, 3, p. 835-842 8 p.

Research output: Contribution to journalArticleAcademicpeer-review

APA

Cherukuri, A., & Cortes, J. (2018). Distributed Coordination of DERs With Storage for Dynamic Economic Dispatch. IEEE Transactions on Automatic Control, 63(3), 835-842. https://doi.org/10.1109/TAC.2017.2731809

Author

Cherukuri, Ashish ; Cortes, Jorge. / Distributed Coordination of DERs With Storage for Dynamic Economic Dispatch. In: IEEE Transactions on Automatic Control. 2018 ; Vol. 63, No. 3. pp. 835-842.

Harvard

Cherukuri, A & Cortes, J 2018, 'Distributed Coordination of DERs With Storage for Dynamic Economic Dispatch', IEEE Transactions on Automatic Control, vol. 63, no. 3, pp. 835-842. https://doi.org/10.1109/TAC.2017.2731809

Standard

Distributed Coordination of DERs With Storage for Dynamic Economic Dispatch. / Cherukuri, Ashish; Cortes, Jorge.

In: IEEE Transactions on Automatic Control, Vol. 63, No. 3, 03.2018, p. 835-842.

Research output: Contribution to journalArticleAcademicpeer-review

Vancouver

Cherukuri A, Cortes J. Distributed Coordination of DERs With Storage for Dynamic Economic Dispatch. IEEE Transactions on Automatic Control. 2018 Mar;63(3):835-842. https://doi.org/10.1109/TAC.2017.2731809


BibTeX

@article{9528145a3d5144a28f3d90ffc809998e,
title = "Distributed Coordination of DERs With Storage for Dynamic Economic Dispatch",
abstract = "This paper considers the dynamic economic dispatch problem for a group of distributed energy resources (DERs) with storage that communicate over a weight-balanced strongly connected digraph. The objective is to collectively meet a certain load profile over a finite time horizon while minimizing the aggregate cost. At each time slot, each DER decides on the amount of generated power, the amount sent to/drawn from the storage unit, and the amount injected into the grid to satisfy the load. Additional constraints include bounds on the amount of generated power, ramp constraints on the difference in generation across successive time slots, and bounds on the amount of power in storage. We synthesize a provably correct distributed algorithm that solves the resulting finite-horizon optimization problem starting from any initial condition. Our design consists of two interconnected systems, one estimating the mismatch between the injection and the total load at each time slot, and another using this estimate to reduce the mismatch and optimize the total cost of generation while meeting the constraints.",
keywords = "Distributed algorithms, optimization methods, power generation dispatch, smart grids, MODEL-PREDICTIVE CONTROL, SYSTEMS",
author = "Ashish Cherukuri and Jorge Cortes",
year = "2018",
month = "3",
doi = "10.1109/TAC.2017.2731809",
language = "English",
volume = "63",
pages = "835--842",
journal = "IEEE-Transactions on Automatic Control",
issn = "0018-9286",
publisher = "IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC",
number = "3",

}

RIS

TY - JOUR

T1 - Distributed Coordination of DERs With Storage for Dynamic Economic Dispatch

AU - Cherukuri, Ashish

AU - Cortes, Jorge

PY - 2018/3

Y1 - 2018/3

N2 - This paper considers the dynamic economic dispatch problem for a group of distributed energy resources (DERs) with storage that communicate over a weight-balanced strongly connected digraph. The objective is to collectively meet a certain load profile over a finite time horizon while minimizing the aggregate cost. At each time slot, each DER decides on the amount of generated power, the amount sent to/drawn from the storage unit, and the amount injected into the grid to satisfy the load. Additional constraints include bounds on the amount of generated power, ramp constraints on the difference in generation across successive time slots, and bounds on the amount of power in storage. We synthesize a provably correct distributed algorithm that solves the resulting finite-horizon optimization problem starting from any initial condition. Our design consists of two interconnected systems, one estimating the mismatch between the injection and the total load at each time slot, and another using this estimate to reduce the mismatch and optimize the total cost of generation while meeting the constraints.

AB - This paper considers the dynamic economic dispatch problem for a group of distributed energy resources (DERs) with storage that communicate over a weight-balanced strongly connected digraph. The objective is to collectively meet a certain load profile over a finite time horizon while minimizing the aggregate cost. At each time slot, each DER decides on the amount of generated power, the amount sent to/drawn from the storage unit, and the amount injected into the grid to satisfy the load. Additional constraints include bounds on the amount of generated power, ramp constraints on the difference in generation across successive time slots, and bounds on the amount of power in storage. We synthesize a provably correct distributed algorithm that solves the resulting finite-horizon optimization problem starting from any initial condition. Our design consists of two interconnected systems, one estimating the mismatch between the injection and the total load at each time slot, and another using this estimate to reduce the mismatch and optimize the total cost of generation while meeting the constraints.

KW - Distributed algorithms

KW - optimization methods

KW - power generation dispatch

KW - smart grids

KW - MODEL-PREDICTIVE CONTROL

KW - SYSTEMS

UR - http://www.scopus.com/inward/record.url?scp=85028937697&partnerID=8YFLogxK

U2 - 10.1109/TAC.2017.2731809

DO - 10.1109/TAC.2017.2731809

M3 - Article

VL - 63

SP - 835

EP - 842

JO - IEEE-Transactions on Automatic Control

JF - IEEE-Transactions on Automatic Control

SN - 0018-9286

IS - 3

ER -

ID: 96183164