SearcharxivSearch

arXiv subjects

Mads Almassalkhi

Publications and source records attributed to Mads Almassalkhi.

At least 19 recordsLinked to original sources

Optimal Kron-based Reduction of Networks (Opti-KRON) for Three-phase Distribution Feeders

This paper presents a novel structure-preserving, Kron-based reduction framework for unbalanced distribution feeders. The method aggregates electrically similar nodes within a mixed-integer optimization (MIP) problem to produce reduced networks that optimally reproduce the voltage profiles of the original full network. To overcome computational bottlenecks of MIP formulations, we propose an exhaustive-search formulation to identify optimal aggregation decisions while enforcing voltage margin limits. The proposed exhaustive network reduction algorithm is parallelizable on GPUs, which enables scalable network reduction. The resulting reduced networks approximate the full system's voltage profiles with low errors and are suitable for steady-state analysis and optimal power flow studies. The framework is validated on two real utility distribution feeders with 5,991 and 8,381 nodes. The reduced models achieve up to 90% and 80% network reduction, respectively, while the maximum voltage-magnitude error remains below 0.003 p.u. Furthermore, on a 1000-node version of the network, the GPU-accelerated reduction algorithm runs up to 15x faster than its CPU-based counterpart.

eess.SY

Structure-preserving Optimal Kron-based Reduction of Radial Distribution Networks

Network reduction simplifies complex electrical networks to address computational challenges of large-scale transmission and distribution grids. Traditional network reduction methods are often based on a predefined set of nodes or lines to remain in the reduced network. This paper builds upon previous work on optimal Kron-based reduction of networks, which was formulated as a mixed-integer linear program, to enhance the framework in three aspects. First, the scalability is improved via a cutting plane restriction, tightened Big M bounds, and a zero-injection node reduction stage. Next, we introduce a radiality-preservation step to identify and recover nodes whose restoration ensures radiality. A linearized voltage magnitude error constraint is incorporated to explicitly bound the difference between full and reduced networks. The model is validated through its application to the 533-bus distribution test system and a 3499-bus utility feeder for a set of representative loading scenarios. In the 533-bus system, an 85% reduction was achieved with a maximum voltage error below 0.0025 per unit, while in the 3499-bus feeder, over 94% reduction was obtained with maximum voltage errors below 0.002 per unit. Additionally, we show that the radialization step accelerates the runtime of optimal voltage control problems when applied to Kron-reduced networks.

eess.SY

Community-Centric Multi-Criteria Assessment Framework for Energy Transition

The transition to low-carbon energy systems demands comprehensive technical, economic, environmental, and social evaluation tools. While numerous studies address specific aspects of energy transition, few provide an integrated framework to capture the full spectrum of impacts. This work developed a community-collaborative assessment framework that integrates intelligent energy devices with optimization-based coordination of energy assets. The proposed framework uses techno-economic, environmental, and social criteria to evaluate transition pathways. A detailed case study is performed for a remote community in Alaska to assess its applicability, where the feasibility of renewable energy transitions remains underexplored. Three distinct pathways, including heat pump and battery integration, resource coordination, and expanded community solar PV, are analyzed using a year-long dataset of demand, renewable energy, and transformer data. The analysis revealed that using heat pumps lowers the overall energy costs by 30% and carbon emissions by 28%. In addition, the share of the population spending more than 10% of their income on energy falls from 74% in the existing scenario to 40% with heat pump adoption, indicating significant affordability improvements. By combining a general, community-centric assessment framework with a data-driven case study, this work offers a practical tool for utilities, community stakeholders, and policymakers to work toward equitable and sustainable energy transitions.

eess.SY

Fairness-aware Dynamic Hosting Capacity and the Impacts of Strategic Solar PV Curtailment

Rapid deployment of distributed energy resources (DERs), such as solar photovoltaics (PV), poses a risk to the distribution grid under high penetration. Therefore, studying hosting capacity (HC) limits considering grid physics and demand variability is crucial. This paper introduces an improved framework for determining the HC of radial distribution networks by enhancing an existing convex inner approximation (CIA) approach. The proposed method achieves a more accurate and larger inner approximation, resulting in better HC limits. We also consider time-varying demand and the design of objective functions to ensure equitable access to grid resources. A case study with solar PV integration is conducted using a modified IEEE-37 radial network to examine the impact of increased PV capacity, demonstrating that with no more than 5% annual solar PV energy curtailed, it is possible to increase solar PV hosting capacity by at least 50% with no negative grid impacts and a net positive economic impact when accounted for the cost of carbon. Results show that fair allocation methods can lead to higher net profits and reduced PV curtailment and CO2.

eess.SY

Large-scale Grid Optimization: The Workhorse of Future Grid Computations

