Decentralized PMU Placements in a Dynamic Programming Approach

Xian Chang Guo; Chung Shou Liao; Chia Chi Chu

doi:10.1109/IAS.2019.8912329

Decentralized PMU Placements in a Dynamic Programming Approach

Xian Chang Guo, Chung Shou Liao, Chia Chi Chu

National Tsing Hua University

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

3 Scopus citations

Abstract

In order to fit in latency requirements for wide-area monitoring, protect and control (WAMPAC) applications, a decentralized architecture collaborated with measurement systems and cyber-physical systems is considered. To this end, a tree decomposition (TD) technique is utilized to decompose power grids. Many difficult problems can thus be solved by knowing local information only and/or exchanged knowledge with external regions. System-wide observability are geometrically analyzed by studying the relative power dominating set (PDS) problem in graph theory under the decentralized architecture. The hardness of subproblems determined by the maximal tree node size of a TD, denoted as parameter k, is also discussed. Extensive simulations are conducted on several IEEE testbed systems to demonstrate the effectiveness of the proposed formulation.

Original language	English
Title of host publication	2019 IEEE Industry Applications Society Annual Meeting, IAS 2019
Publisher	Institute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)	9781538645390
DOIs	https://doi.org/10.1109/IAS.2019.8912329
State	Published - 09 2019
Externally published	Yes
Event	2019 IEEE Industry Applications Society Annual Meeting, IAS 2019 - Baltimore, United States Duration: 29 09 2019 → 03 10 2019

Publication series

Name	2019 IEEE Industry Applications Society Annual Meeting, IAS 2019

Conference

Conference	2019 IEEE Industry Applications Society Annual Meeting, IAS 2019
Country/Territory	United States
City	Baltimore
Period	29/09/19 → 03/10/19

Bibliographical note

Publisher Copyright:
© 2019 IEEE.

Keywords

PMU placement
dynamic programming
observability
power dominating set(PDS)
tree decomposition

Access to Document

10.1109/IAS.2019.8912329

Cite this

@inproceedings{64520f36bbca41728d6ec0a6c6f906e2,

title = "Decentralized PMU Placements in a Dynamic Programming Approach",

abstract = "In order to fit in latency requirements for wide-area monitoring, protect and control (WAMPAC) applications, a decentralized architecture collaborated with measurement systems and cyber-physical systems is considered. To this end, a tree decomposition (TD) technique is utilized to decompose power grids. Many difficult problems can thus be solved by knowing local information only and/or exchanged knowledge with external regions. System-wide observability are geometrically analyzed by studying the relative power dominating set (PDS) problem in graph theory under the decentralized architecture. The hardness of subproblems determined by the maximal tree node size of a TD, denoted as parameter k, is also discussed. Extensive simulations are conducted on several IEEE testbed systems to demonstrate the effectiveness of the proposed formulation.",

keywords = "PMU placement, dynamic programming, observability, power dominating set(PDS), tree decomposition",

author = "Guo, {Xian Chang} and Liao, {Chung Shou} and Chu, {Chia Chi}",

note = "Publisher Copyright: {\textcopyright} 2019 IEEE.; 2019 IEEE Industry Applications Society Annual Meeting, IAS 2019 ; Conference date: 29-09-2019 Through 03-10-2019",

year = "2019",

month = sep,

doi = "10.1109/IAS.2019.8912329",

language = "英语",

series = "2019 IEEE Industry Applications Society Annual Meeting, IAS 2019",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

booktitle = "2019 IEEE Industry Applications Society Annual Meeting, IAS 2019",

address = "美国",

}

Guo, XC, Liao, CS & Chu, CC 2019, Decentralized PMU Placements in a Dynamic Programming Approach. in 2019 IEEE Industry Applications Society Annual Meeting, IAS 2019., 8912329, 2019 IEEE Industry Applications Society Annual Meeting, IAS 2019, Institute of Electrical and Electronics Engineers Inc., 2019 IEEE Industry Applications Society Annual Meeting, IAS 2019, Baltimore, United States, 29/09/19. https://doi.org/10.1109/IAS.2019.8912329

Decentralized PMU Placements in a Dynamic Programming Approach. / Guo, Xian Chang; Liao, Chung Shou; Chu, Chia Chi.
2019 IEEE Industry Applications Society Annual Meeting, IAS 2019. Institute of Electrical and Electronics Engineers Inc., 2019. 8912329 (2019 IEEE Industry Applications Society Annual Meeting, IAS 2019).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Decentralized PMU Placements in a Dynamic Programming Approach

AU - Guo, Xian Chang

AU - Liao, Chung Shou

AU - Chu, Chia Chi

PY - 2019/9

Y1 - 2019/9

N2 - In order to fit in latency requirements for wide-area monitoring, protect and control (WAMPAC) applications, a decentralized architecture collaborated with measurement systems and cyber-physical systems is considered. To this end, a tree decomposition (TD) technique is utilized to decompose power grids. Many difficult problems can thus be solved by knowing local information only and/or exchanged knowledge with external regions. System-wide observability are geometrically analyzed by studying the relative power dominating set (PDS) problem in graph theory under the decentralized architecture. The hardness of subproblems determined by the maximal tree node size of a TD, denoted as parameter k, is also discussed. Extensive simulations are conducted on several IEEE testbed systems to demonstrate the effectiveness of the proposed formulation.

AB - In order to fit in latency requirements for wide-area monitoring, protect and control (WAMPAC) applications, a decentralized architecture collaborated with measurement systems and cyber-physical systems is considered. To this end, a tree decomposition (TD) technique is utilized to decompose power grids. Many difficult problems can thus be solved by knowing local information only and/or exchanged knowledge with external regions. System-wide observability are geometrically analyzed by studying the relative power dominating set (PDS) problem in graph theory under the decentralized architecture. The hardness of subproblems determined by the maximal tree node size of a TD, denoted as parameter k, is also discussed. Extensive simulations are conducted on several IEEE testbed systems to demonstrate the effectiveness of the proposed formulation.

KW - PMU placement

KW - dynamic programming

KW - observability

KW - power dominating set(PDS)

KW - tree decomposition

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

U2 - 10.1109/IAS.2019.8912329

DO - 10.1109/IAS.2019.8912329

M3 - 会议稿件

AN - SCOPUS:85076744058

T3 - 2019 IEEE Industry Applications Society Annual Meeting, IAS 2019

BT - 2019 IEEE Industry Applications Society Annual Meeting, IAS 2019

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 2019 IEEE Industry Applications Society Annual Meeting, IAS 2019

Y2 - 29 September 2019 through 3 October 2019

ER -

Decentralized PMU Placements in a Dynamic Programming Approach

Abstract

Publication series

Conference

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this