Engineering topics

Karimi, Hazhar Sufi

Publications and source records attributed to Karimi, Hazhar Sufi.

3 records

DOE OSTI2022

Dynamic signal recovery in distribution grids using compressive lossy measurements

Distribution system state estimation requires reliable aggregation of the measured data. However, the large volume of the measured data imposes a significant stress on the underlying communication infrastructure. With the challenges associated with measurement availability, current distribution systems are typically unobservable. To cope with the unobservability issue, compressive sensing theory allows us to recover system state information from a small number of measurements provided the states of the distribution system exhibit sparsity. In this paper, we evaluate the robustness of an updated Kalman filtered modified compressive sensing (KF-ModCS) technique that dynamically estimates the grid states using a small fraction of measured data. In practice, measurements used for sparsity based state estimation may also be intermittent due to communication network induced losses. Further, to understand the effect of packet losses on KF-ModCS, we provide an upper bound for the expected variances of the state estimation error for a given rate of information loss. This upper bound is further improved if the support set of the sparse signal that characterizes the state dynamics does not change over time and/or the reduced model is observable. Simulations based on two practical data sets collected from actual customers in a distribution grid validate the theoretical results.

24 POWER TRANSMISSION AND DISTRIBUTION↗

DOE OSTI2021

Joint Topology Identification and State Estimation in Unobservable Distribution Grids

Many distribution system operations (e.g., state estimation, control, fault detection/localization) rely on the assumption that the underlying topology is accurately defined. In general, topology identification is a challenging problem in distribution systems as these systems are unobservable with a very limited number of available measurements. In this paper, we tackle this problem by designing a compressive sensing framework that jointly estimates the systems states and network topology via an integrated mixed integer nonlinear program (MINLP) formulation. Here, two reformulations of the original MINLP problems are investigated. Firstly, in order to remove the nonlinearity in the MINLP formulation, a mixed integer linear programming (MILP) problem that employs auxiliary variables is derived. Furthermore, to achieve a faster solution, convex relaxation of the original formulation is derived. Finally, using a Markovian model for topology changes, prior information about system topology is used to improve topology identification particularly when a limited amount of measurements is available. Simulation results on IEEE 37-bus test feeder and IEEE 123-bus test feeder illustrate the efficiency and scalability of the proposed approaches from both state estimation and topology identification point of view (even with 30% of available data).

42 ENGINEERING↗

DOE OSTI2020

Recursive Dynamic Compressive Sensing in Smart Distribution Systems

With a transition to a smarter grid, we are witnessing a significant growth in smart metering infrastructure and sensor deployment in the distribution system. The underlying communication infrastructure is stressed due to the large volume of data that is generated by the smart meters/sensors. Furthermore, real time operations such as state estimation and control are impaired due to the lack of reliable aggregation of the data. In this paper, we exploit the underlying sparsity in grid data to implement two recursive dynamic compressive sensing (CS) approaches-streaming modified weighted-`1 CS and Kalman filtered CS. These approaches aim to reconstruct the sparse signal using the current underdetermined measurements and the prior information about the sparse signal and its support set. Slow signal and support change is in distribution grid data is validated using Pecan Street data. Both the IEEE 34 node test feeder system and PecanStreet data are considered as two examples to validate the superior performance of the two recursive CS techniques relative to classic CS.

Karimi, Hazhar Sufi↗