arXiv subjects

Gabriela Hug

Publications and source records attributed to Gabriela Hug.

At least 91 records · Page 5Linked to original sources

arXiv2020

Consumer Privacy Protection using Flexible Thermal Loads: Theoretical Limits and Practical Considerations

The increasing adoption of smart meters introduces growing concerns about consumer privacy risks stemming from high resolution metering data. To counter these risks, there have been various works in actively shaping the grid-visible energy consumption profile using controllable loads such as energy storage systems (ESSs) and flexible consumer loads. In this paper, we compare the use of flexible thermal-based consumer loads (FTLs) against ESSs for consumer privacy protection. By first assuming ideal conditions, and subsequently bringing them closer to reality, the limitations of using FTLs for privacy protection are identified. Through theoretical analyses and realistic simulations, it is shown that, due to the limitations in the operation of FTLs, without significant over-sizing of systems and sacrifices in consumer comfort, FTLs of much higher equivalent energy storage capacity are required to afford the same level of protection as ESSs. Nonetheless, given their increasing ubiquity, controllable FTLs should be considered for use in consumer privacy protection.

eess.SY↗

arXiv2020

Aggregating Privacy-Conscious Distributed Energy Resources for Grid Service Provision

The increasing adoption of advanced metering infrastructure has led to growing concerns regarding privacy risks stemming from the high resolution measurements. This has given rise to privacy protection techniques that physically alter the consumer's energy load profile, masking private information by using localised devices, e.g. batteries or flexible loads. Meanwhile, there has also been increasing interest in aggregating the distributed energy resources (DERs) of residential consumers to provide services to the grid. In this paper, we propose an online distributed algorithm to aggregate the DERs of privacy-conscious consumers to provide services to the grid, whilst preserving their privacy. Results show that the optimisation solution from the distributed method converges to one close to the optimum computed using an ideal centralised solution method, balancing between grid service provision, consumer preferences and privacy protection. More importantly, the distributed method preserves consumer privacy, and does not require high-bandwidth two-way communications infrastructure.

eess.SY↗

arXiv2020

Iterative Decomposition of Joint Chance Constraints in OPF

In chance-constrained OPF models, joint chance constraints (JCCs) offer a stronger guarantee on security compared to single chance constraints (SCCs). Using Boole's inequality or its improved versions to decompose JCCs into SCCs is popular, yet the conservativeness introduced is still significant. In this letter, a non-parametric iterative framework is proposed to achieve the decomposition of JCCs with negligible conservativeness. An adaptive risk allocation strategy is also proposed and embedded in the framework. Results on an IEEE test case show that the conservativeness using the framework is nearly eliminated, thereby reducing the generation cost considerably.

eess.SY↗

arXiv2020

Timescale Separation in Autonomous Optimization

Autonomous optimization refers to the design of feedback controllers that steer a physical system to a steady state that solves a predefined, possibly constrained, optimization problem. As such, no exogenous control inputs such as setpoints or trajectories are required. Instead, these controllers are modeled after optimization algorithms that take the form of dynamical systems. The interconnection of this type of optimization dynamics with a physical system is however not guaranteed to be stable unless both dynamics act on sufficiently different timescales. In this paper, we quantify the required timescale separation and give prescriptions that can be directly used in the design of this type of feedback controllers. Using ideas from singular perturbation analysis, we derive stability bounds for different feedback laws that are based on common continuous-time optimization schemes. In particular, we consider gradient descent and its variations, including projected gradient, and Newton gradient. We further give stability bounds for momentum methods and saddle-point flows. Finally, we discuss how optimization algorithms like subgradient and accelerated gradient descent, while well-behaved in offline settings, are unsuitable for autonomous optimization due to their general lack of robustness.

math.OC↗

arXiv2020

Convex Relaxations of Chance Constrained AC Optimal Power Flow

High penetration of renewable energy sources and the increasing share of stochastic loads require the explicit representation of uncertainty in tools such as the optimal power flow (OPF). Current approaches follow either a linearized approach or an iterative approximation of non-linearities. This paper proposes a semidefinite relaxation of a chance constrained AC-OPF which is able to provide guarantees for global optimality. Using a piecewise affine policy, we can ensure tractability, accurately model large power deviations, and determine suitable corrective control policies for active power, reactive power, and voltage. We state a tractable formulation for two types of uncertainty sets. Using a scenario-based approach and making no prior assumptions about the probability distribution of the forecast errors, we obtain a robust formulation for a rectangular uncertainty set. Alternatively, assuming a Gaussian distribution of the forecast errors, we propose an analytical reformulation of the chance constraints suitable for semidefinite programming. We demonstrate the performance of our approach on the IEEE 24 and 118 bus system using realistic day-ahead forecast data and obtain tight near-global optimality guarantees.

