arXiv subjects

Jean Maeght

Publications and source records attributed to Jean Maeght.

11 recordsLinked to original sources

arXiv2022

Subtransmission Grid Control via Online Feedback Optimization

The increasing electric power consumption and the shift towards renewable energy resources demand for new ways to operate transmission and subtransmission grids. Online Feedback Optimization (OFO) is a feedback real-time control method that can be employed to enable optimal operation of these grids. Such controllers can maximize grid efficiency (e.g., minimizing curtailment) while satisfying grid constraints like voltage and current limits. The OFO control method is tailored and extended to handle discrete inputs and it is explained how to design an OFO controller for the subtransmission grid. A novel benchmark is presented and published that corresponds to the real French subtransmission grid on which the proposed controller is analyzed in terms of robustness against model mismatch, constraint satisfaction, and tracking performance. It is shown that OFO controllers can help utilize the grid to its full extent, virtually reinforce it, and operate it optimally and in real-time by using the flexibility offered by renewable generators connected to distribution grids.

eess.SY↗

arXiv2021

Cloud Storage for Multi-Service Battery Operation (Extended Version)

We study a cloud storage operator who provides shared storage service for electricity end-users using the residual part of a multi-service grid-scale battery primarily used for high priority grid services. We design an optimal product offering, pricing and customer portfolio. A framework and solution approach for assessing and operating such multi-service battery operations with stochastic services and different priority levels is an open problem is proposed. The methodology consists in modelling the problem as a two-stage stochastic optimization between high priority stochastic grid services and low priority cloud storage for stochastic end users. We also propose the operational metrics of multiplexing gain and probability of blocking to assess the operation of multi-service multi-user battery. To address the computational challenge of solving the stochastic optimization with a large number of end-users, we propose effective capacity as a convex approximation that allows an analytical solution. We then provide an empirical analysis based on real grid congestion data from RTE France, and a large dataset of end-users' electricity consumption in California. Our empirical analysis shows (i) our proposed effective capacity is a close approximation, (ii) battery operation and profit are sensitive to the cost of external resources, number of end-users, and RTE's leasing price of the battery, and (iii) with only a slight discount of the leasing price, the profit of the third party from a stochastic residual battery can be the same as that of a deterministic one. Cloud storage as a low priority service can profitably exist alongside other high priority battery services, making integration of more storage in the grid economically viable, and allowing larger intermittent renewables, a key path towards reduced carbon emissions.

eess.SP↗

arXiv2021

The Power Grid Library for Benchmarking AC Optimal Power Flow Algorithms

In recent years, the power systems research community has seen an explosion of novel methods for formulating the AC power flow equations. Consequently, benchmarking studies using the seminal AC Optimal Power Flow (AC-OPF) problem have emerged as the primary method for evaluating these emerging methods. However, it is often difficult to directly compare these studies due to subtle differences in the AC-OPF problem formulation as well as the network, generation, and loading data that are used for evaluation. To help address these challenges, this IEEE PES Task Force report proposes a standardized AC-OPF mathematical formulation and the PGLib-OPF networks for benchmarking AC-OPF algorithms. A motivating study demonstrates some limitations of the established network datasets in the context of benchmarking AC-OPF algorithms and a validation study demonstrates the efficacy of using the PGLib-OPF networks for this purpose. In the interest of scientific discourse and future additions, the PGLib-OPF benchmark library is open-access and all the of network data is provided under a creative commons license.

math.OC↗

arXiv2019

Improving Clique Decompositions of Semidefinite Relaxations for Optimal Power Flow Problems

Semidefinite Programming (SDP) provides tight lower bounds for Optimal Power Flow problems. However, solving large-scale SDP problems requires exploiting sparsity. In this paper, we experiment several clique decomposition algorithms that lead to different reformulations and we show that the resolution is highly sensitive to the clique decomposition procedure. Our main contribution is to demonstrate that minimizing the number of additional edges in the chordal extension is not always appropriate to get a good clique decomposition.

math.OC↗

arXiv2019

Novel Approach Towards Global Optimality of Optimal Power Flow Using Quadratic Convex Optimization

Optimal Power Flow (OPF) can be modeled as a non-convex Quadratically Constrained Quadratic Program (QCQP). Our purpose is to solve OPF to global optimality. To this end, we specialize the Mixed-Integer Quadratic Convex Reformulation method (MIQCR) to (OPF). This is a method in two steps. First, a Semi-Definite Programming (SDP) relaxation of (OPF) is solved. Then the optimal dual variables of this relaxation are used to reformulate OPF into an equivalent new quadratic program, where all the non-convexity is moved to one additional constraint. In the second step, this reformulation is solved within a branch-and-bound algorithm, where at each node a quadratic and convex relaxation of the reformulated problem, obtained by relaxing the non-convex added constraint, is solved. The key point of our approach is that the lower bound at the root node of the branch-and-bound tree is equal to the SDP relaxation value. We test this method on several OPF cases, from two-bus networks to more-than-a-thousand-buses networks from the MAT-POWER repository. Our first results are very encouraging.

