An official website of the United States government
Here’s how you know
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
Secure .gov websites use HTTPS
A lock (
) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.
Space-Time Approach for Disturbance Detection and Classification
Published
Author(s)
Hamid Gharavi
Abstract
A major challenge facing future grid systems is to identify the source of abnormal behaviors caused by faults or voltage instability. In this paper Phasor Measurement Units (PMUs) have been considered for detecting disturbances and degradation in the grid. Considering that the source of voltage instability mainly impacts neighboring areas, we present a simple and yet efficient algorithm that can identify affected areas. The algorithm is based on K-Mean optimization that classifies PMUs into different classes of power quality. We introduce the concept of a space-time solution to identify multiple faults. Since this is a multi-objective problem, we extend the K- mean algorithm to achieve space-time optimization in two successive stages (i.e., time and space). As an alternative approach to the space-time solution, we also present a hierarchical network that is based on a distributed mapping technique. This approach may only require time- based clustering as it limits the PMU population search to a small local region. We used our real-time Virtual PMU (VPMU) embedded into our software in the loop testbed to verify the performance of the proposed schemes. For the IEEE 39-bus transmission system, it is shown that the proposed space-time synchrophasor data classification scheme is capable of detecting and isolating areas in the grid that suffer from multiple disturbances, such as faults.
Gharavi, H.
(2017),
Space-Time Approach for Disturbance Detection and Classification, IEEE Transactions on Smart Grid, [online], https://tsapps.nist.gov/publication/get_pdf.cfm?pub_id=922991
(Accessed December 10, 2024)