eess.SY↗

arXiv2020

A Reinforcement Learning Approach for Fast Frequency Control in Low-Inertia Power Systems

The electric grid is undergoing a major transition from fossil fuel-based power generation to renewable energy sources, typically interfaced to the grid via power electronics. The future power systems are thus expected to face increased control complexity and challenges pertaining to frequency stability due to lower levels of inertia and damping. As a result, the frequency control and development of novel ancillary services is becoming imperative. This paper proposes a data-driven control scheme, based on Reinforcement Learning (RL), for grid-forming Voltage Source Converters (VSCs), with the goal of exploiting their fast response capabilities to provide fast frequency control to the system. A centralized RL-based controller collects generator frequencies and adjusts the VSC power output, in response to a disturbance, to prevent frequency threshold violations. The proposed control scheme is analyzed and its performance evaluated through detailed time-domain simulations of the IEEE 14-bus test system.

eess.SY↗

arXiv2020

A Stochastic-Robust Approach for Resilient Microgrid Investment Planning Under Static and Transient Islanding Security Constraints

When planning the investment in Microgrids (MGs), usually static security constraints are included to ensure their resilience and ability to operate in islanded mode. However, unscheduled islanding events may trigger cascading disconnections of Distributed Energy Resources (DERs) inside the MG due to the transient response, leading to a partial or full loss of load. In this paper, a min-max-min, hybrid, stochastic-robust investment planning model is proposed to obtain a resilient MG considering both High-Impact-Low-Frequency (HILF) and Low-Impact-High-Frequency (LIHF) uncertainties. The HILF uncertainty pertains to the unscheduled islanding of the MG after a disastrous event, and the LIHF uncertainty relates to correlated loads and DER generation, characterized by a set of scenarios. The MG resilience under both types of uncertainty is ensured by incorporating static and transient islanding constraints into the proposed investment model. The inclusion of transient response constraints leads to a min-max-min problem with a non-linear dynamic frequency response model that cannot be solved directly by available optimization tools. Thus, in this paper, a three-stage solution approach is proposed to find the optimal investment plan. The performance of the proposed algorithm is tested on the CIGRE 18-node distribution network.

math.OC↗

arXiv2020

Active Distribution Grids Providing Voltage Support: The Swiss Case

The increasing installation of controllable Distributed Energy Resources (DERs) in Distribution Networks (DNs) opens up new opportunities for the provision of ancillary services to the Transmission Network (TN) level. As the penetration of smart meter devices and communication infrastructure in DNs increases, they become more observable and controllable with centralized optimization-based control schemes becoming efficient and practical. In this paper, we propose a centralized tractable Optimal Power Flow (OPF)-based control scheme that optimizes the real-time operation of active DNs, while also considering the provision of voltage support as an ancillary service to the TN. We embed in the form of various constraints the current voltage support requirements of Switzerland and investigate the potential benefit of ancillary services provision assuming different operational modes of the DER inverters. We demonstrate the performance of the proposed scheme using a combined HV-MV-LV test system.

math.OC↗

arXiv2020

Modelling of Variable-Speed Refrigeration for Fast-Frequency Control in Low-InertiaSystems

In modern power systems, shiftable loads contribute to the flexibility needed to increase robustness and ensure security. Thermal loads are among the most promising candidates for providing such service due to the large thermal storage time constants. This paper demonstrates the use of Variable-Speed Refrigeration (VSR) technology, based on brushless DC motors, for fast-frequency response. First, we derive a detailed dynamic model of a single-phase VSR unit suitable for time-domain and small-signal stability analysis in low-inertia systems. For analysing dynamic interactions with the grid, we consider the aggregated response of multiple devices. However, the high computational cost involved in analysing large-scale systems leads to the need for reduced-order models. Thus, a set of reduced-order models is derived though transfer function fitting of data obtained from time-domain simulations of the detailed model. The modelling requirements and the accuracy versus computational complexity trade-off are discussed. Finally, the time-domain performance and frequency-domain analyses reveal substantial equivalence between the full- and suitable reduced-order models, allowing the application of simplified models in large-scale system studies.

eess.SY↗

arXiv2020

Improving Dynamic Performance of Low-Inertia Systems through Eigensensitivity Optimization