Purpose: The computation methods for modeling, controlling and optimizing the transforming grid are evolving rapidly. We review and systemize knowledge for a special class of computation methods that solve large-scale power grid optimization problems. Summary: Large-scale grid optimizations are pertinent for, amongst other things, hedging against risk due to resource stochasticity, evaluating aggregated DERs' impact on grid operation and design, and improving the overall efficiency of grid operation in terms of cost, reliability, and carbon footprint. We attribute the continual growth in scale and complexity of grid optimizations to a large influx of new spatial and temporal features in both transmission (T) and distribution (D) networks. Therefore, to systemize knowledge in the field, we discuss the recent advancements in T and D systems from the viewpoint of mechanistic physics-based and emerging data-driven methods. Findings: We find that while mechanistic physics-based methods are leading the science in solving large-scale grid optimizations, data-driven techniques, especially physics-constrained ones, are emerging as an alternative to solve otherwise intractable problems. We also find observable gaps in the field and ascertain these gaps from the paper's literature review and by collecting and synthesizing feedback from industry experts.

eess.SY

A New Definition of Demand Response in the Distributed Energy Resource Era

Demand response is a concept that has been around since the very first electric power systems. However, we have seen an explosion of research on demand response and demand-side technologies in the past 30 years, coinciding with the shift towards liberalized/deregulated electricity markets and efforts to decarbonize the power sector. Now we are also seeing a shift towards more distributed/decentralized electric systems; we have entered the era of "distributed energy resources," which require new grid management, operational, and control strategies. Given this paradigm shift, we argue that the concept of demand response needs to be revisited, and more carefully/consistently defined to enable us to better utilize this massive resource for economic, technical, environmental, and societal aims. In this paper, we survey existing demand response definitions, highlight their shortcomings, propose a new definition, and describe how this new definition enables us to more effectively harness the value of demand response in modern power systems. We conclude with a demand response research agenda informed by a discussion of demand response barriers and enablers.

eess.SY

Enhancing Scalability of Optimal Kron-based Reduction of Networks (Opti-KRON) via Decomposition with Community Detection

Electrical networks contain thousands of interconnected nodes and edges, which leads to computational challenges in some power system studies. To address these challenges, we contend that network reductions can serve as a framework to enable scalable computing in power systems. By building upon a prior AC "Opti-KRON" formulation, this paper presents a DC power flow formulation for finding network reductions that are optimal within the context of large transmission analysis. Opti-KRON previously formulated optimal Kron-based network reductions as a mixed integer linear program (MILP), where the number of binary variables scaled with the number of nodes. To improve the scalability of the Opti-KRON approach, we augment the MILP formulation with a community detection (CD) technique that segments a large network into smaller, disjoint, but contiguous sub-graphs (i.e., communities). For each sub-graph, we then (in parallel) apply MILP-based along with a new cutting plane constraint, thus, enhancing scalability. Ultimately, the new DC-based Opti-KRON method can achieve a 80-95\% reduction of networks (in terms of nodes) while statistically outperforming other CD- and Kron-based methods. We present simulation results for the IEEE RTS-96 and the 2383-bus Polish networks.

eess.SY

Towards Energysheds: A Technical Definition and Cooperative Framework for Future Power System Operations

There is growing interest in understanding how interactions between system-wide objectives and local community decision-making will impact the clean energy transition. The concept of energysheds has gained traction in the areas of public policy and social science as a way to study these relationships. However, development of technical definitions of energysheds that permit system analysis are still largely missing. In this work, we propose a mathematical definition for energysheds, and introduce an analytical framework for studying energyshed concepts within the context of future electric power system operations. This framework is used to develop insights into the factors that impact a community's ability to achieve energyshed policy incentives within a larger connected power grid, as well as the tradeoffs associated with different spatial policy requirements. We also propose an optimization-based energyshed policy design problem, and show that it can be solved to global optimality within arbitrary precision by employing concepts from quasi-convex optimization. Finally, we investigate how interconnected energysheds can cooperatively achieve their objectives in bulk power system operations.

eess.SY

Decomposed Phase Analysis using Convex Inner Approximations: a Methodology for DER Hosting Capacity in Distribution Systems

This paper uses convex inner approximations (CIA) of the AC power flow to tackle the optimization problem of quantifying a three-phase distribution feeder's capacity to host distributed energy resources (DERs). This is often connoted hosting capacity (HC), but herein we consider separative bounds for each node on positive and negative DER injections, which ensures that injections within these nodal limits satisfy feeder voltage and current limits and across nodes sum up to the feeder HC. The methodology decomposes a three-phase feeder into separate phases and applies CIA-based techniques to each phase. An analysis is developed to determine the technical condition under which this per-phase approach can still guarantee three-phase constraints. New approaches are then presented that modify the per-phase optimization problems to overcome conservativeness inherent to CIA methods and increase HC, including selectively modifying the per-phase impedances and iteratively relaxing per-phase voltage bounds. Discussion is included on trade-offs and feasibility. To validate the methodology simulation-based analysis is conducted with the IEEE 37-node test feeder and a real 534-node unbalanced radial distribution feeder.

