Improved method for multi-level control by strips of an electrical network; Associated computer program.

Abstract

Improved method for multi-level control by strips of an electrical network; Associated computer program. Method (200) for controlling a network aggregating sub-networks, by means of peripheral agents (10i) and a central agent (12), a peripheral agent locally controlling a sub-network, and the central agent globally controlling the network, comprising the steps of: each peripheral agent carries out a local optimization (201), by distinguishing internal variables xi and external variables zi and transmits (215): the local optimal values ​​of the external variables , of lower and upper limits of the external variables and , as well as a value of a local cost function on the local optimal values ​​of the internal variables , of the lower and upper limits of the internal variables and ;the central agent performs a global optimization (220) on all the external variables zi by distributing the contribution of each sub-network taking into account, for each sub-network, a deviation from the local cost function evaluated from the information transmitted by the corresponding peripheral agent and transmits (225) the global optimal values ​​of the external variables; and each peripheral agent performs a local optimization (230) on the internal variables xi under the constraint of the global optimal values ​​of the external variables. Figure for the abstract: Figure 3;

Description

Title of the invention: Improved method for multi-level control by strips of an electrical network; Associated computer program.

[0001] The present invention relates to the field of optimal control and, more particularly, to methods for optimally controlling an electrical network aggregating a plurality of electrical sub-networks distributed over a territory.

[0002] Such a method is implemented in an infrastructure which comprises an electrical network and a system for controlling this electrical network. The electrical network aggregates a plurality of electrical sub-networks. The sub-networks are connected to a common distribution network.

[0003] Electrical sub-networks can be of different natures, such as electricity production sub-systems (photovoltaic panels - PV, wind turbines, thermal groups, etc.), as electricity consumption sub-systems (industrial buildings, offices, residential houses), or even sub-systems combining production and consumption.

[0004] Subnetworks are subject to different constraints from each other, such as the need to ensure a certain production load, the need to respect a series of user preferences, etc.

[0005] Electrical sub-networks can also be complex themselves, in turn aggregating several electrical components. A sub-network can, for example, be a micro-network made up of several components (battery storage, PV roofs and shades, electric vehicle charging stations, diesel generators, etc.).

[0006] The control system comprises a plurality of peripheral agents and a central agent, connected to each other via a communication network. While each peripheral agent locally controls an associated electrical sub-network, the central agent controls the network globally.

[0007] To this end, each peripheral agent determines a local control strategy enabling it to meet an internal objective of the associated subsystem, while the central agent determines a global control strategy enabling it to meet a global objective of the network, while ensuring coordination of all the subsystems.

[0008] However, electrical subsystems have specific internal objectives, such as minimizing economic costs, maximizing user comfort, minimizing greenhouse gas emissions, etc.

[0009] These internal objectives may diverge from the overall objective that one desires. optimize at the network level as a whole, such as minimizing consumption peaks, minimizing CO2 emissions, maximizing flexibility, managing congestion, etc.

[0010] Methods for controlling such infrastructures are known based on the “alternating direction method of multipliers” - ADMM (altemating direction method of multipliers) and its variants. This is for example what is presented in the article Boyd, S., Parikh, N., Chu, E., Peleato, B., & Eckstein, J. (2011) “Distributed optimization and statistical learning via the alternating direction method of multipliers”, Foundations and Trend in Machine learning, 3(1), 1-122, May 23, 2011, DOE10.1561 / 2200000016, and the article by Nguyen, TL, Tran, QT, Caire, R., & Gavriluta, C., “Agent based distributed optimal power flow using ADMM method”, August 2018, CIRED 2018 conference.

[0011] The ADMM method makes it possible to distribute calculations between peripheral actors, distant and the central actor, at the heart of the network.

[0012] The main disadvantage of this type of prior art method is that it requires numerous iterations to reach a solution that is both feasible and globally optimal.

[0013] All these iterations involve numerous exchanges between the peripheral actors and the central actor through the communication network.

[0014] This process is therefore very sensitive to the quality of the connection and to latency problems which may occur on this same network and disrupt communications.

[0015] Another method of the state of the art is based on the so-called "bands" method. It is for example presented in the article K. Utkarsh, F. Ding, C. Zhao, H. Padullaparti and X. Jin, "A Model-Predictive Hierarchical-Control Framework for Aggregating Residential DERs to Provide Grid Regulation Services," 2020 IEEE Power & Energy Society Innovative Smart Grid Technologies Conference (ISGT), Washington, DC, USA, 2020, pp. 1-5, doi: 10.1109 / ISGT45199.2020.9087773.