An increasing penetration of renewable generation has led to reduced levels of rotational inertia and damping in the system. The consequences are higher vulnerability to disturbances and deterioration of the dynamic response of the system. To overcome these challenges, novel converter control schemes that provide virtual inertia and damping have been introduced, which raises the question of optimal distribution of such devices throughout the network. This paper presents a framework for performance-based allocation of virtual inertia and damping to the converter-interfaced generators in a low-inertia system. This is achieved through an iterative, eigensensitivity-based optimization algorithm that determines the optimal controller gains. Two conceptually different problem formulations are presented and validated on a 3-area, 12-bus test system.

math.OC↗

arXiv2020

Towards Optimal System Scheduling with Synthetic Inertia Provision from Wind Turbines

The undergoing transition from conventional to converter-interfaced renewable generation leads to significant challenges in maintaining frequency stability due to declining system inertia. In this paper, a novel control framework for Synthetic Inertia (SI) provision from Wind Turbines (WTs) is proposed, which eliminates the secondary frequency dip and allows the dynamics of SI from WTs to be analytically integrated into the system frequency dynamics. Furthermore, analytical system frequency constraints with SI provision from WTs are developed and incorporated into a stochastic system scheduling model, which enables the provision of SI from WTs to be dynamically optimized on a system level. Several case studies are carried out on a Great Britain 2030 power system with different penetration levels of wind generation and inclusion of frequency response requirements in order to assess the performance of the proposed model and analyze the influence of the improved SI control scheme on the potential secondary frequency dip. The results demonstrate that the inclusion of SI provision from WTs into UC can drastically impact the overall system costs.

eess.SY↗

arXiv2020

Dynamic Reserve and Transmission Capacity Allocation in Wind-Dominated Power Systems

The large shares of wind power generation in electricity markets motivate higher levels of operating reserves. However, current reserve sizing practices fail to account for important topological aspects that might hinder their deployment, thus resulting in high operating costs. Zonal reserve procurement mitigates such inefficiencies, however, the way the zones are defined is still open to interpretation. This paper challenges the efficiency of predetermined zonal setups that neglect the location of stochastic power production in the system, as well as the availability, cost and accessibility of flexible generating units. To this end, we propose a novel reserve procurement approach, formulated as a two-stage stochastic bilevel model, in which the upper level identifies a number of contiguous reserve zones using dynamic grid partitioning and sets zonal requirements based on the total expected operating costs. Using two standard IEEE reliability test cases, we show how the efficient partitioning of reserve zones can reduce expected system cost and promote the integration of stochastic renewables.

eess.SY↗

arXiv2020

Privacy-preserving Distributed Probabilistic Load Flow

Probabilistic load flow (PLF) allows to evaluate uncertainties introduced by renewable energy sources on system operation. Ideally, the PLF calculation is implemented for an entire grid requiring all the parameters of the transmission lines and node load/generation to be available. However, in a multi-regional interconnected grid, the independent system operators (ISOs) across regions may not share the parameters of their respective areas with other ISOs. Consequently, the challenge is how to identify the functional relationship between the flows in the regional grid and the uncertain power injections of renewable generation sources across regions without full information about the entire grid. To overcome this challenge, we first propose a privacy-preserving distributed accelerated projection-based consensus algorithm for each ISO to calculate the corresponding coefficient matrix of the desired functional relationship. Then, we leverage a privacy-preserving accelerated average consensus algorithm to allow each ISO to obtain the corresponding constant vector of the same relationship. Using the two algorithms, we finally derive a privacy-preserving distributed PLF method for each ISO to analytically obtain its regional joint PLF in a fully distributed manner without revealing its parameters to other ISOs. The correctness, effectiveness, and efficiency of the proposed method are verified through a case study on the IEEE 118-bus system.

eess.SY↗

arXiv2020

MPC-Based Fast Frequency Control of Voltage Source Converters in Low-Inertia Power Systems

A rapid deployment of renewable generation has led to significant reduction in the rotational system inertia and damping, thus making frequency control in power systems more challenging. This paper proposes a novel control scheme based on Model Predictive Control (MPC) for converter-interfaced generators operating in a grid-forming mode, with the goal of exploiting their fast response capabilities to provide fast frequency control service to the system. The controller manipulates converter power injections to limit the frequency nadir and rate-of-change-of-frequency after a disturbance. Both centralized and decentralized MPC approaches are considered and compared in terms of performance and practical implementation. Special attention is given to the decentralized controller by generating an explicit MPC solution to enhance computational efficiency and reduce hardware requirements. Simulation results obtained from a high-fidelity differential-algebraic equation model of the IEEE 39-bus system demonstrate the effectiveness of the proposed control schemes.