eess.SY

Market mechanism to enable grid-aware dispatch of Aggregators in radial distribution networks

This paper presents a market-based optimization framework wherein Aggregators can compete for nodal capacity across a distribution feeder and guarantee that allocated flexible capacity cannot cause overloads or congestion. This mechanism, thus, allows Aggregators with allocated capacity to pursue a number of services at the whole-sale market level to maximize revenue of flexible resources. Based on Aggregator bids of capacity (MW) and network access price ($/MW), the distribution system operator (DSO) formulates an optimization problem that prioritizes capacity to the different Aggregators across the network while implicitly considering AC network constraints. This grid-aware allocation is obtained by incorporating a convex inner approximation into the optimization framework that prioritizes hosting capacity to different Aggregators. We adapt concepts from transmission-level capacity market clearing, utility demand charges, and Internet-like bandwidth allocation rules to distribution system operations by incorporating nodal voltage and transformer constraints into the optimization framework. Simulation based results on IEEE distribution networks showcase the effectiveness of the approach.

math.OC

Exploring reactive power limits on wind farm collector networks with convex inner approximations

A wind farm can provide reactive power at sub-transmission and transmission buses in order to support and improve voltage profiles. It is common for the reactive power capability of a wind farm to be evaluated as the sum of the individual turbine ratings. However, such an assessment does not take into account losses over the collector network, nor the voltage constraints imposed by the turbines and network. In contrast, the paper presents a method for determining the range of reactive power support that each turbine can provide whilst guaranteeing satisfaction of voltage constraints. This is achieved by constructing convex inner approximations of the non-convex set of admissible reactive power injections. We present theoretical analysis that supports the constraint satisfaction guarantees. An example illustrates the effectiveness of the algorithm and provides a comparison with a fully decentralized approach to controlling wind farm reactive power. Such approaches have the potential to improve the design and operation of wind farm collector networks, reducing the need for additional costly reactive power resources.

math.OC

Optimal Frequency Regulation using Packetized Energy Management

Packetized energy management (PEM) is a demand dispatch scheme that can be used to provide ancillary services such as frequency regulation. In PEM, distributed energy resources (DERs) are granted uninterruptible access to the grid for a pre-specified time interval called the packet length. This results in a down ramp-limited response in PEM for DERs that can only consume power from the grid. In this work, a linearized virtual battery model of PEM is provided that is capable of predicting the down-ramp limited output of PEM and is used in a model predictive control (MPC) framework to improve the performance of PEM in tracking an automatic generation control (AGC) signal. By performing statistical analysis on the AGC regulation signal, PJM Reg-D, an ARMA model is derived as a predictor for the MPC-based precompensator. Finally, as an alternative to MPC, it is shown that by varying the packet length as a function of time, for example through packet randomization, frequency regulation can be improved under PEM.

eess.SY

Grid-aware aggregation and realtime disaggregation of distributed energy resources in radial networks

Dispatching a large fleet of distributed energy resources (DERs) in response to wholesale energy market or regional grid signals requires solving a challenging disaggregation problem when the DERs are located within a distribution network. This manuscript presents a computationally tractable convex inner approximation for the optimal power flow (OPF) problem that characterizes a feeders aggregate DERs hosting capacity and enables a realtime, grid-aware dispatch of DERs for radial distribution networks. The inner approximation is derived by considering convex envelopes on the nonlinear terms in the AC power flow equations. The resulting convex formulation is then used to derive provable nodal injection limits, such that any combination of DER dispatches within their respective nodal limits is guaranteed to be AC admissible. These nodal injection limits are then used to construct a realtime, open-loop control policy for dispatching DERs at each location in the network to collectively deliver grid services. The IEEE-37 distribution network is used to validate the technical results and highlight various use-cases.

math.OC

Guaranteeing a physically realizable battery dispatch without charge-discharge complementarity constraints

The non-convex complementarity constraints present a fundamental computational challenge in energy constrained optimization problems. In this work, we present a new, linear, and robust battery optimization formulation that sidesteps the need for battery complementarity constraints and integers and prove analytically that the formulation guarantees that all energy constraints are satisfied which ensures that the optimized battery dispatch is physically realizable. In addition, we bound the worst-case model mismatch and discuss conservativeness. Simulation results further illustrate the effectiveness of this approach.