[0016] This process does not require iteration. It is therefore much less sensitive to communication problems between actors.

[0017] An embodiment of this method will now be presented in more detail with reference to [Fig.l].

[0018] The piloting method 100 comprises three successive steps.

[0019] In a first step 110, each peripheral agent 10; (i integer between 1 and n, the number of peripheral agents) determines its optimal internal piloting strategy, its optimal external piloting strategy, and optimal overall flexibility margins.

[0020] For example, if we consider a sub-network composed of a battery, a building, and a PV roof, the internal control strategy is the detail of the operating points of each of the components of the sub-network (battery, building, PV roof) at the desired time step (minutes by minutes, hours by hours, etc.).

[0021] The external control strategy is the control strategy at the point of connection of the sub-network to the common distribution network, on the same time step.

[0022] The flexibility margins of each of the components are aggregated over each time step to determine overall flexibility margins at the connection point.

[0023] This information results from the resolution by the peripheral agent 10; of a local optimization problem as described below. This local optimization problem is made up of two sets of variables, x; and z; defined in the following manner:

[0024] - x; represents the internal variables of the ith sub-network, such as for example the battery charge / discharge power over each time step, PV production power over each time step, building consumption power, etc.

[0025] - Z; represents the external variables for the ith sub-network, such as for example the power injected or power withdrawn at the point of connection to the distribution network, for each time step.

[0026] This distinction between internal and external variables makes it possible to separate private information, which is processed locally, from public information, which is shared with the outside world, in this case the central actor playing the role of network coordinator.

[0027] The optimization algorithm used in the state of the art at the local level makes it possible to calculate both the optimal operating point, i.e. the optimal value of each internal variable and each external value, as well as lower and upper limits for each external variable of the micro-network, the interval between the lower and upper limits defining the flexibility margin on the corresponding external variable.

[0028] The variables x; and z; are therefore divided into three groups:

[0029] - first group:

[0030] xl: the internal control variables of each component of the sub-network i, corresponding to an internal operating trajectory calculated locally (hence the index “1”);

[0031] zj: the external control variables of sub-network i, corresponding to an external operating trajectory calculated locally (hence the index “1”);

[0032] - second group:

[0033] xy; the lower limits of control of each component of the sub-network i, corresponding to a trajectory of lower internal flexibility, calculated locally;

[0034] zf: the lower control limits of sub-network i, corresponding to a lower external flexibility trajectory, calculated locally;

[0035] - third group:

[0036] xf: the upper limits of control of each component of the sub-network i, corresponding to a trajectory of higher internal flexibility, calculated locally;

[0037] zf: the upper limits of control of sub-network i, corresponding to a trajectory of higher external flexibility, calculated locally.

[0038] Furthermore, the trajectories must respect a certain number of constraints, in particular physical ones. For example, it is impossible to store more energy in a battery than its capacity, to exceed a predefined charging power or discharging power, to not respect power balance equations, etc.

[0039] All these constraints are described, in matrix form, as follows:

[0040] Apq -i- B;z, = c,

[0041] A,xf + B,zf = Cj

[0042] AjXV+BjZ^Ci

[0043] This constraint matrix makes it possible to filter the solutions achievable by the sub-network (or trajectories), which respect the constraints, from the non-feasible solutions, which do not respect the constraints.

[0044] Finally, to select the optimal trajectory from among all possible trajectories, it is appropriate to define a cost function. For example, and without loss of generality, the following cost function is minimized:

[0045] fx (Xj) + fz () + aflex(zè - z^)

[0046] where fx is a partial cost function taking into account only internal variables, fz is a partial cost function taking into account only external variables, and ariex is a predefined coefficient.

[0047] The cost function described here makes it possible to optimize the trajectory and, at the same time, to determine upward and downward flexibility trajectories by seeking to maximize the gap between the upper and lower trajectories.

