arXiv subjects

Scott Backhaus

Publications and source records attributed to Scott Backhaus.

At least 19 recordsLinked to original sources

arXiv2019

Arbitrage with Power Factor Correction using Energy Storage

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.

eess.SY↗

arXiv2018

Joint Estimation of Topology and Injection Statistics in Distribution Grids with Missing Nodes

Optimal operation of distribution grid resources relies on accurate estimation of its state and topology. Practical estimation of such quantities is complicated by the limited presence of real-time meters. This paper discusses a theoretical framework to jointly estimate the operational topology and statistics of injections in radial distribution grids under limited availability of nodal voltage measurements. In particular we show that our proposed algorithms are able to provably learn the exact grid topology and injection statistics at all unobserved nodes as long as they are not adjacent. The algorithm design is based on novel ordered trends in voltage magnitude fluctuations at node groups, that are independently of interest for radial physical flow networks. The complexity of the designed algorithms is theoretically analyzed and their performance validated using both linearized and non-linear AC power flow samples in test distribution grids.

eess.SY↗

arXiv2018

Hierarchical Predictive Control Algorithms for Optimal Design and Operation of Microgrids

In recent years, microgrids, i.e., disconnected distribution systems, have received increasing interest from power system utilities to support the economic and resiliency posture of their systems. The economics of long distance transmission lines prevent many remote communities from connecting to bulk transmission systems and these communities rely on off-grid microgrid technology. Furthermore, communities that are connected to the bulk transmission system are investigating microgrid technologies that will support their ability to disconnect and operate independently during extreme events. In each of these cases, it is important to develop methodologies that support the capability to design and operate microgrids in the absence of transmission over long periods of time. Unfortunately, such planning problems tend to be computationally difficult to solve and those that are straightforward to solve often lack the modeling fidelity that inspires confidence in the results. To address these issues, we first develop a high fidelity model for design and operations of a microgrid that include component efficiencies, component operating limits, battery modeling, unit commitment, capacity expansion, and power flow physics; the resulting model is a mixed-integer quadratically-constrained quadratic program (MIQCQP). We then develop an iterative algorithm, referred to as the Model Predictive Control (MPC) algorithm, that allows us to solve the resulting MIQCQP. We show, through extensive computational experiments, that the MPC-based method can scale to problems that have a very long planning horizon and provide high quality solutions that lie within 5\% of optimal.

math.OC↗

arXiv2018

Topology Estimation using Graphical Models in Multi-Phase Power Distribution Grids

Distribution grid is the medium and low voltage part of a large power system. Structurally, the majority of distribution networks operate radially, such that energized lines form a collection of trees, i.e. forest, with a substation being at the root of any tree. The operational topology/forest may change from time to time, however tracking these changes, even though important for the distribution grid operation and control, is hindered by limited real-time monitoring. This paper develops a learning framework to reconstruct radial operational structure of the distribution grid from synchronized voltage measurements in the grid subject to the exogenous fluctuations in nodal power consumption. To detect operational lines our learning algorithm uses conditional independence tests for continuous random variables that is applicable to a wide class of probability distributions of the nodal consumption and Gaussian injections in particular. Moreover, our algorithm applies to the practical case of unbalanced three-phase power flow. Algorithm performance is validated on AC power flow simulations over IEEE distribution grid test cases.

eess.SY↗

arXiv2018

Approximating Flexibility in Distributed Energy Resources: A Geometric Approach

With increasing availability of communication and control infrastructure at the distribution systems, it is expected that the distributed energy resources (DERs) will take an active part in future power systems operations. One of the main challenges associated with integration of DERs in grid planning and control is in estimating the available flexibility in a collection of (heterogeneous) DERs, each of which may have local constraints that vary over time. In this work, we present a geometric approach for approximating the flexibility of a DER in modulating its active and reactive power consumption. The proposed method is agnostic about the type and model of the DERs, thereby facilitating a plug-and-play approach, and allows scalable aggregation of the flexibility of a collection of (heterogeneous) DERs at the distributed system level. Simulation results are presented to demonstrate the performance of the proposed method.

eess.SY↗

arXiv2018

Learning with End-Users in Distribution Grids: Topology and Parameter Estimation