math.OC

Real-time Grid and DER Co-simulation Platform for Validating Large-scale DER Control Schemes

Distributed energy resources (DERs) such as responsive loads and energy storage systems are valuable resources available to grid operators for balancing supply-demand mismatches via load coordination. However, consumer acceptance of load coordination schemes depends on ensuring quality of service (QoS), which embodies device-level constraints. Since each device has its own internal energy state, the effect of QoS on the fleet can be cast as fleet-wide energy limits within which the aggregate "state of charge" (SoC) must be actively maintained. This requires coordination of DERs that is cognizant of the SoC, responsive to grid conditions, and depends on fast communication networks. To that effect, this paper presents a novel real-time grid-and-DER co-simulation platform for validating advanced DER coordination schemes and characterizing the capability of such a DER fleet. In particular, we present how the co-simulation platform is suitable for: i) testing real-time performance of a large fleet of DERs in delivering advanced grid services, including frequency regulation; ii) online state estimation to characterize the corresponding SoC of a large fleet of DERs; and iii) incorporating practical limitations of DERs and communications and analyzing the effects on fleet-wide performance. To illustrate these benefits of the presented grid-DER co-simulation platform, we employ the advanced DER coordination scheme called packetized energy management (PEM), which is a novel device-driven, asynchronous, and randomizing control paradigm for DERs. A fleet of thousands of PEM-enabled DERs are then added to a realistic and dynamical model of the Vermont transmission system to complete validation of the co-simulation platform.

eess.SY

A Methodology for Quantifying Flexibility in a fleet of Diverse DERs

This paper addresses the question: how many distributed energy resources (DERs) are needed to provide $\pm1$MW of flexibility over a number of hours? For this purpose, a metric based on an ISO's own performance score is proposed. Then, a systematic procedure is presented and validated that makes use of either a simulator or the solution to an optimization problem based on a nominal analytical formulation to get flexibility in terms of kW-per-device. Furthermore, simulation-based analysis indicates that flexibility from different DER fleets adds linearly, that is, the total flexibility provided by a mixture of different DER types can be obtained as a convex combination of their individual kW-per-device flexibility. The proposed methodology is validated on ($i$) a centralized coordinator and ($ii$) a device driven DER coordination scheme called packetized energy management (PEM). Furthermore, the effect of heterogeneity as well as PEM specific parameters such as packet length and mean time-to-request on flexibility is also quantified.

eess.SY

Voltage positioning using co-optimization of controllable grid assets in radial networks

With increasing penetration of solar PV, some distribution feeders are experiencing highly variable net-load flows and even reverse flows. To optimize distribution systems under such conditions, the scheduling of mechanical devices, such as OLTCs and capacitor banks, needs to take into account forecasted solar PV and actual grid conditions. However, these legacy switching assets are operated on a daily or hourly timescale, due to the wear and tear associated with mechanical switching, which makes them unsuitable for real-time control. Therefore, there is a natural timescale-separation between these slower mechanical assets and the responsive nature of inverter-based resources. In this paper, we present a network admissible convex formulation for holistically scheduling controllable grid assets to position voltage optimally against solarPV. An optimal hourly schedule is presented that utilizes mechanical resources to position the predicted voltages close to nominal values, while minimizing the use of inverter-based resources (i.e., DERs),making them available for control at a faster time-scale (after the uncertainty reveals itself). A convex, inner approximation of the OPF problem is adapted to a mixed-integer linear program that minimizes voltage deviations from nominal (i.e., maximizes voltage margins). The resulting OPF solution respects all the network constraints and is, hence, robust against modeling simplifications. Simulation based analysis on IEEE distribution feeders validates the approach.

math.OC

Optimal and resilient coordination of virtual batteries in distribution feeders

This paper presents a novel hierarchical framework for real-time, network-admissible coordination of responsive grid resources aggregated into virtual batteries (VBs). In this context, a VB represents a local aggregation of directly controlled loads, such as smart inverters, electric water heaters, and air-conditioners. The coordination is achieved by solving an optimization problem to disaggregate a feeder's desired reference trajectory into constraint-aware set-points for the VBs. Specifically, a novel, provably-tight, convex relaxation of the AC optimal power flow (OPF) problem is presented to optimally dispatch the VBs to track the feeder's desired power trajectory. In addition to the optimal VB dispatch scheme, a real-time, corrective control scheme is designed, which is based on optimal proportional-integral (PI) control with anti-windup, to reject intra-feeder and inter-feeder disturbances that arise during operation of the power system. Simulation results conducted on a modified IEEE test system demonstrate the effectiveness of the proposed multi-layer VB coordination framework.

eess.SY