Robust Decentralized State Estimation and Tracking for Power Systems via Network Gossiping
This paper proposes a fully decentralized adaptive re-weighted state estimation (DARSE) scheme for power systems via network gossiping. The enabling technique is the proposed Gossip-based Gauss-Newton (GGN) algorithm, which allows to harness the computation capability of each area (i.e. a database s...
Saved in:
| Published in: | IEEE journal on selected areas in communications Vol. 31; no. 7; pp. 1184 - 1194 |
|---|---|
| Main Authors: | , |
| Format: | Journal Article |
| Language: | English |
| Published: |
New York
IEEE
01.07.2013
The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Subjects: | |
| ISSN: | 0733-8716, 1558-0008 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | This paper proposes a fully decentralized adaptive re-weighted state estimation (DARSE) scheme for power systems via network gossiping. The enabling technique is the proposed Gossip-based Gauss-Newton (GGN) algorithm, which allows to harness the computation capability of each area (i.e. a database server that accrues data from local sensors) to collaboratively solve for an accurate global state. The DARSE scheme mitigates the influence of bad data by updating their error variances online and re-weighting their contributions adaptively for state estimation. Thus, the global state can be estimated and tracked robustly using near-neighbor communications in each area. Compared to other distributed state estimation techniques, our communication model is flexible with respect to reconfigurations and resilient to random failures as long as the communication network is connected. Furthermore, we prove that the Jacobian of the power flow equations satisfies the Lipschitz condition that is essential for the GGN algorithm to converge to the desired solution. Simulations of the IEEE-118 system show that the DARSE scheme can estimate and track online the global power system state accurately, and degrades gracefully when there are random failures and bad data. |
|---|---|
| Bibliography: | ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 content type line 23 |
| ISSN: | 0733-8716 1558-0008 |
| DOI: | 10.1109/JSAC.2013.130703 |