Distributed Lagrangian Method for Tie-Line Scheduling in Power Grids under Uncertainty

Research output: Contribution to journalConference article

Abstract

System operators (SOs) manage the grid and its assets in different parts (areas) of an interconnected power network. One would ideally seek to co-optimize the grid assets across multiple areas by solving a centralized optimization problem. Gathering the dispatch cost structures and the network constraints from all areas for a centralized solution remains difficult due to technical, historical, and sometimes legal barriers. Motivated by the need for a distributed solution architecture for multi-area power systems, we propose a distributed Lagrangian algorithm in this paper. We establish convergence rates for our algorithm that solves the deterministic tie-line scheduling problem as well as its robust variant (with policy space approximations). Our algorithm does not need any form of central coordination. We illustrate its efficacy on IEEE test systems.

Original languageEnglish (US)
Pages (from-to)88-90
Number of pages3
JournalPerformance Evaluation Review
Volume45
Issue number2
DOIs
StatePublished - Sep 1 2017
EventWorkshop on MAthematical Performance Modeling and Analysis, MAMA 2017, 2017 Greenmetrics Workshop and Workshop on Critical Infrastructure Network Security, CINS 2017 - Urbana-Champaign, United States
Duration: Jun 1 2017 → …

Fingerprint

Scheduling
Parallel algorithms
Costs
Uncertainty

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications

Cite this

Distributed Lagrangian Method for Tie-Line Scheduling in Power Grids under Uncertainty. / Doan, Thinh T.; Bose, Subhonmesh; Beck, Carolyn L.

In: Performance Evaluation Review, Vol. 45, No. 2, 01.09.2017, p. 88-90.

Research output: Contribution to journalConference article

@article{937d4384358641dba57ae9ee1081dd97,
title = "Distributed Lagrangian Method for Tie-Line Scheduling in Power Grids under Uncertainty",
abstract = "System operators (SOs) manage the grid and its assets in different parts (areas) of an interconnected power network. One would ideally seek to co-optimize the grid assets across multiple areas by solving a centralized optimization problem. Gathering the dispatch cost structures and the network constraints from all areas for a centralized solution remains difficult due to technical, historical, and sometimes legal barriers. Motivated by the need for a distributed solution architecture for multi-area power systems, we propose a distributed Lagrangian algorithm in this paper. We establish convergence rates for our algorithm that solves the deterministic tie-line scheduling problem as well as its robust variant (with policy space approximations). Our algorithm does not need any form of central coordination. We illustrate its efficacy on IEEE test systems.",
author = "Doan, {Thinh T.} and Subhonmesh Bose and Beck, {Carolyn L}",
year = "2017",
month = "9",
day = "1",
doi = "10.1145/3152042.3152069",
language = "English (US)",
volume = "45",
pages = "88--90",
journal = "Performance Evaluation Review",
issn = "0163-5999",
publisher = "Association for Computing Machinery (ACM)",
number = "2",

}

TY - JOUR

T1 - Distributed Lagrangian Method for Tie-Line Scheduling in Power Grids under Uncertainty

AU - Doan, Thinh T.

AU - Bose, Subhonmesh

AU - Beck, Carolyn L

PY - 2017/9/1

Y1 - 2017/9/1

N2 - System operators (SOs) manage the grid and its assets in different parts (areas) of an interconnected power network. One would ideally seek to co-optimize the grid assets across multiple areas by solving a centralized optimization problem. Gathering the dispatch cost structures and the network constraints from all areas for a centralized solution remains difficult due to technical, historical, and sometimes legal barriers. Motivated by the need for a distributed solution architecture for multi-area power systems, we propose a distributed Lagrangian algorithm in this paper. We establish convergence rates for our algorithm that solves the deterministic tie-line scheduling problem as well as its robust variant (with policy space approximations). Our algorithm does not need any form of central coordination. We illustrate its efficacy on IEEE test systems.

AB - System operators (SOs) manage the grid and its assets in different parts (areas) of an interconnected power network. One would ideally seek to co-optimize the grid assets across multiple areas by solving a centralized optimization problem. Gathering the dispatch cost structures and the network constraints from all areas for a centralized solution remains difficult due to technical, historical, and sometimes legal barriers. Motivated by the need for a distributed solution architecture for multi-area power systems, we propose a distributed Lagrangian algorithm in this paper. We establish convergence rates for our algorithm that solves the deterministic tie-line scheduling problem as well as its robust variant (with policy space approximations). Our algorithm does not need any form of central coordination. We illustrate its efficacy on IEEE test systems.

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

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

U2 - 10.1145/3152042.3152069

DO - 10.1145/3152042.3152069

M3 - Conference article

AN - SCOPUS:85041389699

VL - 45

SP - 88

EP - 90

JO - Performance Evaluation Review

JF - Performance Evaluation Review

SN - 0163-5999

IS - 2

ER -