Efficient operation of distribution grids in the smart-grid era is hindered by the limited presence of real-time nodal and line meters. In particular, this prevents the easy estimation of grid topology and associated line parameters that are necessary for control and optimization efforts in the grid. This paper studies the problems of topology and parameter estimation in radial balanced distribution grids where measurements are restricted to only the leaf nodes and all intermediate nodes are unobserved/hidden. To this end, we propose two exact learning algorithms that use balanced voltage and injection measured only at the end-users. The first algorithm requires time-stamped voltage samples, statistics of nodal power injections and permissible line impedances to recover the true topology. The second and improved algorithm requires only time-stamped voltage and complex power samples to recover both the true topology and impedances without any additional input (e.g., number of grid nodes, statistics of injections at hidden nodes, permissible line impedances). We prove the correctness of both learning algorithms for grids where unobserved buses/nodes have a degree greater than three and discuss extensions to regimes where that assumption doesn't hold. Further, we present computational and, more importantly, the sample complexity of our proposed algorithm for joint topology and impedance estimation. We illustrate the performance of the designed algorithms through numerical experiments on the IEEE and custom power distribution models.

eess.SY↗

arXiv2018

Statistical Learning For DC Optimal Power Flow

The optimal power flow problem plays an important role in the market clearing and operation of electric power systems. However, with increasing uncertainty from renewable energy operation, the optimal operating point of the system changes more significantly in real-time. In this paper, we aim at developing control policies that are able to track the optimal set-point with high probability. The approach is based on the observation that the OPF solution corresponding to a certain uncertainty realization is a basic feasible solution, which provides an affine control policy. The optimality of this basis policy is restricted to uncertainty realizations that share the same set of active constraints. We propose an ensemble control policy that combines several basis policies to improve performance. Although the number of possible bases is exponential in the size of the system, we show that only a few of them are relevant to system operation. We adopt a statistical learning approach to learn these important bases, and provide theoretical results that validate our observations. For most systems, we observe that efficient ensemble policies constructed using as few as ten bases, are able to obtain optimal solutions with high probability.

math.OC↗

arXiv2017

Relaxations of AC Maximal Load Delivery for Severe Contingency Analysis

This work considers the task of finding an AC-feasible operating point of a severely damaged transmission network while ensuring that a maximal amount of active power loads can be delivered. This AC Maximal Load Delivery (AC-MLD) task is a nonconvex nonlinear optimization problem that is incredibly challenging to solve on large-scale transmission system datasets. This work demonstrates that convex relaxations of the AC-MLD problem provide a reliable and scalable method for finding high-quality bounds on the amount of active power that can be delivered in the AC-MLD problem. To demonstrate their effectiveness, the solution methods proposed in this work are rigorously evaluated on 1000 N-k scenarios on seven power networks ranging in size from 70 to 6000 buses. The most effective relaxation of the AC-MLD problem converges in less than 20 seconds on commodity computing hardware for all 7000 of the scenarios considered.

math.OC↗

arXiv2017

Tools for improving resilience of electric distribution systems with networked microgrids

In the electrical grid, the distribution system is themost vulnerable to severe weather events. Well-placed and coordinatedupgrades, such as the combination of microgrids, systemhardening and additional line redundancy, can greatly reduce thenumber of electrical outages during extreme events. Indeed, ithas been suggested that resilience is one of the primary benefitsof networked microgrids. We formulate a resilient distributiongrid design problem as a two-stage stochastic program andmake use of decomposition-based heuristic algorithms to scaleto problems of practical size. We demonstrate the feasibilityof a resilient distribution design tool on a model of an actualdistribution network. We vary the study parameters, i.e., thecapital cost of microgrid generation relative to system hardeningand target system resilience metrics, and find regions in thisparametric space corresponding to different distribution systemarchitectures, such as individual microgrids, hardened networks,and a transition region that suggests the benefits of microgridsnetworked via hardened circuit segments.

cs.CE↗

arXiv2017

Resilient Transmission Grid Design: AC Relaxation vs. DC approximation

As illustrated in recent years (Superstorm Sandy, the Northeast Ice Storm of 1998, etc.), extreme weather events pose an enormous threat to the electric power transmission systems and the associated socio-economic systems that depend on reliable delivery of electric power. Besides inevitable malfunction of power grid components, deliberate malicious attacks can cause high risks to the service. These threats motivate the need for approaches and methods that improve the resilience of power systems. In this paper, we develop a model and tractable methods for optimizing the upgrade of transmission systems through a combination of hardening existing components, adding redundant lines, switches, generators, and FACTS and phase-shifting devices. While many of these controllable components are included in traditional design (expansion planning) problems, we uniquely assess their benefits from a resiliency point of view. More importantly, perhaps, we evaluate the suitability of using state-of-the-art AC power flow relaxations versus the common DC approximation in resilience improvement studies. The resiliency model and algorithms are tested on a modified version of the RTS-96 (single area) system.