math.OC↗

arXiv2018

Robust MPC for temperature management on electrical transmission lines

In the current context of high integration of renewable energies, maximizing infrastructures capabilities for electricity transmission is a general need for Transmission System Operators (TSO). The French TSO, RTE, is developing levers to control power flows in real-time: renewable production curtailment is already employed and large battery storage systems are planned to be installed for congestion management in early 2020. The combination of these levers with the use of Dynamic Line Rating (DLR) helps exploiting the lines at the closest of their limit by managing their temperature in real-time. Unnecessary margins can be reduced, avoiding congestion and excessive generation curtailment. In particular, there is a possible interesting correlation between the transits increase due to high wind farms generation and the cooling effect of wind on power lines in the same area. In order to optimize the electrical transmission network capacities, the present paper advocates the use of a temperature management model, mixing production curtailment and large batteries as control variables. A robust Model Predictive Control framework for local control on electrical lines temperature is presented based on the regulation within tubes of trajectories. Simulations on the French electrical network are conducted to show the effectiveness of the optimization-based control design.

math.OC↗

arXiv2018

Congestion management within a multi-service scheduling coordination scheme for large battery storage systems

There is a growing interest in the use of largescale battery storage systems for grid services. This technology has been deployed in several countries to increase transmission systems capabilities and reliability. In particular, large-scale battery storage systems could be used for congestion management and the French Transmission System Operator (RTE) is currently installing 3 large batteries for 2020 at the sub-transmission grid level for this purpose. The battery operation for congestion management does not require the full storage capacities at all times. Thus, the residual capacities can be offered to other services to increase batteries profitability. This paper presents the framework which will be used by RTE for battery operation scheduling to combine congestion management with other services by computing day-ahead bandwidths defining available storage capacities. The bandwidths represent safe domains for grid operation scheduling: as long as the battery operation is performed within these bandwidths, there will be no grid congestion or grid congestions will be managed.

math.OC↗

arXiv2018

Zonal congestion management mixing large battery storage systems and generation curtailment

The French transmission system operator (RTE) needs to face a significant congestion increase in specific zones of the electrical network due to high integration of renewable energies. Network reconfiguration and renewable energy curtailment are currently employed to manage congestion and guarantee the system security and stability. In sensitive zones, however, stronger levers need to be developed. Large battery storage systems are receiving an increasing interest for their potential in congestion management. In this paper, a model for local congestion management mixing batteries and renewable generation curtailment is developed. Subsequently, an energy management approach relying on the principles of Model Predictive Control is presented. Results of simulations on RTE data sets are presented for the analysis of the degrees of freedom and sensitive parameters of the design.

math.OC↗

arXiv2016

Modeling analysis and optimization for European network data merging

In this paper, the problem of building a consistent European network state based on the data provided by different Transmission System Operators (TSOs) is addressed. A hierarchical merging procedure is introduced and consists in the resolution of several Optimal Power Flow problems (OPFs). Results on the European network demonstrate the interest of this procedure on real-life cases and highlight the benefits of using a hierarchical multi-objective approach.

math.OC↗

arXiv2016

AC Power Flow Data in MATPOWER and QCQP Format: iTesla, RTE Snapshots, and PEGASE

In this paper, we publish nine new test cases in MATPOWER format. Four test cases are French very high-voltage grid generated by the offline plateform of iTesla: part of the data was sampled. Four test cases are RTE snapshots of the full French very high-voltage and high-voltage grid that come from French SCADAs via the Convergence software. The ninth and largest test case is a pan-European ficticious data set that stems from the PEGASE project. It complements the four PEGASE test cases that we previously published in MATPOWER version 5.1 in March 2015. We also provide a MATLAB code to transform the data into standard mathematical optimization format. Computational results confirming the validity of the data are presented in this paper.

math.OC↗

arXiv2016

Application of the Moment-SOS Approach to Global Optimization of the OPF Problem

Finding a global solution to the optimal power flow (OPF) problem is difficult due to its nonconvexity. A convex relaxation in the form of semidefinite programming (SDP) has attracted much attention lately as it yields a global solution in several practical cases. However, it does not in all cases, and such cases have been documented in recent publications. This paper presents another SDP method known as the moment-sos (sum of squares) approach, which generates a sequence that converges towards a global solution to the OPF problem at the cost of higher runtime. Our finding is that in the small examples where the previously studied SDP method fails, this approach finds the global solution. The higher cost in runtime is due to an increase in the matrix size of the SDP problem, which can vary from one instance to another. Numerical experiment shows that the size is very often a quadratic function of the number of buses in the network, whereas it is a linear function of the number of buses in the case of the previously studied SDP method.

math.OC↗