252 results on '"Deka, Deepjyoti"'
Search Results
2. Equitable Routing -- Rethinking the Multiple Traveling Salesman Problem
- Author
-
Bhadoriya, Abhay Singh, Deka, Deepjyoti, and Sundar, Kaarthik
- Subjects
Mathematics - Optimization and Control ,Computer Science - Robotics ,90B06, 90C27, 90C57, 90C90 - Abstract
The Multiple Traveling Salesman Problem (MTSP) with a single depot is a generalization of the well-known Traveling Salesman Problem (TSP) that involves an additional parameter, namely, the number of salesmen. In the MTSP, several salesmen at the depot need to visit a set of interconnected targets, such that each target is visited precisely once by at most one salesman while minimizing the total length of their tours. An equally important variant of the MTSP, the min-max MTSP, aims to distribute the workload (length of the individual tours) among salesmen by requiring the longest tour of all the salesmen to be as short as possible, i.e., minimizing the maximum tour length among all salesmen. The min-max MTSP appears in real-life applications to ensure a good balance of workloads for the salesmen. It is known in the literature that the min-max MTSP is notoriously difficult to solve to optimality due to the poor lower bounds its linear relaxations provide. In this paper, we formulate two novel parametric variants of the MTSP called the "fair-MTSP". One variant is formulated as a Mixed-Integer Second Order Cone Program (MISOCP), and the other as a Mixed Integer Linear Program (MILP). Both focus on enforcing the workloads for the salesmen to be equitable, i.e., the distribution of tour lengths for the salesmen to be fair while minimizing the total cost of their tours. We present algorithms to solve the two variants of the fair-MTSP to global optimality and computational results on benchmark and real-world test instances that make a case for fair-MTSP as a viable alternative to the min-max MTSP., Comment: 10 pages
- Published
- 2024
3. Contributions of Individual Generators to Nodal Carbon Emissions
- Author
-
Chen, Yize, Deka, Deepjyoti, and Shi, Yuanyuan
- Subjects
Electrical Engineering and Systems Science - Systems and Control - Abstract
Recent shifts toward sustainable energy systems have witnessed the fast deployment of carbon-free and carbon-efficient generations across the power networks. However, the benefits of carbon reduction are not experienced evenly throughout the grid. Each generator can have distinct carbon emission rates. Due to the existence of physical power flows, nodal power consumption is met by a combination of a set of generators, while such combination is determined by network topology, generators' characteristics and power demand. This paper describes a technique based on physical power flow model, which can efficiently compute the nodal carbon emissions contributed by each single generator given the generation and power flow information. We also extend the technique to calculate both the nodal average carbon emission and marginal carbon emission rates. Simulation results validate the effectiveness of the calculations, while our technique provides a fundamental tool for applications such as carbon auditing, carbon-oriented demand management and future carbon-oriented capacity expansion., Comment: Accepted at ACM e-Energy 2024. Code available at https://github.com/chennnnnyize/Carbon_Emission_Power_Grids
- Published
- 2023
4. Fairly Extreme: Minimizing Outages Equitably
- Author
-
Sundar, Kaarthik, Deka, Deepjyoti, and Bent, Russell
- Subjects
Mathematics - Optimization and Control ,Electrical Engineering and Systems Science - Systems and Control - Abstract
This paper focuses on the problem of minimizing the outages due to extreme events on the power grid equitably among all customers of the grid. The paper presents two ways of incorporating fairness into the existing formulations that seek to minimize the total outage in the power grid. The first method is motivated by existing literature on incorporating fairness in optimization problems and this is done by modifying the problem's objective function. The second method introduces a novel notion of fairness, termed $\varepsilon$-fairness, that can be incorporated into existing problem formulations through a single second-order cone constraint. Both these methods are very general and can be used to incorporate fairness in existing planning and operational optimization problems in the power grid and beyond. Extensive computational case studies that examine the effectiveness of both these methods to characterize fairness is presented followed by conclusions and ways forward., Comment: 8 pages
- Published
- 2023
5. Data-Efficient Strategies for Probabilistic Voltage Envelopes under Network Contingencies
- Author
-
Pareek, Parikshit, Deka, Deepjyoti, and Misra, Sidhant
- Subjects
Computer Science - Machine Learning ,Electrical Engineering and Systems Science - Systems and Control - Abstract
This work presents an efficient data-driven method to construct probabilistic voltage envelopes (PVE) using power flow learning in grids with network contingencies. First, a network-aware Gaussian process (GP) termed Vertex-Degree Kernel (VDK-GP), developed in prior work, is used to estimate voltage-power functions for a few network configurations. The paper introduces a novel multi-task vertex degree kernel (MT-VDK) that amalgamates the learned VDK-GPs to determine power flows for unseen networks, with a significant reduction in the computational complexity and hyperparameter requirements compared to alternate approaches. Simulations on the IEEE 30-Bus network demonstrate the retention and transfer of power flow knowledge in both N-1 and N-2 contingency scenarios. The MT-VDK-GP approach achieves over 50% reduction in mean prediction error for novel N-1 contingency network configurations in low training data regimes (50-250 samples) over VDK-GP. Additionally, MT-VDK-GP outperforms a hyper-parameter based transfer learning approach in over 75% of N-2 contingency network structures, even without historical N-2 outage data. The proposed method demonstrates the ability to achieve PVEs using sixteen times fewer power flow solutions compared to Monte-Carlo sampling-based methods., Comment: 10 Pages
- Published
- 2023
6. Information Theoretically Optimal Sample Complexity of Learning Dynamical Directed Acyclic Graphs
- Author
-
Veedu, Mishfad Shaikh, Deka, Deepjyoti, and Salapaka, Murti V.
- Subjects
Statistics - Machine Learning ,Computer Science - Machine Learning ,Electrical Engineering and Systems Science - Systems and Control ,Mathematics - Optimization and Control - Abstract
In this article, the optimal sample complexity of learning the underlying interactions or dependencies of a Linear Dynamical System (LDS) over a Directed Acyclic Graph (DAG) is studied. We call such a DAG underlying an LDS as dynamical DAG (DDAG). In particular, we consider a DDAG where the nodal dynamics are driven by unobserved exogenous noise sources that are wide-sense stationary (WSS) in time but are mutually uncorrelated, and have the same {power spectral density (PSD)}. Inspired by the static DAG setting, a metric and an algorithm based on the PSD matrix of the observed time series are proposed to reconstruct the DDAG. It is shown that the optimal sample complexity (or length of state trajectory) needed to learn the DDAG is $n=\Theta(q\log(p/q))$, where $p$ is the number of nodes and $q$ is the maximum number of parents per node. To prove the sample complexity upper bound, a concentration bound for the PSD estimation is derived, under two different sampling strategies. A matching min-max lower bound using generalized Fano's inequality also is provided, thus showing the order optimality of the proposed algorithm., Comment: 21 pages. Accepted for publication in AISTATS 2024
- Published
- 2023
7. Fast Risk Assessment in Power Grids through Novel Gaussian Process and Active Learning
- Author
-
Pareek, Parikshit, Deka, Deepjyoti, and Misra, Sidhant
- Subjects
Electrical Engineering and Systems Science - Systems and Control ,Computer Science - Machine Learning - Abstract
This paper presents a graph-structured Gaussian process (GP) model for data-driven risk assessment of critical voltage constraints. The proposed GP is based on a novel kernel, named the vertex-degree kernel (VDK), that decomposes the voltage-load relationship based on the network graph. To estimate the GP efficiently, we propose a novel active learning scheme that leverages the additive structure of VDK. Further, we prove a probabilistic bound on the error in risk estimation using VDK-GP model that demonstrates that it is statistically comparable to using standard AC power flow (AC-PF), but does not require computing a large number of ACPF solutions. Simulations demonstrate that the proposed VDK-GP achieves more than two fold sample complexity reduction, compared to a generic GP on medium scale 500-Bus and large scale 1354-Bus power systems. Moreover, active learning achieves an impressive reduction of over 15 times in comparison to the time complexity of Monte-Carlo simulations (MCS), and have risk estimation error of order 1E-4 for both 500-Bus and 1354-Bus system, demonstrating its superior efficiency in risk estimation., Comment: 9 pages
- Published
- 2023
8. Mitigating the Impact of Uncertain Wildfire Risk on Power Grids through Topology Control
- Author
-
Zhou, Yuqi, Sundar, Kaarthik, Deka, Deepjyoti, and Zhu, Hao
- Subjects
Electrical Engineering and Systems Science - Systems and Control ,Mathematics - Optimization and Control - Abstract
Wildfires pose a significant threat to the safe and reliable operations of the electric grid. To mitigate wildfire risk, system operators resort to public safety power shutoffs, or PSPS, that shed load for a subset of customers. As wildfire risk forecasts are stochastic, such decision-making may often be sub-optimal. This paper proposes a two-stage topology control problem that jointly minimizes generation and load-shedding costs in the face of uncertain fire risk. Compared to existing work, we include preand post-event topology control actions and consider scenarios where the wildfire risk is known with low and high confidence. The effectiveness of the proposed approach is demonstrated using a benchmark test system, artificially geo-located in Southern California, and using stochastic wildfire risk data that exists in the literature. Our work provides a crucial study of the comparative benefits of pre-event versus post-event control and the effects of wildfire risk accuracy on each control strategy., Comment: 6 pages, 6 figures
- Published
- 2023
9. GP CC-OPF: Gaussian Process based optimization tool for Chance-Constrained Optimal Power Flow
- Author
-
Mitrovic, Mile, Kundacina, Ognjen, Lukashevich, Aleksandr, Vorobev, Petr, Terzija, Vladimir, Maximov, Yury, and Deka, Deepjyoti
- Subjects
Statistics - Machine Learning ,Computer Science - Machine Learning - Abstract
The Gaussian Process (GP) based Chance-Constrained Optimal Power Flow (CC-OPF) is an open-source Python code developed for solving economic dispatch (ED) problem in modern power grids. In recent years, integrating a significant amount of renewables into a power grid causes high fluctuations and thus brings a lot of uncertainty to power grid operations. This fact makes the conventional model-based CC-OPF problem non-convex and computationally complex to solve. The developed tool presents a novel data-driven approach based on the GP regression model for solving the CC-OPF problem with a trade-off between complexity and accuracy. The proposed approach and developed software can help system operators to effectively perform ED optimization in the presence of large uncertainties in the power grid., Comment: 6 pages, 2 figures
- Published
- 2023
10. Learning to Accelerate the Global Optimization of Quadratically-Constrained Quadratic Programs
- Author
-
Kannan, Rohit, Nagarajan, Harsha, and Deka, Deepjyoti
- Subjects
Mathematics - Optimization and Control ,90C26, 90C31, 65K05 - Abstract
We learn optimal instance-specific heuristics for the global minimization of nonconvex quadratically-constrained quadratic programs (QCQPs). Specifically, we consider partitioning-based mixed-integer programming relaxations for nonconvex QCQPs and propose the novel problem of $\textit{strong partitioning}$ to optimally partition variable domains $\textit{without}$ sacrificing global optimality. We design a local optimization method for solving this challenging max-min strong partitioning problem and replace this expensive benchmark strategy with a machine learning (ML) approximation for homogeneous families of QCQPs. We present a detailed computational study on randomly generated families of QCQPs, including instances of the pooling problem, using the open-source global solver Alpine. Our numerical experiments demonstrate that strong partitioning and its ML approximation significantly reduce Alpine's solution time by factors of $3.5 - 16.5$ and $2 - 4.5$ $\textit{on average}$ and by maximum factors of $15 - 700$ and $10 - 200$, respectively, over the different QCQP families.
- Published
- 2022
11. Data-Driven Chance Constrained AC-OPF using Hybrid Sparse Gaussian Processes
- Author
-
Mitrovic, Mile, Lukashevich, Aleksandr, Vorobev, Petr, Terzija, Vladimir, Maximov, Yury, and Deka, Deepjyoti
- Subjects
Electrical Engineering and Systems Science - Systems and Control ,Computer Science - Machine Learning ,Statistics - Machine Learning - Abstract
The alternating current (AC) chance-constrained optimal power flow (CC-OPF) problem addresses the economic efficiency of electricity generation and delivery under generation uncertainty. The latter is intrinsic to modern power grids because of the high amount of renewables. Despite its academic success, the AC CC-OPF problem is highly nonlinear and computationally demanding, which limits its practical impact. For improving the AC-OPF problem complexity/accuracy trade-off, the paper proposes a fast data-driven setup that uses the sparse and hybrid Gaussian processes (GP) framework to model the power flow equations with input uncertainty. We advocate the efficiency of the proposed approach by a numerical study over multiple IEEE test cases showing up to two times faster and more accurate solutions compared to the state-of-the-art methods., Comment: 7 pages, 3 figures
- Published
- 2022
12. Data-Driven Stochastic AC-OPF using Gaussian Processes
- Author
-
Mitrovic, Mile, Lukashevich, Aleksandr, Vorobev, Petr, Terzija, Vladimir, Budenny, Semen, Maximov, Yury, and Deka, Deepjyoti
- Subjects
Statistics - Machine Learning ,Computer Science - Machine Learning ,Electrical Engineering and Systems Science - Systems and Control - Abstract
In recent years, electricity generation has been responsible for more than a quarter of the greenhouse gas emissions in the US. Integrating a significant amount of renewables into a power grid is probably the most accessible way to reduce carbon emissions from power grids and slow down climate change. Unfortunately, the most accessible renewable power sources, such as wind and solar, are highly fluctuating and thus bring a lot of uncertainty to power grid operations and challenge existing optimization and control policies. The chance-constrained alternating current (AC) optimal power flow (OPF) framework finds the minimum cost generation dispatch maintaining the power grid operations within security limits with a prescribed probability. Unfortunately, the AC-OPF problem's chance-constrained extension is non-convex, computationally challenging, and requires knowledge of system parameters and additional assumptions on the behavior of renewable distribution. Known linear and convex approximations to the above problems, though tractable, are too conservative for operational practice and do not consider uncertainty in system parameters. This paper presents an alternative data-driven approach based on Gaussian process (GP) regression to close this gap. The GP approach learns a simple yet non-convex data-driven approximation to the AC power flow equations that can incorporate uncertainty inputs. The latter is then used to determine the solution of CC-OPF efficiently, by accounting for both input and parameter uncertainty. The practical efficiency of the proposed approach using different approximations for GP-uncertainty propagation is illustrated over numerous IEEE test cases., Comment: 29 pages, 5 figures
- Published
- 2022
13. Can locational disparity of prosumer energy optimization due to inverter rules be limited?
- Author
-
Hashmi, Md Umar, Deka, Deepjyoti, Bušić, Ana, and Van Hertem, Dirk
- Subjects
Electrical Engineering and Systems Science - Systems and Control - Abstract
To mitigate issues related to the growth of variable smart loads and distributed generation, distribution system operators (DSO) now make it binding for prosumers with inverters to operate under pre-set rules. In particular, the maximum active and reactive power set points for prosumers are based on local voltage measurements to ensure that inverter output does not cause voltage violations. However, such actions, as observed in this work, restrict the range available for local energy management, with more adverse losses on arbitrage profits for prosumers located farther away from the substation. The goal of the paper is three-fold: (a) to develop an optimal local energy optimization algorithm for activation of load flexibility and inverter-interfaced solar PV and energy storage under time-varying electricity prices; (b) to quantify the locational impact on prosumer arbitrage gains due to inverter injection rules prevalent in different energy markets; (c) to propose a computationally efficient hybrid inverter control policy which provides voltage regulation while substantially reducing locational disparity. Using numerical simulations on three identical prosumers located at different parts of a radial feeder, we show that our control policy is able to minimize locational disparity in arbitrage gains between customers at the beginning and end of the feeder to 1.4%, while PV curtailment is reduced by 91.7% compared to the base case with restrictive volt-Var and volt-watt policy.
- Published
- 2022
14. Learning Distribution Grid Topologies: A Tutorial
- Author
-
Deka, Deepjyoti, Kekatos, Vassilis, and Cavraro, Guido
- Subjects
Mathematics - Optimization and Control ,Computer Science - Machine Learning ,Electrical Engineering and Systems Science - Systems and Control - Abstract
Unveiling feeder topologies from data is of paramount importance to advance situational awareness and proper utilization of smart resources in power distribution grids. This tutorial summarizes, contrasts, and establishes useful links between recent works on topology identification and detection schemes that have been proposed for power distribution grids. The primary focus is to highlight methods that overcome the limited availability of measurement devices in distribution grids, while enhancing topology estimates using conservation laws of power-flow physics and structural properties of feeders. Grid data from phasor measurement units or smart meters can be collected either passively in the traditional way, or actively, upon actuating grid resources and measuring the feeder's voltage response. Analytical claims on feeder identifiability and detectability are reviewed under disparate meter placement scenarios. Such topology learning claims can be attained exactly or approximately so via algorithmic solutions with various levels of computational complexity, ranging from least-squares fits to convex optimization problems, and from polynomial-time searches over graphs to mixed-integer programs. Although the emphasis is on radial single-phase feeders, extensions to meshed and/or multiphase circuits are sometimes possible and discussed. This tutorial aspires to provide researchers and engineers with knowledge of the current state-of-the-art in tractable distribution grid learning and insights into future directions of work., Comment: 15 pages, 6 figures
- Published
- 2022
15. Markovian Decentralized Ensemble Control for Demand Response
- Author
-
Peng, Guanze, Mieth, Robert, Deka, Deepjyoti, and Dvorkin, Yury
- Subjects
Electrical Engineering and Systems Science - Systems and Control - Abstract
With the advancement in smart grid and smart energy devices, demand response becomes one of the most economic and feasible solutions to ease the load stress of the power grids during peak hours. In this work, we propose a fully decentralized ensemble control framework with consensus for demand response (DR) events and compatible control methods based on random policies. We show that under the consensus that is tailored to DR, our proposed decentralized control method yields the same optimality as the centralized control method in both myopic and multistage settings.
- Published
- 2022
16. Detecting Anomalies using Overlapping Electrical Measurements in Smart Power Grids
- Author
-
Sontowski, Sina, Lawrence, Nigel, Deka, Deepjyoti, and Gupta, Maanak
- Subjects
Computer Science - Cryptography and Security ,Electrical Engineering and Systems Science - Signal Processing - Abstract
As cyber-attacks against critical infrastructure become more frequent, it is increasingly important to be able to rapidly identify and respond to these threats. This work investigates two independent systems with overlapping electrical measurements with the goal to more rapidly identify anomalies. The independent systems include HIST, a SCADA historian, and ION, an automatic meter reading system (AMR). While prior research has explored the benefits of fusing measurements, the possibility of overlapping measurements from an existing electrical system has not been investigated. To that end, we explore the potential benefits of combining overlapping measurements both to improve the speed/accuracy of anomaly detection and to provide additional validation of the collected measurements. In this paper, we show that merging overlapping measurements provide a more holistic picture of the observed systems. By applying Dynamic Time Warping more anomalies were found -- specifically, an average of 349 times more anomalies, when considering anomalies from both overlapping measurements. When merging the overlapping measurements, a percent change of anomalies of up to 785\% can be achieved compared to a non-merge of the data as reflected by experimental results.
- Published
- 2022
17. DNN-based Policies for Stochastic AC OPF
- Author
-
Gupta, Sarthak, Misra, Sidhant, Deka, Deepjyoti, and Kekatos, Vassilis
- Subjects
Mathematics - Optimization and Control ,Statistics - Machine Learning - Abstract
A prominent challenge to the safe and optimal operation of the modern power grid arises due to growing uncertainties in loads and renewables. Stochastic optimal power flow (SOPF) formulations provide a mechanism to handle these uncertainties by computing dispatch decisions and control policies that maintain feasibility under uncertainty. Most SOPF formulations consider simple control policies such as affine policies that are mathematically simple and resemble many policies used in current practice. Motivated by the efficacy of machine learning (ML) algorithms and the potential benefits of general control policies for cost and constraint enforcement, we put forth a deep neural network (DNN)-based policy that predicts the generator dispatch decisions in real time in response to uncertainty. The weights of the DNN are learnt using stochastic primal-dual updates that solve the SOPF without the need for prior generation of training labels and can explicitly account for the feasibility constraints in the SOPF. The advantages of the DNN policy over simpler policies and their efficacy in enforcing safety limits and producing near optimal solutions are demonstrated in the context of a chance constrained formulation on a number of test cases.
- Published
- 2021
18. Importance sampling approach to chance-constrained DC optimal power flow
- Author
-
Lukashevich, Aleksander, Gorchakov, Vyacheslav, Vorobev, Petr, Deka, Deepjyoti, and Maximov, Yury
- Subjects
Mathematics - Optimization and Control ,Statistics - Computation - Abstract
Despite significant economic and ecological effects, a higher level of renewable energy generation leads to increased uncertainty and variability in power injections, thus compromising grid reliability. In order to improve power grid security, we investigate a joint chance-constrained (CC) direct current (DC) optimal power flow (OPF) problem. The problem aims to find economically optimal power generation while guaranteeing that all power generation, line flows, and voltages simultaneously remain within their bounds with a pre-defined probability. Unfortunately, the problem is computationally intractable even if the distribution of renewables fluctuations is specified. Moreover, existing approximate solutions to the joint CC OPF problem are overly conservative, and therefore have less value for the operational practice. This paper proposes an importance sampling approach to the CC DC OPF problem, which yields better complexity and accuracy than current state-of-the-art methods. The algorithm efficiently reduces the number of scenarios by generating and using only the most important of them, thus enabling real-time solutions for test cases with up to several hundred buses.
- Published
- 2021
19. Efficient and passive learning of networked dynamical systems driven by non-white exogenous inputs
- Author
-
Doddi, Harish, Deka, Deepjyoti, Talukdar, Saurav, and Salapaka, Murti
- Subjects
Computer Science - Machine Learning ,Computer Science - Artificial Intelligence - Abstract
We consider a networked linear dynamical system with $p$ agents/nodes. We study the problem of learning the underlying graph of interactions/dependencies from observations of the nodal trajectories over a time-interval $T$. We present a regularized non-casual consistent estimator for this problem and analyze its sample complexity over two regimes: (a) where the interval $T$ consists of $n$ i.i.d. observation windows of length $T/n$ (restart and record), and (b) where $T$ is one continuous observation window (consecutive). Using the theory of $M$-estimators, we show that the estimator recovers the underlying interactions, in either regime, in a time-interval that is logarithmic in the system size $p$. To the best of our knowledge, this is the first work to analyze the sample complexity of learning linear dynamical systems \emph{driven by unobserved not-white wide-sense stationary (WSS) inputs}., Comment: Accepted in AISTATS 2022
- Published
- 2021
20. Physics-Conditioned Generative Adversarial Networks for State Estimation in Active Power Distribution Systems with Low Observability
- Author
-
Kamal, Mohasinina, Li, Wenting, Deka, Deepjyoti, and Mohsenian-Rad, Hamed
- Published
- 2022
21. PPGN: Physics-Preserved Graph Networks for Real-Time Fault Location in Distribution Systems with Limited Observation and Labels
- Author
-
Li, Wenting and Deka, Deepjyoti
- Subjects
Computer Science - Machine Learning ,Electrical Engineering and Systems Science - Systems and Control - Abstract
Electrical faults may trigger blackouts or wildfires without timely monitoring and control strategy. Traditional solutions for locating faults in distribution systems are not real-time when network observability is low, while novel black-box machine learning methods are vulnerable to stochastic environments. We propose a novel Physics-Preserved Graph Network (PPGN) architecture to accurately locate faults at the node level with limited observability and labeled training data. PPGN has a unique two-stage graph neural network architecture. The first stage learns the graph embedding to represent the entire network using a few measured nodes. The second stage finds relations between the labeled and unlabeled data samples to further improve the location accuracy. We explain the benefits of the two-stage graph configuration through a random walk equivalence. We numerically validate the proposed method in the IEEE 123-node and 37-node test feeders, demonstrating the superior performance over three baseline classifiers when labeled training data is limited, and loads and topology are allowed to vary., Comment: 10 pages, 4 figure
- Published
- 2021
- Full Text
- View/download PDF
22. Privacy-Aware Load Ensemble Control: A Linearly-Solvable MDP Approach
- Author
-
Hassan, Ali, Deka, Deepjyoti, and Dvorkin, Yury
- Subjects
Electrical Engineering and Systems Science - Systems and Control - Abstract
Demand response (DR) programs engage distributed demand-side resources, e.g., controllable residential and commercial loads, in providing ancillary services for electric power systems. Ensembles of these resources can help reducing system load peaks and meeting operational limits by adjusting their electric power consumption. To equip utilities or load aggregators with adequate decision-support tools for ensemble dispatch, we develop a Markov Decision Process (MDP) approach to optimally control load ensembles in a privacy-preserving manner. To this end, the concept of differential privacy is internalized into the MDP routine to protect transition probabilities and, thus, privacy of DR participants. The proposed approach also provides a trade-off between solution optimality and privacy guarantees, and is analyzed using real-world data from DR events in the New York University microgrid in New York, NY.
- Published
- 2021
23. Efficient Topology Design Algorithms for Power Grid Stability
- Author
-
Bhela, Siddharth, Nagarajan, Harsha, Deka, Deepjyoti, and Kekatos, Vassilis
- Subjects
Mathematics - Optimization and Control ,Mathematics - Dynamical Systems - Abstract
The dynamic response of power grids to small disturbances influences their overall stability. This paper examines the effect of network topology on the linearized time-invariant dynamics of electric power systems. The proposed framework utilizes ${\cal H}_2$-norm based stability metrics to study the optimal placement of lines on existing networks as well as the topology design of new networks. The design task is first posed as an NP-hard mixed-integer nonlinear program (MINLP) that is exactly reformulated as a mixed-integer linear program (MILP) using McCormick linearization. To improve computation time, graph-theoretic properties are exploited to derive valid inequalities (cuts) and tighten bounds on the continuous optimization variables. Moreover, a cutting plane generation procedure is put forth that is able to interject the MILP solver and augment additional constraints to the problem on-the-fly. The efficacy of our approach in designing optimal grid topologies is demonstrated through numerical tests on the IEEE 39-bus network., Comment: 6 pages
- Published
- 2021
24. Topology Learning in Radial Dynamical Systems with Unreliable Data
- Author
-
Subramanian, Venkat Ram, Deka, Deepjyoti, Talukdar, Saurav, Lamperski, Andy, and Salapaka, Murti
- Subjects
Electrical Engineering and Systems Science - Systems and Control - Abstract
Many complex engineering systems admit bidirectional and linear couplings between their agents. Blind and passive methods to identify such influence pathways/couplings from data are central to many applications. However, dynamically related data-streams originating at different sources are prone to corruption caused by asynchronous time-stamps of different streams, packet drops and noise. Such imperfect information may be present in the entire observation period, and hence not detected by change-detection algorithms that require an initial clean observation period. Prior work has shown that spurious links are inferred in the graph structure due to the corrupted data-streams, which prevents consistent learning. In this article, we provide a novel approach to detect the location of corrupt agents as well as present an algorithm to learn the structure of radial dynamical systems despite corrupted data streams. In particular, we show that our approach provably learns the true radial structure if the unknown corrupted nodes are at least three hops away from each other. Our theoretical results are further validated in test dynamical network., Comment: Under review in IEEE TCNS
- Published
- 2020
25. Estimating Linear Dynamical Networks of Cyclostationary Processes
- Author
-
Doddi, Harish, Deka, Deepjyoti, Talukdar, Saurav, and Salapaka, Murti
- Subjects
Mathematics - Optimization and Control ,Computer Science - Machine Learning - Abstract
Topology learning is an important problem in dynamical systems with implications to security and optimal control. The majority of prior work in consistent topology estimation relies on dynamical systems excited by temporally uncorrelated processes. In this article, we present a novel algorithm for guaranteed topology learning, in networks that are excited by temporally colored, cyclostationary processes. Furthermore, unlike prior work, the framework applies to linear dynamic system with complex valued dependencies. In the second part of the article, we analyze conditions for consistent topology learning for bidirected radial networks when a subset of the network is unobserved. Here, few agents are unobserved and the full topology along with unobserved nodes are recovered from observed agents data alone. Our theoretical contributions are validated on test networks., Comment: 14 pages, Under review
- Published
- 2020
26. Physics-Informed Learning for High Impedance Faults Detection
- Author
-
Li, Wenting and Deka, Deepjyoti
- Subjects
Electrical Engineering and Systems Science - Signal Processing ,Electrical Engineering and Systems Science - Systems and Control - Abstract
High impedance faults (HIFs) in distribution grids may cause wildfires and threaten human lives. Conventional protection relays at substations fail to detect more than 10\% HIFs since over-currents are low and the signatures of HIFs are local. With more $\mu$PMU being installed in the distribution system, high-resolution $\mu$PMU datasets provide the opportunity of detecting HIFs from multiple points. Still, the main obstacle in applying the $\mu$PMU datasets is the lack of labels. To address this issue, we construct a physics-informed convolutional auto-encoder (PICAE) to detect HIFs without labeled HIFs for training. The significance of our PICAE is a physical regularization, derived from the elliptical trajectory of voltages-current characteristics, to distinguish HIFs from other abnormal events even in highly noisy situations. We formulate a system-wide detection framework that merges multiple nodes' local detection results to improve the detection accuracy and reliability. The proposed approaches are validated in the IEEE 34-node test feeder simulated through PSCAD/EMTDC. Our PICAE outperforms the existing works in various scenarios and is robust to different observability and noise., Comment: 7 pages, 6 figures
- Published
- 2020
27. Guaranteed Phase & Topology Identification in Three Phase Distribution Grids
- Author
-
Bariya, Mohini, Deka, Deepjyoti, and von Meier, Alexandra
- Subjects
Electrical Engineering and Systems Science - Systems and Control ,Mathematics - Optimization and Control - Abstract
We present a method for joint phase identification and topology recovery in unbalanced three phase radial networks using only voltage measurements. By recovering phases and topology jointly, we utilize all three phase voltage measurements and can handle networks where some buses have a subset of three phases. Our method is theoretically justified by a novel linearized formulation of unbalanced three phase power flow and makes precisely defined and reasonable assumptions on line impedances and load statistics. We validate our method on three IEEE test networks simulated under realistic conditions in OpenDSS, comparing our performance to the state of the art. In addition to providing a new method for phase and topology recovery, our intuitively structured linearized model will provide a foundation for future work in this and other applications., Comment: 8 pages, 6 figures
- Published
- 2020
28. A Hierarchical Approach to Multi-Energy Demand Response: From Electricity to Multi-Energy Applications
- Author
-
Hassan, Ali, Acharya, Samrat, Chertkov, Michael, Deka, Deepjyoti, and Dvorkin, Yury
- Subjects
Electrical Engineering and Systems Science - Systems and Control ,Computer Science - Machine Learning - Abstract
Due to proliferation of energy efficiency measures and availability of the renewable energy resources, traditional energy infrastructure systems (electricity, heat, gas) can no longer be operated in a centralized manner under the assumption that consumer behavior is inflexible, i.e. cannot be adjusted in return for an adequate incentive. To allow for a less centralized operating paradigm, consumer-end perspective and abilities should be integrated in current dispatch practices and accounted for in switching between different energy sources not only at the system but also at the individual consumer level. Since consumers are confined within different built environments, this paper looks into an opportunity to control energy consumption of an aggregation of many residential, commercial and industrial consumers, into an ensemble. This ensemble control becomes a modern demand response contributor to the set of modeling tools for multi-energy infrastructure systems.
- Published
- 2020
29. Tractable learning in under-excited power grids
- Author
-
Deka, Deepjyoti, Doddi, Harish, Misra, Sidhant, and Salapaka, Murti
- Subjects
Electrical Engineering and Systems Science - Systems and Control ,Computer Science - Machine Learning - Abstract
Estimating the structure of physical flow networks such as power grids is critical to secure delivery of energy. This paper discusses statistical structure estimation in power grids in the "under-excited" regime, where a subset of internal nodes do not have external injection. Prior estimation algorithms based on nodal potentials or voltages fail in the under-excited regime. We propose a novel topology learning algorithm for learning underexcited general (non-radial) networks based on physics-informed conservation laws. We prove the asymptotic correctness of our algorithm for grids with non-adjacent under-excited internal nodes. More importantly, we theoretically analyze our algorithm's efficacy under noisy measurements, and determine bounds on maximum noise under which asymptotically correct recovery is guaranteed. Our approach is validated through simulations with non-linear voltage samples generated on test grids with real injection data, Comment: 10 pages, 8 figures
- Published
- 2020
30. Data-Driven Learning and Load Ensemble Control
- Author
-
Hassan, Ali, Deka, Deepjyoti, Chertkov, Michael, and Dvorkin, Yury
- Subjects
Electrical Engineering and Systems Science - Systems and Control ,Computer Science - Machine Learning - Abstract
Demand response (DR) programs aim to engage distributed small-scale flexible loads, such as thermostatically controllable loads (TCLs), to provide various grid support services. Linearly Solvable Markov Decision Process (LS-MDP), a variant of the traditional MDP, is used to model aggregated TCLs. Then, a model-free reinforcement learning technique called Z-learning is applied to learn the value function and derive the optimal policy for the DR aggregator to control TCLs. The learning process is robust against uncertainty that arises from estimating the passive dynamics of the aggregated TCLs. The efficiency of this data-driven learning is demonstrated through simulations on Heating, Cooling & Ventilation (HVAC) units in a testbed neighborhood of residential houses.
- Published
- 2020
31. Energy Storage Optimization for Grid Reliability
- Author
-
Hashmi, Md Umar, Deka, Deepjyoti, Pereira, Lucas, and Busic, Ana
- Subjects
Electrical Engineering and Systems Science - Systems and Control ,Mathematics - Optimization and Control - Abstract
Large scale renewable energy integration is being planned for multiple power grids around the world. To achieve secure and stable grid operations, additional resources/reserves are needed to mitigate the inherent intermittency of renewable energy sources (RES). In this paper, we present formulations to understand the effect of fast storage reserves in improving grid reliability under different cost functions. Our formulations and solution schemes not only aim to minimize imbalance but also maintain state-of-charge (SoC) of storage. In particular, we show that accounting for system response due to inertia and local governor response enables a more realistic quantification of storage requirements for damping net load fluctuations. The storage requirement is significantly lower than values determined when such traditional response are not accounted for. We demonstrate the performance of our designed policies through studies using real data from the Elia TSO in Belgium and BPA agency in the USA. The numerical results enable us to benchmark the marginal effect on reliability due to increasing storage size under different system responses and associated cost functions.
- Published
- 2020
32. Stochastic and Distributionally Robust Load Ensemble Control
- Author
-
Hassan, Ali, Mieth, Robert, Deka, Deepjyoti, and Dvorkin, Yury
- Subjects
Electrical Engineering and Systems Science - Systems and Control - Abstract
Demand response (DR) programs aim to engage distributed demand-side resources in providing ancillary services for electric power systems. Previously, aggregated thermostatically controlled loads (TCLs) have been demonstrated as a technically viable and economically valuable provider of such services that can effectively compete with conventional generation resources in reducing load peaks and smoothing demand fluctuations. Yet, to provide these services at scale, a large number of TCLs must be accurately aggregated and operated in sync. This paper describes a Markov Decision Process (MDP) that aggregates and models an ensemble of TCLs. Using the MDP framework, we propose to internalize the exogenous uncertain dynamics of TCLs by means of stochastic and distributionally robust optimization. First, under mild assumptions on the underlying uncertainty, we derive analytical stochastic and distributionally robust control policies for dispatching a given TCL ensemble. Second, we further relax these mild assumptions to allow for a more delicate treatment of uncertainty, which leads to distributionally robust MDP formulations with moment- and Wasserstein-based ambiguity sets that can be efficiently solved numerically. The case study compares the analytical and numerical control policies using a simulated ensemble of 1,000 air conditioners.
- Published
- 2019
33. Real-time Anomaly Detection and Classification in Streaming PMU Data
- Author
-
Hannon, Christopher, Deka, Deepjyoti, Jin, Dong, Vuffray, Marc, and Lokhov, Andrey Y.
- Subjects
Electrical Engineering and Systems Science - Signal Processing ,Statistics - Machine Learning - Abstract
Ensuring secure and reliable operations of the power grid is a primary concern of system operators. Phasor measurement units (PMUs) are rapidly being deployed in the grid to provide fast-sampled operational data that should enable quicker decision-making. This work presents a general interpretable framework for analyzing real-time PMU data, and thus enabling grid operators to understand the current state and to identify anomalies on the fly. Applying statistical learning tools on the streaming data, we first learn an effective dynamical model to describe the current behavior of the system. Next, we use the probabilistic predictions of our learned model to define in a principled way an efficient anomaly detection tool. Finally, the last module of our framework produces on-the-fly classification of the detected anomalies into common occurrence classes using features that grid operators are familiar with. We demonstrate the efficacy of our interpretable approach through extensive numerical experiments on real PMU data collected from a transmission operator in the USA., Comment: 9 pages, 12 figures
- Published
- 2019
34. Stochastic AC Optimal Power Flow: A Data-Driven Approach
- Author
-
Mezghani, Ilyes, Misra, Sidhant, and Deka, Deepjyoti
- Subjects
Electrical Engineering and Systems Science - Systems and Control ,Mathematics - Optimization and Control - Abstract
There is an emerging need for efficient solutions to stochastic AC Optimal Power Flow ({AC-}OPF) to ensure optimal and reliable grid operations in the presence of increasing demand and generation uncertainty. This paper presents a highly scalable data-driven algorithm for stochastic AC-OPF that has extremely low sample requirement. The novelty behind the algorithm's performance involves an iterative scenario design approach that merges information regarding constraint violations in the system with data-driven sparse regression. Compared to conventional methods with random scenario sampling, our approach is able to provide feasible operating points for realistic systems with much lower sample requirements. Furthermore, multiple sub-tasks in our approach can be easily paralleled and based on historical data to enhance its performance and application. We demonstrate the computational improvements of our approach through simulations on different test cases in the IEEE PES PGLib-OPF benchmark library., Comment: a version of this paper will appear in the proceedings of the 21st Power Systems Computation Conference (PSCC 2020)
- Published
- 2019
35. An Adversarial Model for Attack Vector Vulnerability Analysis on Power and Gas Delivery Operations
- Author
-
Carreno, Ignacio Losada, Scaglione, Anna, Zlotnik, Anatoly, Deka, Deepjyoti, and Sundar, Kaarthik
- Subjects
Electrical Engineering and Systems Science - Systems and Control - Abstract
Power systems often rely on natural gas pipeline networks to supply fuel for gas-fired generation. Market inefficiencies and a lack of formal coordination between the wholesale power and gas delivery infrastructures may magnify the broader impact of a cyber-attack on a natural gas pipeline. In this study we present a model that can be used to quantify the impact of cyber-attacks on electricity and gas delivery operations. We model activation of cyber-attack vectors that attempt to gain access to pipeline gas compressor controls using a continuous-time Markov chain over a state space based on the gas operator Industrial Control System firewall zone partition. Our approach evaluates the operating states and decision-making in the networks using physically realistic and operationally representative models. We summarize these models, the sequence of analyses used to quantify the impacts of a cyber-incident, and propose a Monte Carlo simulation approach to quantify the resulting effect on the reliability of the bulk power system by the increase in operational cost. The methodology is applied to a case study of interacting power, gas, and cyber test networks.
- Published
- 2019
36. Data-driven stochastic AC-OPF using Gaussian process regression
- Author
-
Mitrovic, Mile, Lukashevich, Aleksandr, Vorobev, Petr, Terzija, Vladimir, Budennyy, Semen, Maximov, Yury, and Deka, Deepjyoti
- Published
- 2023
- Full Text
- View/download PDF
37. Contributions of Individual Generators to Nodal Carbon Emissions
- Author
-
Chen, Yize, primary, Deka, Deepjyoti, additional, and Shi, Yuanyuan, additional
- Published
- 2024
- Full Text
- View/download PDF
38. Graphical Models in Meshed Distribution Grids: Topology estimation, change detection and limitations
- Author
-
Deka, Deepjyoti, Talukdar, Saurav, Chertkov, Michael, and Salapaka, Murti
- Subjects
Electrical Engineering and Systems Science - Systems and Control ,Mathematics - Optimization and Control - Abstract
Graphical models are a succinct way to represent the structure in probability distributions. This article analyzes the graphical model of nodal voltages in non-radial power distribution grids. Using algebraic and structural properties of graphical models, algorithms exactly determining topology and detecting line changes for distribution grids are presented along with their theoretical limitations. We show that if distribution grids have cycles/loops of size greater than three, then nodal voltages are sufficient for efficient topology estimation without additional assumptions on system parameters. In contrast, line failure or change detection using nodal voltages does not require any structural assumption. Under noisy measurements, we provide the first non-trivial bounds on the maximum noise that the system can tolerate for asymptotically correct topology recovery. The performance of the designed algorithms is validated with nonlinear AC power flow samples generated by Matpower on test grids, including scenarios with injection correlations and system noise., Comment: 12 pages, 9 figures, IEEE Transactions on Smart Grid
- Published
- 2019
39. Exact Topology Learning in a Network of Cyclostationary Processes
- Author
-
Doddi, Harish, Talukdar, Saurav, Deka, Deepjyoti, and Salapaka, Murti
- Subjects
Electrical Engineering and Systems Science - Systems and Control - Abstract
Learning the structure of a network from time series data, in particular cyclostationary data, is of significant interest in many disciplines such as power grids, biology and finance. In this article, an algorithm is presented for reconstruction of the topology of a network of cyclostationary processes. To the best of our knowledge, this is the first work to guarantee exact recovery without any assumptions on the underlying structure. The method is based on a lifting technique by which cyclostationary processes are mapped to vector wide sense stationary processes and further on semi-definite properties of matrix Wiener filters for the said processes.We demonstrate the performance of the proposed algorithm on a Resistor-Capacitor network and present the accuracy of reconstruction for varying sample sizes., Comment: 6 pages, 3 figures, A version of this paper will appear in American Control Conference 2019
- Published
- 2019
40. Designing Power Grid Topologies for Minimizing Network Disturbances: An Exact MILP Formulation
- Author
-
Bhela, Siddharth, Deka, Deepjyoti, Nagarajan, Harsha, and Kekatos, Vassilis
- Subjects
Mathematics - Optimization and Control - Abstract
The dynamic response of power grids to small transient events or persistent stochastic disturbances influences their stable operation. This paper studies the effect of topology on the linear time-invariant dynamics of power networks. For a variety of stability metrics, a unified framework based on the $H_2$-norm of the system is presented. The proposed framework assesses the robustness of power grids to small disturbances and is used to study the optimal placement of new lines on existing networks as well as the design of radial (tree) and meshed (loopy) topologies for new networks. Although the design task can be posed as a mixed-integer semidefinite program (MI-SDP), its performance does not scale well with network size. Using McCormick relaxation, the topology design problem can be reformulated as a mixed-integer linear program (MILP). To improve the computation time, graphical properties are exploited to provide tighter bounds on the continuous optimization variables. Numerical tests on the IEEE 39-bus feeder demonstrate the efficacy of the optimal topology in minimizing disturbances., Comment: 8 pages, 4 figures
- Published
- 2019
41. Arbitrage with Power Factor Correction using Energy Storage
- Author
-
Hashmi, Md Umar, Deka, Deepjyoti, Busic, Ana, Pereira, Lucas, and Backhaus, Scott
- Subjects
Electrical Engineering and Systems Science - Systems and Control ,Mathematics - Optimization and Control - Abstract
The importance of reactive power compensation for power factor (PF) correction will significantly increase with the large-scale integration of distributed generation interfaced via inverters producing only active power. In this work, we focus on co-optimizing energy storage for performing energy arbitrage as well as local power factor correction. The joint optimization problem is non-convex, but can be solved efficiently using a McCormick relaxation along with penalty-based schemes. Using numerical simulations on real data and realistic storage profiles, we show that energy storage can correct PF locally without reducing arbitrage profit. It is observed that active and reactive power control is largely decoupled in nature for performing arbitrage and PF correction (PFC). Furthermore, we consider a real-time implementation of the problem with uncertain load, renewable and pricing profiles. We develop a model predictive control based storage control policy using auto-regressive forecast for the uncertainty. We observe that PFC is primarily governed by the size of the converter and therefore, look-ahead in time in the online setting does not affect PFC noticeably. However, arbitrage profit are more sensitive to uncertainty for batteries with faster ramp rates compared to slow ramping batteries., Comment: 10 pages, 8 figures
- Published
- 2019
42. Designing reactive power control rules for smart inverters using support vector machines
- Author
-
Jalali, Mana, Kekatos, Vassilis, Gatsis, Nikolaos, and Deka, Deepjyoti
- Subjects
Mathematics - Optimization and Control - Abstract
Smart inverters have been advocated as a fast-responding mechanism for voltage regulation in distribution grids. Nevertheless, optimal inverter coordination can be computationally demanding, and preset local control rules are known to be subpar. Leveraging tools from machine learning, the design of customized inverter control rules is posed here as a multi-task learning problem. Each inverter control rule is modeled as a possibly nonlinear function of local and/or remote control inputs. Given the electric coupling, the function outputs interact to yield the feeder voltage profile. Using an approximate grid model, inverter rules are designed jointly to minimize a voltage deviation objective based on anticipated load and solar generation scenarios. Each control rule is described by a set of coefficients, one for each training scenario. To reduce the communication overhead between the grid operator and the inverters, we devise a voltage regulation objective that is shown to promote parsimonious descriptions for inverter control rules. Numerical tests using real-world data on a benchmark feeder demonstrate the advantages of the novel nonlinear rules and explore the trade-off between voltage regulation and sparsity in rule descriptions.
- Published
- 2019
43. Learning for DC-OPF: Classifying active sets using neural nets
- Author
-
Deka, Deepjyoti and Misra, Sidhant
- Subjects
Computer Science - Systems and Control - Abstract
The optimal power flow is an optimization problem used in power systems operational planning to maximize economic efficiency while satisfying demand and maintaining safety margins. Due to uncertainty and variability in renewable energy generation and demand, the optimal solution needs to be updated in response to observed uncertainty realizations or near real-time forecast updates. To address the challenge of computing such frequent real-time updates to the optimal solution, recent literature has proposed the use of machine learning to learn the mapping between the uncertainty realization and the optimal solution. Further, learning the active set of constraints at optimality, as opposed to directly learning the optimal solution, has been shown to significantly simplify the machine learning task, and the learnt model can be used to predict optimal solutions in real-time. In this paper, we propose the use of classification algorithms to learn the mapping between the uncertainty realization and the active set of constraints at optimality, thus further enhancing the computational efficiency of the real-time prediction. We employ neural net classifiers for this task and demonstrate the excellent performance of this approach on a number of systems in the IEEE PES PGLib-OPF benchmark library.
- Published
- 2019
44. Learning a Generator Model from Terminal Bus Data
- Author
-
Stulov, Nikolay, Sobajic, Dejan J, Maximov, Yury, Deka, Deepjyoti, and Chertkov, Michael
- Subjects
Statistics - Machine Learning ,Computer Science - Machine Learning ,Mathematics - Optimization and Control - Abstract
In this work we investigate approaches to reconstruct generator models from measurements available at the generator terminal bus using machine learning (ML) techniques. The goal is to develop an emulator which is trained online and is capable of fast predictive computations. The training is illustrated on synthetic data generated based on available open-source dynamical generator model. Two ML techniques were developed and tested: (a) standard vector auto-regressive (VAR) model; and (b) novel customized long short-term memory (LSTM) deep learning model. Trade-offs in reconstruction ability between computationally light but linear AR model and powerful but computationally demanding LSTM model are established and analyzed., Comment: 6 pages, 9 figures
- Published
- 2019
- Full Text
- View/download PDF
45. Data-driven identification of a thermal network in multi-zone building
- Author
-
Doddi, Harish, Talukdar, Saurav, Deka, Deepjyoti, and Salapaka, Murti
- Subjects
Computer Science - Systems and Control - Abstract
System identification of smart buildings is necessary for their optimal control and application in demand response. The thermal response of a building around an operating point can be modeled using a network of interconnected resistors with capacitors at each node/zone called RC network. The development of the RC network involves two phases: obtaining the network topology, and estimating thermal resistances and capacitance's. In this article, we present a provable method to reconstruct the interaction topology of thermal zones of a building solely from temperature measurements. We demonstrate that our learning algorithm accurately reconstructs the interaction topology for a $5$ zone office building in EnergyPlus with real-world conditions. We show that our learning algorithm is able to recover the network structure in scenarios where prior research prove insufficient., Comment: 6 pages, 12 figures, 57th IEEE Conference on Decision and Control
- Published
- 2018
46. Real-time Faulted Line Localization and PMU Placement in Power Systems through Convolutional Neural Networks
- Author
-
Li, Wenting, Deka, Deepjyoti, Chertkov, Michael, and Wang, Meng
- Subjects
Computer Science - Systems and Control ,Computer Science - Machine Learning ,Statistics - Machine Learning - Abstract
Diverse fault types, fast re-closures, and complicated transient states after a fault event make real-time fault location in power grids challenging. Existing localization techniques in this area rely on simplistic assumptions, such as static loads, or require much higher sampling rates or total measurement availability. This paper proposes a faulted line localization method based on a Convolutional Neural Network (CNN) classifier using bus voltages. Unlike prior data-driven methods, the proposed classifier is based on features with physical interpretations that improve the robustness of the location performance. The accuracy of our CNN based localization tool is demonstrably superior to other machine learning classifiers in the literature. To further improve the location performance, a joint phasor measurement units (PMU) placement strategy is proposed and validated against other methods. A significant aspect of our methodology is that under very low observability (7% of buses), the algorithm is still able to localize the faulted line to a small neighborhood with high probability. The performance of our scheme is validated through simulations of faults of various types in the IEEE 39-bus and 68-bus power systems under varying uncertain conditions, system observability, and measurement quality., Comment: 11 pages, 8 figures
- Published
- 2018
47. Physics Informed Topology Learning in Networks of Linear Dynamical Systems
- Author
-
Talukdar, Saurav, Deka, Deepjyoti, Doddi, Harish, Materassi, Donatello, Chertkov, Misha, and Salapaka, Murti V.
- Subjects
Computer Science - Systems and Control ,Statistics - Machine Learning - Abstract
Learning influence pathways of a network of dynamically related processes from observations is of considerable importance in many disciplines. In this article, influence networks of agents which interact dynamically via linear dependencies are considered. An algorithm for the reconstruction of the topology of interaction based on multivariate Wiener filtering is analyzed. It is shown that for a vast and important class of interactions, that respect flow conservation, the topology of the interactions can be exactly recovered. The class of problems where reconstruction is guaranteed to be exact includes power distribution networks, dynamic thermal networks and consensus networks. The efficacy of the approach is illustrated through simulation and experiments on consensus networks, IEEE power distribution networks and thermal dynamics of buildings., Comment: 14 pages, 10 figures
- Published
- 2018
48. DNN-based policies for stochastic AC OPF
- Author
-
Gupta, Sarthak, Misra, Sidhant, Deka, Deepjyoti, and Kekatos, Vassilis
- Published
- 2022
- Full Text
- View/download PDF
49. Is Machine Learning in Power Systems Vulnerable?
- Author
-
Chen, Yize, Tan, Yushi, and Deka, Deepjyoti
- Subjects
Computer Science - Systems and Control - Abstract
Recent advances in Machine Learning(ML) have led to its broad adoption in a series of power system applications, ranging from meter data analytics, renewable/load/price forecasting to grid security assessment. Although these data-driven methods yield state-of-the-art performances in many tasks, the robustness and security of applying such algorithms in modern power grids have not been discussed. In this paper, we attempt to address the issues regarding the security of ML applications in power systems. We first show that most of the current ML algorithms proposed in power systems are vulnerable to adversarial examples, which are maliciously crafted input data. We then adopt and extend a simple yet efficient algorithm for finding subtle perturbations, which could be used for generating adversaries for both categorical(e.g., user load profile classification) and sequential applications(e.g., renewables generation forecasting). Case studies on classification of power quality disturbances and forecast of building loads demonstrate the vulnerabilities of current ML algorithms in power networks under our adversarial designs. These vulnerabilities call for design of robust and secure ML algorithms for real world applications., Comment: Accepted to IEEE SmartGridComm2018
- Published
- 2018
50. Optimal Load Ensemble Control in Chance-Constrained Optimal Power Flow
- Author
-
Hassan, Ali, Mieth, Robert, Chertkov, Michael, Deka, Deepjyoti, and Dvorkin, Yury
- Subjects
Computer Science - Systems and Control - Abstract
Distribution system operators (DSO) world-wide foresee a rapid roll-out of distributed energy resources. From the system perspective, their reliable and cost effective integration requires accounting for their physical properties in operating tools used by the DSO. This paper describes an approach to leverage the dispatch flexibility of thermostatically controlled loads (TCLs) for operating distribution systems with a high penetration level of photovoltaic resources. Each TCL ensemble is modeled using the Markov Decision Process (MDP). The MDP model is then integrated with the chance-constrained optimal power flow that accounts for the uncertainty of PV resources. Since the integrated optimization model cannot be solved efficiently by existing dynamic programming methods or off-the-shelf solvers, this paper proposes an iterative Spatio-Temporal Dual Decomposition algorithm (ST-D2). We demonstrate the usefulness of the proposed integrated optimization and ST-D2 algorithm on the IEEE 33-bus test system., Comment: 8 pages, 9 figures, 29 references
- Published
- 2018
Catalog
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.