math.OC↗

arXiv2017

Optimal Topology Design for Disturbance Minimization in Power Grids

The transient response of power grids to external disturbances influences their stable operation. This paper studies the effect of topology in linear time-invariant dynamics of different power grids. For a variety of objective functions, a unified framework based on $H_2$ norm is presented to analyze the robustness to ambient fluctuations. Such objectives include loss reduction, weighted consensus of phase angle deviations, oscillations in nodal frequency, and other graphical metrics. The framework is then used to study the problem of optimal topology design for robust control goals of different grids. For radial grids, the problem is shown as equivalent to the hard "optimum communication spanning tree" problem in graph theory and a combinatorial topology construction is presented with bounded approximation gap. Extended to loopy (meshed) grids, a greedy topology design algorithm is discussed. The performance of the topology design algorithms under multiple control objectives are presented on both loopy and radial test grids. Overall, this paper analyzes topology design algorithms on a broad class of control problems in power grid by exploring their combinatorial and graphical properties.

eess.SY↗

arXiv2017

Optimal Transmission Line Switching under Geomagnetic Disturbances

In recent years, there have been increasing concerns about how geomagnetic disturbances (GMDs) impact electrical power systems. Geomagnetically-induced currents (GICs) can saturate transformers, induce hot spot heating and increase reactive power losses. These effects can potentially cause catastrophic damage to transformers and severely impact the ability of a power system to deliver power. To address this problem, we develop a model of GIC impacts to power systems that includes 1) GIC thermal capacity of transformers as a function of normal Alternating Current (AC) and 2) reactive power losses as a function of GIC. We use this model to derive an optimization problem that protects power systems from GIC impacts through line switching, generator redispatch, and load shedding. We employ state-of-the-art convex relaxations of AC power flow equations to lower bound the objective. We demonstrate the approach on a modified RTS96 system and the UIUC 150-bus system and show that line switching is an effective means to mitigate GIC impacts. We also provide a sensitivity analysis of optimal switching decisions with respect to GMD direction.

eess.SY↗

arXiv2016

Experimental Determination of Demand Response Control Models and Cost of Control for Ensembles of Window-Mount Air Conditioners

Control of consumer electrical devices for providing electrical grid services is expanding in both the scope and the diversity of loads that are engaged in control, but there are few experimentally-based models of these devices suitable for control designs and for assessing the cost of control. A laboratory-scale test system is developed to experimentally evaluate the use of a simple window-mount air conditioner for electrical grid regulation services. The experimental test bed is a single, isolated air conditioner embedded in a test system that both emulates the thermodynamics of an air conditioned room and also isolates the air conditioner from the real-world external environmental and human variables that perturb the careful measurements required to capture a model that fully characterizes both the control response functions and the cost of control. The control response functions and cost of control are measured using harmonic perturbation of the temperature set point and a test protocol that further isolates the air conditioner from low frequency environmental variability.

math.OC↗

arXiv2016

Learning Topology of Distribution Grids using only Terminal Node Measurements

Distribution grids include medium and low voltage lines that are involved in the delivery of electricity from substation to end-users/loads. A distribution grid is operated in a radial/tree-like structure, determined by switching on or off lines from an underling loopy graph. Due to the presence of limited real-time measurements, the critical problem of fast estimation of the radial grid structure is not straightforward. This paper presents a new learning algorithm that uses measurements only at the terminal or leaf nodes in the distribution grid to estimate its radial structure. The algorithm is based on results involving voltages of node triplets that arise due to the radial structure. The polynomial computational complexity of the algorithm is presented along with a detailed analysis of its working. The most significant contribution of the approach is that it is able to learn the structure in certain cases where available measurements are confined to only half of the nodes. This represents learning under minimum permissible observability. Performance of the proposed approach in learning structure is demonstrated by experiments on test radial distribution grids.

math.OC↗

arXiv2016

Tractable Structure Learning in Radial Physical Flow Networks