[0048] The local optimization problem that each peripheral agent 10; of a subnetwork must solve can therefore be summarized as follows: / x ' x^1 * X^* \ ( f / L' ' L = argmin 1 x(x;) + fz(¾) + an«(zf ~ zD ViA'4Zi / xt,Zi s. t AjXj + B,z( = c, Ajxf 4- Bjzf = q AjX'' 4- BjZj7 = q

[0049] where the result of the optimization gives a set of operating points, that is to say of particular values ​​for the variables and limits. These optimal values ​​bear a “*”.

[0050] The method 100 continues with a step 120, carried out by the central agent 12, following the reception, via a communication network, of the values ​​of the external variables of each of the subnetworks i:

[0051] (z^ zf, zf)

[0052] The central agent 12, by solving a global optimization problem (hence the index “g”), determines new external operating trajectories determined globally for each of the sub-networks:

[0053] (zf zf, ...,zr)

[0054] These trajectories must be able to be carried out by all the sub-networks, that is to say they must remain within the communicated operating margins:

[0055] z^* < z^' < zf*

[0056] It is also possible that the aggregation of the local external operating trajectories of the different sub-networks must respect another set of constraints.

[0057] This is the case, for example, when the central agent seeks to position the infrastructure on flexibility markets by participating, for example, in frequency reserve services to balance an electrical network, or to respond to network congestion issues.

[0058] These other constraints can be written:

[0059] £.DlZi = h

[0060] Or, more synthetically:

[0061] Dz = h

[0062] Since the global objective of the central agent is different from the local objectives of each of the peripheral agents, the cost function associated with the global optimization problem is different. We note it:

[0063] g'(z)

[0064] Step 120 therefore corresponds to the resolution of the following optimization problem: (zf,..., z»', ..., z®*) = argmin g'(z) Z s. t Dz = h zC < Z; < zf*

[0065] After having determined new operating points for each of the sub-networks i, the central agent 12 communicates the new strategies zf to each of them.

[0066] Then, in a step 130, each of the peripheral agents 10; receives, via the communication network, the globally optimized operating point for its external variables: zf*.

[0067] The objective here is then to optimize the internal control strategy of each of the components of the micro-network i while respecting the overall trajectory as new constraint imposed by the central agent.

[0068] Thus the set of constraints is no longer as in step 110:

[0069] A^ + = Cj

[0070] But becomes:

[0071] Aixi = ci-Bizf

[0072] The global trajectory z$* is now imposed. It is therefore no longer a variable on which the local agent can have an influence.

[0073] The cost function is also simplified, since it is now a question of minimizing only the contribution of the internal variables:

[0074] minf^Xj)

[0075] Step 130 therefore corresponds to the resolution of the following second local optimization problem: X”' = argmin fx(Xj) Xi s. t AjXj = Cj - 13^

[0076] The main disadvantage of this process is the absence of optimal overall management with knowledge of the internal costs that this may represent.

[0077] During step 120, the central agent decides on a global trajectory and distributes it so as to move away from the local optimal trajectory in an identical manner for all sub-networks.

[0078] However, for two different subnetworks, moving away from the local optimal trajectory does not have the same cost. For a first site this may represent a slight degradation of its internal operating cost while for a second site this may represent a very large degradation of its internal operating cost.

[0079] The aim of the invention is then to propose an improved method of multi-level control by strips making it possible to respond to this problem.

[0080] To this end, the subject of the invention is a method, implemented by computer, for multi-level control by strips of an infrastructure comprising an electrical network and a control system of the electrical network, the electrical network aggregating a plurality of electrical sub-networks, the electrical sub-networks being connected to a common distribution network, and the control system comprising a plurality of peripheral agents and a central agent, the central agent being connected to the peripheral agents by a communication network, each peripheral agent being associated with a single electrical sub-network to locally control an operation of the associated electrical sub-network, and the central agent globally controlling an operation of the electrical network, the method comprising the steps of: determining, by each peripheral agent, a first control strategy by carrying out a first operation local timing, by implementing an ith local cost function, on a set of control variables of the ith electrical sub-network, said set of variables comprising, on the one hand, internal variables xi5 associated with components of the ith electrical sub-network, and, on the other hand, external variables z; associated with the connection point of the ith electrical sub-network to the distribution network; transmission, to the central agent, of a first plurality of information comprising, for each electrical sub-network: the local optimal values ​​of the external variables z|*; the local optimal values ​​of lower bounds of the external variables zy*; and the optimal values ​​of upper bounds of the external variables of the sub-network; determining mination, by the central agent, of a global steering strategy by carrying out a global optimization on all the external variables z; of the different electrical sub-networks; transmission, by the central agent, of a second plurality of information comprising, for each electrical sub-network, the global optimal values ​​of the external variables z?*; and, determination, by each peripheral agent, of a second

[0081]

[0082] steering strategy by carrying out a second local optimization under constraint of the global optimal values ​​of the external variables on the local variables x;, the method being characterized in that the first plurality of information further comprises additional information, the additional information comprising, for each electrical sub-network: a value of the ith local cost function on the local optimal values ​​of the internal variables xpJ; a value of the ith local cost function on the local optimal values ​​of the lower bounds of the internal variables f^(xV*);ct a value of the ith local cost function on the local optimal values ​​of the upper bounds of the internal variables xa*), and in that the determination, by the central agent, of a globally optimized steering strategy takes into account the additional information to distribute the contribution of each sub-network to the globally optimized steering strategy by taking into account, for each sub-network, a deviation of an ith approximate cost on the first locally optimized steering strategy between the local optimal values ​​of the external variables and the global optimal values ​​of the external variables, the ith approximate cost deriving from the additional information transmitted by the ith peripheral agent. ; According to other advantageous aspects of the invention, the method comprises one or more of the following characteristics, taken individually or in all technically possible combinations: - the ith cost approximation is a piecewise linear function with a lower segment connecting the point with coordinates zy* and xy* ) and the point with coordinates z!* and xl* ) and an upper segment connecting the point with coordinates zî* fj, ( x]*) ct 'c P°int of coordinates z^* and ( xa* j.

