Name
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. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1109/IAS.2019.8912329 | IEEE Industry Applications Society Annual Meeting |
Keywords | Field | DocType |
PMU placement,tree decomposition,dynamic programming,power dominating set(PDS),observability | Dynamic programming,Computer science,Distributed computing | Conference |
ISSN | Citations | PageRank |
0197-2618 | 0 | 0.34 |
References | Authors | |
0 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Xian-Chang Guo | 1 | 0 | 0.34 |
| Chung-Shou Liao | 2 | 0 | 1.35 |
| Chia-chi Chu | 3 | 164 | 31.80 |