Physical Flow Networks are different infrastructure networks that allow the flow of physical commodities through edges between its constituent nodes. These include power grid, natural gas transmission network, water pipelines etc. In such networks, the flow on each edge is characterized by a function of the nodal potentials on either side of the edge. Further the net flow in and out of each node is conserved. Learning the structure and state of physical networks is necessary for optimal control as well as to quantify its privacy needs. We consider radial flow networks and study the problem of learning the operational network from a loopy graph of candidate edges using statistics of nodal potentials. Based on the monotonic properties of the flow functions, the key result in this paper shows that if variance of the difference of nodal potentials is used to weight candidate edges, the operational edges form the minimum spanning tree in the loopy graph. Under realistic conditions on the statistics of nodal injection (consumption or production), we provide a greedy structure learning algorithm with quasilinear computational complexity in the number of candidate edges in the network. Our learning framework is very general due to two significant attributes. First it is independent of the specific marginal distributions of nodal potentials and only uses order properties in their second moments. Second, the learning algorithm is agnostic to exact flow functions that relate edge flows to corresponding potential differences and is applicable for a broad class of networks with monotonic flow functions. We demonstrate the efficacy of our work through realistic simulations on diverse physical flow networks and discuss possible extensions of our work to other regimes.

math.OC↗

arXiv2016

Operations- and Uncertainty-Aware Installation of FACTS Devices in a Large Transmission System

Decentralized electricity markets and more integration of renewables demand expansion of the existing transmission infrastructure to accommodate inflected variabilities in power flows. However, such expansion is severely limited in many countries because of political and environmental issues. Furthermore, high renewables integration requires additional reactive power support, which forces the transmission system operators to utilize the existing grid creatively, e.g., take advantage of new technologies, such as flexible alternating current transmission system (FACTS) devices. We formulate, analyze and solve the challenging investment planning problem of installation in an existing large-scale transmission grid multiple FACTS devices of two types (series capacitors and static VAR compensators.) We account for details of AC character of the power flows, probabilistic modeling of multiple-load scenarios, FACTS devices flexibility in terms of their adjustments within the capacity constraints, and long term practical tradeoffs between capital vs operational expenditures (CAPEX vs OPEX). It is demonstrated that proper installation of the devices allows to do both - extend or improve feasibility domain for the system and also decrease long term power generation cost (make cheaper generation available). Nonlinear, nonconvex, and multiple-scenario-aware optimization is resolved through an efficient heuristic algorithm consisting of a sequence of quadratic programmings solved by CPLEX combined with exact AC PF resolution for each scenario for maintaining feasible operational states during iterations. Efficiency and scalability of the approach is illustrated on the IEEE 30-bus model and the 2736-bus Polish model from Matpower.

math.OC↗

arXiv2016

Learning Topology of the Power Distribution Grid with and without Missing Data

Distribution grids refer to the part of the power grid that delivers electricity from substations to the loads. Structurally a distribution grid is operated in one of several radial/tree-like topologies that are derived from an original loopy grid graph by opening switches on some lines. Due to limited presence of real-time switch monitoring devices, the operating structure needs to be estimated indirectly. This paper presents a new learning algorithm that uses only nodal voltage measurements to determine the operational radial structure. The algorithm is based on the key result stating that the correct operating structure is the optimal solution of the minimum-weight spanning tree problem over the original loopy graph where weights on all permissible edges/lines (open or closed) is the variance of nodal voltage difference at the edge ends. Compared to existing work, this spanning tree based approach has significantly lower complexity as it does not require information on line parameters. Further, a modified learning algorithm is developed for cases when the input voltage measurements are limited to only a subset of the total grid nodes. Performance of the algorithms (with and without missing data) is demonstrated by experiments on test cases.

math.OC↗

arXiv2016

Estimating Distribution Grid Topologies: A Graphical Learning based Approach

Distribution grids represent the final tier in electric networks consisting of medium and low voltage lines that connect the distribution substations to the end-users. Traditionally, distribution networks have been operated in a radial topology that may be changed from time to time. Due to absence of a significant number of real-time line monitoring devices in the distribution grid, estimation of the topology is a problem critical for its observability and control. This paper develops a novel graphical learning based approach to estimate the radial operational grid structure using voltage measurements collected from the grid loads. The learning algorithm is based on conditional independence tests for continuous variables over chordal graphs and has wide applicability. It is proven that the scheme can be used for several power flow laws (DC or AC approximations) and more importantly is independent of the specific probability distribution controlling individual bus power usage. The complexity of the algorithm is discussed and its performance is demonstrated by simulations on distribution test cases.

math.OC↗