[0083] - the global optimization is written: (zf',..., .....z®') = argmin g(zs) zi

[0084] the global optimization being done while respecting a set of global constraints including the constraint:

[0085] zV* < Zj < z^with 8 a global cost function reflecting the global objective.

[0086] - the global cost function g includes a term associating the deviation of the ith cost approximate (F,) for each subnet.

[0087] - the determination, by each peripheral agent, of a first strategy of piloting by carrying out an initial local optimization consists of:

[0088] + locally solve a local optimization problem making it possible to determine the locally optimized steering strategy for the micro-grid: (x**,Zja)= argmin fr / x,; z,) Xj.Zi st Cj(Xj; Zj) - 0

[0089] with f1 the ith local cost function translating the local objective to be optimized while respecting a set of local constraints Q, and the local optimal values ​​of the internal variables;

[0090] + solve two local optimization problems allowing to determine, from a on the one hand, the upper flexibility limit and, on the other hand, the lower flexibility limit, for the locally optimal control strategy of the micro-network previously determined, that is for the lower limit: - argmin '^(z?' - z^) st z?) < (¾(xl"; z|*)) + P*

[0091] and for the upper bound: (xf'\zf')= argmin «^(zf - ZjV) KJ.Zj St Cj(xf;zf) = O

[0092] where Cty]ex, «i7. [5V, Cttflex' ct [3A are predefined coefficients, x^ the local optimal values ​​of the lower bounds of the internal variables and x^* the local optimal values ​​of the upper bounds of the internal variables.

[0093] - the determination, by each peripheral agent, of a second piloting strategy locally optimized under the constraint of the global optimal values ​​of the external variables is written: xf' = argmin t? (xO Xj st Cj(xj; zf ) = 0

[0094] where f1 is the ith local cost function translating the local objective to be optimized while respecting a set of local constraints Q and x^ are the local optimal values ​​of the internal variables of the second locally optimized steering strategy.

[0095] - the method further comprising a final step of controlling each component of the i-th subnet in accordance with the second steering strategy.

[0096] - The process is iterated for each time step.

[0097] - the different iterations of the process making it possible to specify the i-th approximate cost.

[0098] The invention also relates to a computer program comprising software instructions which, when executed by a computer, implement a control method as defined above.

[0099] The invention will appear more clearly on reading the description which follows, given solely by way of non-limiting example, and made with reference to the drawings in which:

[0100] [Fig-1] [Fig.l] is a schematic representation of a multi-control method levels by bands according to the state of the art;

[0101] [Fig.2] [Fig.2] is a schematic representation in block form of a system for implementing a multi-level control method using strips according to the state of the art or according to the invention;

[0102] [Fig.3] [Fig.3] is a schematic representation of a multi-control method levels by bands according to the invention; and,

[0103] [Fig.4] [Fig.4] is a graph illustrating the consideration of the cost of flexibility for global optimization.

[0104] The method according to the invention is a multi-level control method by bands, with control at the local level for each of the micro-networks and centralized global control for the coordination of the different micro-networks.

[0105] This method is implemented in an infrastructure which will now be presented with reference to [Fig.2].

[0106] The infrastructure 1 comprises an electrical network 2 and a control system 3 for the electrical network 2.

[0107] The electrical network 2 aggregates a plurality of electrical sub-networks 4, where i is an integer index between 1 and n, n being the number of sub-networks constituting the network 2.

[0108] For example, the 4i micro-network brings together several components, such as:

[0109] • a 100 MW peak PV 61 power plant;

[0110] • a residential building 7i of type B1 of which part of the charges such as heating / air conditioning can be modulated upwards or downwards;

[0111] • an 8i charging station for long-range electric vehicles (possibility of do load shifting), with some fast charging needs.

[0112] The micro-network 4; groups together several components, such as for example:

[0113] • a PV power plant 6; of 50 MW peak;

[0114] • a stationary storage system 7; with a capacity of 5 MWh and a power + / - 1MW at charge / discharge;

[0115] • a charging station 8; for electric vehicles.

[0116] The 4n micro-network brings together several components such as:

[0117] • a 6n stationary storage system with a capacity of 10 MWh and a power of + / - 1 MW at charge / discharge;

[0118] • a 7n diesel generator, 5 MW;

[0119] • an 8n industrial building with production requiring large needs and a need for continuous power supply.

[0120] The sub-networks 4; are connected to a common distribution network 5. The latter can for example itself be connected to another network, such as a grid network.

[0121] The control system 3 comprises a plurality of peripheral agents 10; and a central agent 12.

[0122] The central agent 12 is connected to the peripheral agents 10; by a suitable communication network 14. The network 14 is for example an IP communication network, such as the Internet network. The central agent 12 and each peripheral agent 10; are thus in bidirectional communication.

[0123] Each peripheral agent 10; equips a single electrical sub-network 4; to locally control the operation of this sub-network. Each peripheral agent 10; optimizes the operating variables of the micro-network at the local level.

[0124] Each peripheral agent 10; consists of at least one computer suitably programmed for implementing the method according to the invention. This computer comprises, for example, a memory and a processor associated with the memory. The memory stores code instructions which, when executed by the processor, participate in implementing the method according to the invention.

[0125] The central agent 12 globally controls the operation of the entire network 2. The central agent 12 plays the role of coordinator. The central agent 12 consists of at least one computer suitably programmed for implementing the method according to the invention. This computer comprises, for example, a memory and a processor associated with the memory. The memory stores code instructions which, when it are executed by the processor, participate in the implementation of the method according to the invention.

[0126] The central agent 12 is for example a service hosted in a cloud computing architecture. The central agent 12 can advantageously have much greater computing power than that of the local agents 10. This makes it possible to offer flexibility services for network management which require significant computing power.

[0127] [Fig.3] schematically represents the method 200 according to the invention.

[0128] Generally, method 200 is an improvement of method 100 of the state of the technique. We therefore take up in what follows the notations introduced above for the process 100, in particular the notations for the internal and external variables, the cost functions, the constraints and the optimal values ​​calculated for the variables and the limits.

[0129] Each peripheral agent 10; calculates and transmits additional information to the central agent 12.

[0130] This additional information corresponds to evaluations of the degradation of the local objective considered during the local optimization, in particular for each of the two flexibility margins, respectively upper and lower.

[0131] According to the method 200, each peripheral agent 10; first performs a first step 210.

[0132] Step 210 comprises a first sub-step 212, followed by a second sub-step 214.

[0133] The first sub-step 212 consists of locally solving a first local optimization problem. The latter is simpler than that solved in step 110 of the method 100.

[0134] Indeed, we are now seeking to determine only the locally optimized control strategy for the micro-network 4;. This can be written in a condensed manner: = argmin fXxi) + fz(zi) Xi,Z; st AjX; -f BjZj = c;

[0135] More generally, the ith local cost function is written:

[0136] f^Zj)