eess.SY↗

arXiv2020

Privacy-Preserving Distributed Clustering for Electrical Load Profiling

Electrical load profiling supports retailers and distribution network operators in having a better understanding of the consumption behavior of consumers. However, traditional clustering methods for load profiling are centralized and require access to all the smart meter data, thus causing privacy issues for consumers and retailers. To tackle this issue, we propose a privacy-preserving distributed clustering framework for load profiling by developing a privacy-preserving accelerated average consensus (PP-AAC) algorithm with proven convergence. Using the proposed framework, we modify several commonly used clustering methods, including k-means, fuzzy C-means, and Gaussian mixture model, to provide privacy-preserving distributed clustering methods. In this way, load profiling can be performed only by local calculations and information sharing between neighboring data owners without sacrificing privacy. Meanwhile, compared to traditional centralized clustering methods, the computational time consumed by each data owner is significantly reduced. The privacy and complexity of the proposed privacy-preserving distributed clustering framework are analyzed. The correctness, efficiency, effectiveness, and privacy-preserving feature of the proposed framework and the proposed PP-AAC algorithm are verified using a real-world Irish residential dataset.

eess.SY↗

arXiv2020

Linear State Estimation and Bad Data Detection for Power Systems with RTU and PMU Measurements

In this paper, a novel linear algorithm is proposed for state estimation including bad data detection of power systems that are monitored both by conventional and synchrophasor measurements. Both types of data are treated simultaneously and the states are estimated in rectangular coordinates. The proposed estimator is based on the linear weighted least square method. To enable the derivation of linear measurement functions, the network is modelled in terms of voltages and currents in rectangular form and pseudo-measurements are used to represent conventional measurements. Furthermore, the largest normalized residual test is used to detect bad data. To validate the accuracy and robustness of the proposed algorithm, several test cases of different sizes are solved and the results are presented and discussed.

eess.SY↗

arXiv2019

Enabling inter-area reserve exchange through stable benefit allocation mechanisms

The establishment of a single European day-ahead market has accomplished the integration of the regional day-ahead markets. However, the reserves provision and activation remain an exclusive responsibility of regional operators. This limited spatial coordination and the sequential market structure hinder the efficient utilization of flexible generation and transmission, since their capacities have to be ex-ante allocated between energy and reserves. To promote reserve exchange, recent work has proposed a preemptive model that defines the optimal inter-area transmission capacities for energy and reserves reducing the expected system cost. This decision-support tool, formulated as a stochastic bilevel program, respects the current architecture but does not suggest area-specific costs that guarantee sufficient incentives for all areas to accept the proposed solution. To this end, we formulate a preemptive model in a framework that allows the application of coalitional game theory methods to obtain a stable benefit allocation, i.e., an outcome immune to coalitional deviations ensuring willingness of all areas to coordinate. We show that benefit allocation mechanisms can be formulated either at the day-ahead or the real-time stages, in order to distribute the expected or the scenario-specific benefits, respectively. For both games, the proposed benefits achieve minimal stability violation, while allowing for a tractable computation with limited queries to the bilevel program. Our case studies, based on an illustrative and a more realistic test case, compare our method with well-studied benefit allocations, namely, the Shapley value and the nucleolus. We show that our method performs better in stability, tractability, and fairness, which would potentially be dictated by a criterion chosen by the regulator.

math.OC↗

arXiv2019

Data-driven Adaptive Benders Decomposition for the Stochastic Unit Commitment Problem

This paper proposes a data-driven version of the Benders decomposition algorithm applied to the stochastic unit commitment (SUC) problem. The proposed methodology aims at finding a trade-off between the size of the Benders master problem and the number of iterations until convergence. Using clustering techniques, we exploit the information contained in the Lagrange multipliers of the Benders subproblems in order to aggregate the optimality cuts, without compromising the critical information that is passed to the master problem. In addition, we develop an outer parallelization scheme that finds the optimal solution of the SUC problem by solving a series of less computationally intensive SUC instances for certain partitions of the scenario set. Our computational results on the IEEE 3-Area RTS-96 power system, illustrate the improved performance of our data-driven Benders algorithm, in terms of solution time and problem size, compared both to the SUC extensive formulation and to the prevailing single- and multi-cut Benders formulations.

math.OC↗