[0137] and the constraints are written:

[0138] C^zj^O

[0139] In this first sub-step 212, there is no calculation of flexibility margin. They will be calculated locally and separately in the second sub-step 214 next.

[0140] The advantage of separating the optimization of local, internal and external variables into several stages lies in the fact that the optimal trajectory thus calculated is then no longer influenced by the calculation of the flexibility limits.

[0141] Indeed, in the state of the art, depending on the coefficients aiicx chosen for the partial cost function, the resolution in the same optimization problem of the calculation of the flexibility limits and the optimal trajectory can, in certain cases, lead to degraded optimal solutions tending to maximize the flexibility margins to the detriment of the optimal trajectory.

[0142] The solution proposed here does not suffer from this disadvantage since the optimal trajectory and the flexibility margins are treated independently and sequentially.

[0143] The control strategy calculated at the end of the first sub-step 212 is therefore the most optimal control strategy possible for the micro-network 4; considered. It leads to the determination of the values ​​xl* and z|*.

[0144] Then, the second sub-step 214 consists of solving, still locally, two optimization problems making it possible to determine, on the one hand, the upper flexibility limit and, on the other hand, the lower flexibility limit, for the locally optimal control strategy of the micro-network determined in 212.

[0145] Thus, for the calculation of the lower bound on the external variables zî, the optimization problem to be solved is written: 04'*« zf) = argmin a^eH(zj5s - z^) « St AiX? + BjzX = es ' t <1 1

[0146] And, for the calculation of the upper bound on the external variables the optimization problem to be solved is written: = argmm - zp) st Ajxf + BjZp = Cj feW) + W) + fFOD)+ PC

[0147] where the coefficients Ot£nex and Ct^flex can be identical or different for the upper and lower limits and / or from one sub-network to another.

[0148] The additional constraint makes it possible to determine the limits with a control of the acceptable degradation of the optimality value. This control is carried out through the choice of the coefficients 0^ and pv, on the one hand, and the coefficients of and [jA, on the other hand.

[0149] This improvement compared to method 100 makes it possible to limit the flexibility limits to values ​​of the cost function which are locally acceptable (degradation of the comfort of users of a building for example).

[0150] The separation of the calculation of the bounds into two sub-problems also makes it possible to parallelize the resolution process, in addition to reducing the complexity of the optimization problem, which makes it possible to save in resolution time and in memory space necessary for the calculations, which constitutes an important advantage for deployment in a small local calculation unit, such as the peripheral agent 10;.

[0151] At the end of steps 212 and 214, each local agent 10 transmits (step 215) to the central agent 12, via the communication network 14, the following information:

[0152] - the optimal steering strategy for external variables zf;

[0153] - the optimal steering strategy for the lower flexibility bound of the variables external z^¥; and,

[0154] - the optimal steering strategy for the upper flexibility bound of the variables external z^,

[0155] but also the following additional information:

[0156] - the cost of the local optimal steering strategy on the internal variables f^x^ )

[0157] - the cost of the local optimal steering strategy for the flexibility terminal in lower of the internal variables f(xy* j ; and,

[0158] - the cost of the local optimal steering strategy for the flexibility terminal su superior of internal variables

[0159] Alternatively, a local agent 10; can also transmit the cost of the local optimal steering strategy on the external variables and the associated flexibility limits: ZI*), , and f^zA*) • However, the central agent generally knows generally the final cost for each of the external variables of the sub-networks, since these external variables are public and correspond to connection points on the common distribution network 5.

[0160] Step 220, carried out by the central agent 12, then consists of solving a global optimization problem, with a global cost function § reflecting the global objective to be optimized, and respecting all the constraints, in particular a new constraint on the flexibility limits. The global optimization problem to be solved is written: (zj z['J.....z®") = argmin g(z) Z, s. t Dz = h zf < Zj < zf

[0161] This optimization problem solves two problems at once:

[0162] - the first problem is to determine an overall optimal steering trajectory for the entire system 2. This trajectory has the new constraint of having to be within the envelope defined by all the flexibility margins of the micro-networks 10;

[0163] zf^z^zf*

[0164] - the second problem is to distribute this global piloting trajectory between the micro-networks, so as to determine, for each of the micro-networks 10;, its participation in this global trajectory.

[0165] Solving this second problem is essential since it is necessary to make the right choices, i.e. to decide which micro-grid should increase / decrease its production / consumption, by how much and when. The additional cost information communicated by each micro-grid is then used to guide this distribution.

[0166] To do this, the additional information makes it possible to construct an approximate cost Fj for each sub-network 10;. This is a piecewise linear function.

[0167] As for example shown in Figure 4, in a simple embodiment the ith approximate cost F; is made up of two segments.

[0168] A first lower line segment connects the points with coordinates (zy* ^(xf )) and xPp, on the one hand, and a second upper line segment Mf connects the points with coordinates (z| ' ))cl j ), on the other hand.

[0169] At the minimum of the approximation, we have the relation = f (x1^ ct 'cs maximum of the approximation are given for the authorized flexibility margins.

[0170] This approximate cost makes it possible to evaluate the impact of the deviation from the optimal trajectory on the internal cost of the ith sub-network 4; between the local optimal values ​​of the external variables zF and the global optimal values ​​of the external variables zU.

[0171] The use of such an approximation makes it possible to order the flexibilities of the micronetworks and to pass on the deviation calculated by taking into account the global objective to the micronetworks for which this deviation has the minimum impact on the internal objective.

[0172] For this, the cost function & can be divided into two parts

[0173] g = GlobalCost(z) +£.IntemalCost(zi)

[0174] With a first part, GlobalCost, corresponding to the gain from the coordinated participation of all the sub-networks 4; to the global strategy, as a gain in revenue for participation in remunerative flexibility services.

[0175] The second part of the cost function S, lnternalCost( Zj ), corresponds to the estimation of the internal costs, using the piecewise linear approximation, like that of figure 4, for each global steering trajectory zi, of a sub-network 4j, described previously:

[0176] internalCostCZj) = F^zJ -F / z*)

[0177] This leads to the global optimization of the external variables zp*, each of these values ​​corresponding to a local cost p.^8^-

[0178] Finally, in step 225, the central agent 12 transmits to each of the peripheral agents 10;, the new operating point z£*.

[0179] Then, each of the peripheral agents 10; implements step 230.

[0180] This is identical to step 130 of method 100 of the prior art.

[0181] Thus, each micro-network 4; calculates its local optimal control strategy so as to follow the imposed global optimal control strategy: xp' = argmin fsCxi) HAS s. t AjXj q BjZ® '

[0182] The peripheral agent 10; then controls the different components of the electrical sub-network 4;, using the xp* as control instructions.

[0183] The method 200 is iterated for the next time step.

[0184] Alternatively, the method 200 can be iterated for the same time step, to get closer to the optimal global control solution.

[0185] This variant allows, at each iteration, to refine, for each of the micro-networks, the approximation of the cost of a deviation between local trajectory and global trajectory.

[0186] This more precise information allows the coordinator to refine the optimization of the overall trajectory and the participation of each micro-network in this overall strategy.

[0187] It is necessary to emphasize that the local objective of a subnetwork may be different from the local objective of another subnetwork and especially from the global objective of the network as a whole. Thus, the cost functions, in particular the internal partial functions f^, the external partial functions f* and the partial margin functions (coefficients a[lex) bear the index i of the subnetwork that uses them.

[0188] The form of these partial functions can also depend on time in order to favor certain time steps of the time horizon, in particular the time steps for which Flexibility is important. In this way, the calculated flexibility is not constant over all time steps but can vary over time. It is therefore more relevant to have more flexibility when the price of electricity is high and, on the contrary, less flexibility when the price of electricity is low. This can also lead to an improvement in the operation of the electricity network, by taking into account the physical constraints of the network, such as line congestion problems, limitations on power transmissions, etc.

[0189] Thus, according to the invention, the network coordinator has additional information enabling it to distribute the achievement of the overall objective between the different sub-networks.

[0190] It should be noted that if a micro-network indicates a significant margin of flexibility, this does not provide information on the impact of the deviation from the local optimal control strategy and on the degradation of its own local objective.

[0191] With the invention, the degradation of the local objective can be controlled so as to limit it.

[0192] The particular embodiment presented in detail above has the additional advantage of possibilities of parallelization (during step 214 of method 200) of the calculations by reducing the complexity of the problems treated, in particular in the first steps of local optimization.

[0193] In the particular embodiment presented in detail above, the functionalities offered by the agents, peripherals or central, are in the form of software, or a software brick, executable by the processor of the associated computer. This software, or computer program, is furthermore capable of being recorded on a medium, not shown, readable by a computer. The computer-readable medium is, for example, a medium capable of storing electronic instructions and of being coupled to a bus of a computer system. For example, the readable medium is an optical disk, a magneto-optical disk, a ROM memory, a RAM memory, any type of non-volatile memory (for example FLASH or NVRAM) or a magnetic card. A computer program comprising software instructions is then stored on the readable medium.

[0194] The method according to the invention finds numerous applications, such as:

[0195] - aggregate several sites (micro-networks) which have capacities and powers limited, to position the resulting coordinated network on flexibility markets.

[0196] - manage a distribution network with PV production and consumption local to promote local consumption and avoid as much as possible the backflow of active power onto the transmission network. This also helps improve the stability of the transmission network and overall network management.

Claims

Claims

1. A computer-implemented method (200) for multi-level control by strips of an infrastructure (1) comprising an electrical network (2) and a control system (3) for the electrical network, the electrical network (2) aggregating a plurality of electrical sub-networks (4;), the electrical sub-networks (4;) being connected to a common distribution network (5), and the control system (3) comprising a plurality of peripheral agents (10;) and a central agent (12), the central agent (12) being connected to the peripheral agents (10;) by a communication network (14), each peripheral agent (10;) being associated with a single electrical sub-network (4;) for locally controlling an operation of the associated electrical sub-network, and the central agent (12) globally controlling an operation of the electrical network (2), the method comprising the steps of: - determination, by each peripheral agent (10;), of a first control strategy by carrying out a first local optimization, by implementing an ith local cost function, on a set of control variables of the ith electrical sub-network (4;), said set of variables comprising, on the one hand, internal variables xi5 associated with components of the ith electrical sub-network, and, on the other hand, external variables z; associated with the connection point of the ith electrical sub-network to the distribution network (5); - transmission, by each peripheral agent (10;) to the central agent (12), of a first plurality of information comprising, for each electrical sub-network (4;): the local optimal values ​​of the external variables z-*; the local optimal values ​​of lower limits of the external variables zV*; and the optimal values ​​of upper limits of the external variables z^* of the sub-network; - determination, by the central agent (12), of a global control strategy by carrying out a global optimization on all the external variables z; of the different electrical sub-networks (4;); - transmission, by the central agent (12) to each peripheral agent (10;), of a second plurality of information comprising, for each electrical sub-network (4;), the global optimal values ​​of the external variables zp*; and, - determination, by each peripheral agent (10;), of a second piloting strategy by carrying out a second local optimization, under constraint of the global optimal values ​​of the external variables (z?*), on the internal variables x;, the method being characterized in that the first plurality of information further comprises additional information, the additional information comprising, for each electrical sub-network (4;): a value of the ith local cost function on the local optimal values ​​of the internal variables XP); a value of the ith local cost function on the local optimal values ​​of the lower bounds of the internal variables xy* j; and a value of the ith local cost function on the local optimal values ​​of the upper bounds of the internal variables f (xa* j, and in that the determination, by the central agent (12), of a globally optimized control strategy takes into account the additional information to distribute the contribution of each sub-network (4;) to the globally optimized steering strategy taking into account, for each sub-network (4;), a deviation of an ith approximate cost (F,) on the first locally optimized steering strategy between the local optimal values ​​of the external variables (zp and the global optimal values ​​of the external variables (zp), the ith approximate cost deriving from the additional information transmitted by the ith peripheral agent (10i).;

2. The method of claim 1, wherein the ith approximation cost is a piecewise linear function having a lower segment connecting the point of coordinates zp and xy* j and the point of coordinates zh and xlp and an upper segment connecting the point of coordinates zp; f ( xl* j and the point of coordinates zp and p ( xa* ).

3. Method according to claim 1 or claim 2, in which the global optimization is written: (zp, ..., zp..., Z®') = argmin g(zs) 2i the global optimization being carried out while respecting a set of global constraints including the constraint: Zp < Z, < zpwith § a global cost function reflecting the global objective.

4. The method of claim 3, wherein the overall cost function g includes a term associating the deviation of the ith approximate cost (F;) for each subnetwork (4;).

5. Method according to any one of the preceding claims, in which the determination, by each peripheral agent (10;), of a first piloting strategy by carrying out a first local optimization consists of: - locally solve (212) a local optimization problem making it possible to determine the locally optimized control strategy for the micro-network: = argmin Zj) st QCxp Zj) = 0 with f the ith local cost function translating the local objective to be optimized while respecting a set of local constraints Q, and x|* the local optimal values ​​of the internal variables; - solve (214) two local optimization problems making it possible to determine, on the one hand, the upper flexibility limit and, on the other hand, the lower flexibility limit, for the locally optimal control strategy of the micro-network previously determined, i.e. for the lower limit: (xf,zn = argmin «^(zf - z5v) St = 0 and for the upper limit: ) = argmin - z^) Xi,Zi St C|(xp; z[v) = 0 ft(xoZL) af (ft(xhzF)) + PC where Otj^iex, aï, pv, dffiex, aC and pA are predefined coefficients, xV* the local optimal values ​​of the lower bounds of the internal variables and X^ the local optimal values ​​of the upper bounds of the internal variables.

6. Method according to any one of the preceding claims, in which the determination, by each peripheral agent (10i), of a second locally optimized piloting strategy under constraint of the global optimal values ​​of the external variables z^, is written: = argmin fl (x.) Xi st Cj(xj; z®') = 0 where f1 is the ith local cost function translating the local objective to be optimized while respecting a set of local constraints Q and x?¥ are the local optimal values ​​of the internal variables of the second locally optimized steering strategy.

7. Method according to any one of the preceding claims, comprising a final step of controlling each component of the ith sub-network in accordance with the second control strategy.

8. A method according to any preceding claim, the method being iterated for each time step.

9. Method according to any one of the preceding claims, the method being iterated at the current time step, the different iterations making it possible to specify the ith approximate cost.

10. A computer program comprising software instructions which, when executed by a computer, implement a method according to any one of the preceding claims.

Images