An economic dispatch method for smart grid without initialization based on specified time consistency
Through the specified time consistency control algorithm, the problem of difficulty in obtaining the initial state and estimating the convergence time in the economic scheduling of smart grids is solved, and the precise designation and flexibility of the system's convergence time are achieved to adapt to the needs of frequent changes in the power grid.
Patent Information
- Application Number
- CN202210611030.0
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2022-05-31
- Publication Date
- 2024-11-26
- Estimated Expiration
- 2042-05-31
AI Technical Summary
The existing smart grid economic scheduling methods deal with the problem of difficulty in obtaining the initial state and difficulty in estimating the convergence time, which leads to uncertain convergence time and cannot meet the needs of frequent changes in the power grid.
Adopt the uninitialized economic scheduling method based on specified time consistency, and ensure that the system reaches the optimal state within the specified time by establishing mathematical models, transforming them into dual problems, constructing a directional balanced topology diagram and a specified time consistency control algorithm to ensure that the system reaches the optimal state within the specified time and avoid the initial state. Status impact.
It realizes the precise specification of the system convergence time, improves flexibility and scalability, reduces initialization preparation and computing overhead, and the system can respond adaptively after local changes.
Smart Images

Figure CN114925537B_ABST
Abstract
Description
Technical Field
[0001] The present invention belongs to the field of smart grid economic dispatching, and relates to an initialization-free economic dispatching method based on specified time consistency under directed topology. Background Art
[0002] Smart grid has received increasing attention due to its increasing applications in science and engineering. The economic dispatch problem is one of the important optimization problems in the field of smart grid, which aims to minimize the total cost of power generation under certain constraints (such as supply and demand equality constraints, and capacity inequality constraints of individual generators). The cost calculation method for each generator is usually modeled by its own quadratic convex function. In the early days, the economic dispatch problem could be solved by various traditional centralized methods, including lambda iteration, particle swarm optimization, gradient descent, dynamic programming, Lagrangian relaxation, etc. However, the centralized structure requires a powerful central controller, and its dependence on global information and limited communication capabilities make the grid prone to single point failures and also reduce the privacy level of the grid.
[0003] In order to overcome the shortcomings of the above-mentioned centralized algorithms, distributed algorithms based on the consensus theory of multi-agent systems have received widespread attention in recent years. Distributed economic dispatch algorithms only need to exchange information between neighbors to calculate the optimal decision. On the one hand, it avoids single point failures caused by global information and reduces the communication and computing burden of the system. On the other hand, it provides plug-and-play capabilities, which greatly improves the flexibility and scalability of the system. However, many distributed algorithms require a certain initialization preparation process and cannot handle time-varying demand and intermittent power generation caused by the addition or exit of generators. In addition, the asymptotic and exponential convergence speeds are not suitable for frequently changing situations in the power grid.
[0004] In order to improve the convergence speed, finite time and fixed time methods came into being. The finite time method greatly improves the convergence speed of the system, but it is limited by the initial state of the consistency variable, and its convergence time varies with the change of the initial state. However, in practical applications, the initial state of the system is difficult to collect. The fixed time method is no longer affected by the initial state setting of the consistency variable, but due to certain restrictions, such as the design parameters of the protocol or the network topology, the convergence time cannot be pre-specified.
[0005] In the prior art, such as the patent "Economic dispatch method of distributed smart grid based on finite time consistency under directed topology", the finite time consistency method is used to solve the economic dispatch problem in the smart grid. Compared with asymptotic convergence, this method can obtain an upper bound on the system convergence time. However, the upper bound of the convergence time is affected by the initial value of the state, and in practical applications, the initial value of the system is difficult to obtain, which leads to the estimation of the convergence time is still greatly limited. This patent overcomes the above problems and uses the specified time consistency method to solve the economic dispatch problem. Not only does it make the convergence time no longer affected by the initial state, but it can also specify the convergence time in advance, so that the convergence time of the system is no longer limited to "estimate" but can be accurately specified in advance. The flexibility and scalability of the system are improved. Summary of the invention
[0006] The present invention aims to solve the above problems of the prior art. A method is proposed. The technical solution of the present invention is as follows:
[0007] A method for economic dispatching of a smart grid without initialization based on specified time consistency comprises the following steps:
[0008] Step 1, establish a mathematical model for the economic dispatch problem of smart grid: including each distributed generation unit, generation cost function, minimum total cost of economic dispatch, and supply and demand balance and generator power limit constraint function;
[0009] Step 2: Convert to a dual problem: Convert the problem of solving the minimum value of the objective function in the economic dispatch mathematical model established in step 1 into the problem of solving the maximum value of the corresponding dual function, so that the power generation unit in the system and its neighboring nodes only need to exchange the Lagrange multiplier λ without exposing their respective local power generation, which plays a role in protecting privacy;
[0010] Step 3: According to the layout of the generator sets in the power generation system, a directed equilibrium topological graph structure is established to represent the communication relationship between the power generation units. According to its communication topological graph, the state variable λ in step 2 can be obtained. i The scope of exchange;
[0011] Step 4, given the physical time required for the system to operate, determine the lower limit of the time that can be specified in advance, and then use the specified time consistency control algorithm to obtain the optimal incremental cost and optimal power generation.
[0012] Furthermore, the mathematical model for establishing the smart grid economic dispatch problem in step 1 specifically includes:
[0013]
[0014]
[0015] Where N represents the number of generators, P i represents the power generated by the i-th generator, C i (p i ) represents the power generation cost function of the ith generator, and the coefficient α in formula (2) i ,β i ,γ i >0 represents the cost parameter of the i-th generator;
[0016]
[0017] where d i is the local power demand, is the node set of the communication topology graph, P d is the total power demand, and Represents the upper and lower limits of the power generation of the i-th generator.
[0018] Furthermore, the specific steps of converting the step 2 into a dual problem are as follows:
[0019] Before transforming the dual problem, we need to define the following Lagrangian function:
[0020]
[0021] λ is the Lagrange multiplier corresponding to the equality constraint and is called the incremental cost.
[0022] For the Lagrangian function defined in step 3, the Lagrangian multiplier method can be used to obtain:
[0023]
[0024] It can be obtained that when λ1=λ2=…=λ N When , the total cost function is minimized and the system reaches the optimal state.
[0025] Then convert it into the corresponding dual function as follows:
[0026]
[0027] Among them D i The gradient of (λ) is
[0028] The optimal solution can be expressed as follows:
[0029]
[0030] in yes Limited to their individual power generation limits The inverse function inside .
[0031] Furthermore, the step 3 establishes a directed balanced topological graph structure for representing the communication relationship between the power generation units according to the layout of the power generation units of the power generation system, specifically including:
[0032] The communication topology diagram of the power generation unit is shown as follows:
[0033] use Represents the topological relationship, and regards each power generation unit as a node, where is a node set, is the adjacency matrix of the topological graph, a ij , They respectively represent the set of real numbers, the elements of the adjacency matrix, and the set of all N×N (i.e., N rows and N columns) real matrices.
[0034] is the Laplace matrix. When the in-degree and out-degree of each node in the graph are equal, it is called a directed balanced graph.
[0035] Furthermore, in step 4, a specified time consistency control algorithm is then used to obtain the optimal incremental cost and the optimal generated power.
[0036] in is its derivative. h =t0+T, Indicates the start time. T>0 is the convergence time that can be specified in advance and must be greater than the physical time of the system. k>2 is a tuning parameter selected in advance.
[0037] The designed specified time consistency control algorithm is:
[0038]
[0039] p i (t) = ψ i (λ i (t)), (9)
[0040] Among them, b>0, c>0, θ>0, η>0 are design parameters, α i is the quadratic coefficient of the ith generator, ψ i (·) is defined in formula (5); represents the control input in a multi-agent system, λ j and λ i They represent the Lagrange multipliers of agent i and agent j, i.e., the position state information in the multi-agent system. The optimal incremental cost is obtained from (8), and the optimal power generation is obtained from (9).
[0041] The advantages and beneficial effects of the present invention are as follows:
[0042] (1) The present invention is different from the finite time / fixed time control method. The specified time ED algorithm proposed in the present invention can uniformly pre-specify the convergence time without considering the initial state and other parameters, that is, the convergence time is used as a parameter that can be defined by itself, reducing the additional overhead caused by initialization preparation and calculation of the upper bound of the convergence time.
[0043] (2) The algorithm eliminates the constraint of maintaining supply and demand balance in the initial state. After a local change occurs, the system can respond adaptively without any additional operations (such as adjusting relevant parameters or state values) and make the incremental cost reach consensus again within the specified time. BRIEF DESCRIPTION OF THE DRAWINGS
[0044] Figure 1 The present invention provides a preferred embodiment of a flow chart of an initialization-free economic scheduling method based on specified time consistency under a directed topology;
[0045] Figure 2 is a schematic diagram of the communication topology of the power generation unit in an embodiment of the present invention;
[0046] Figure 3 It is a schematic diagram of the change of the specified time incremental cost of the power generation unit in the embodiment of the present invention. ;
[0047] Figure 4 It is a schematic diagram of the change of power demand and power generation of the power generation unit at a specified time in an embodiment of the present invention.
[0048] Figure 5 It is a schematic diagram of the change of power generation of the power generation unit at a specified time in an embodiment of the present invention.
[0049] Figure 6 Schematic diagram of the change of the total cost of the power generation unit at a specified time in an embodiment of the present invention. DETAILED DESCRIPTION
[0050] The following will describe the technical solutions in the embodiments of the present invention in detail in conjunction with the accompanying drawings in the embodiments of the present invention. The described embodiments are only part of the embodiments of the present invention.
[0051] The technical solution of the present invention to solve the above technical problems is:
[0052] Step 1: This example uses a 5-bus microgrid for analysis, with one generator and one load on each bus. Assume that the specified convergence time T = 2s. Establish the following economic dispatch mathematical model:
[0053]
[0054]
[0055] Where N represents the number of generators, the power generated by i generators, C i (p i ) represents the power generation cost function of the ith generator, and the coefficient α in formula (2) i ,β i ,γ i >0 represents the cost parameter of the i-th generator.
[0056]
[0057]
[0058] These two equations are the generation capacity inequality constraint and the supply and demand balance equality constraint. i is the local power demand, P d is the total power demand, and Represents the upper and lower limits of the power generation of the i-th generator.
[0059] Cost coefficient α for each generator i ,β i ,γ i The specific values of the upper and lower limits of power generation are shown in Table 1:
[0060] Table 1
[0061]
[0062]
[0063] Assume that the initial power of each generator is 0, the virtual power demand of each load is d1 = 90kW, d2 = 110kW, d3 = 90kW, d4 = 100kW, and d5 = 110kW, and the initial total power demand is 500KW. The initial values of the incremental cost obtained after calculation are λ1(0) = 1.22, λ2(0) = 3.41, λ3(0) = 2.53, λ4(0) = 4.02, and λ5(0) = 2.90.
[0064] Step 2: Convert to the dual problem:
[0065]
[0066] Among them D i The gradient of (λ) is
[0067] The optimal solution can be expressed as follows:
[0068]
[0069] in yes Limited to their individual power generation limits The inverse function inside .
[0070] Step 3: Communication topology diagram of power generation unit Figure 2 .use Represents the topological relationship, and regards each power generation unit as a node, where For a node set. is the adjacency matrix of the topological graph. Laplacian matrix is defined as: When the in-degree and out-degree of each node in the graph are equal, it is called a directed balanced graph.
[0071] Step 4: The designated time control protocol proposed by the present invention is as follows:
[0072]
[0073] p i (t) = ψ i (λ i (t)),
[0074] The optimal incremental cost obtained by using this protocol is 19.87, and then the optimal power generation of each power generation unit is calculated according to the local parameters of each power generation unit: and
[0075] The change diagram of all the above processes is shown in Figure 3-6 .
[0076] It should also be noted that the terms "include", "comprises" or any other variations thereof are intended to cover non-exclusive inclusion, so that a process, method, commodity or device including a series of elements includes not only those elements, but also other elements not explicitly listed, or also includes elements inherent to such process, method, commodity or device. In the absence of more restrictions, the elements defined by the sentence "comprises a ..." do not exclude the existence of other identical elements in the process, method, commodity or device including the elements.
[0077] The above embodiments should be understood to be only used to illustrate the present invention and not to limit the protection scope of the present invention. After reading the contents of the present invention, technicians can make various changes or modifications to the present invention, and these equivalent changes and modifications also fall within the scope defined by the claims of the present invention.
Claims
1. A method for economic dispatching of smart grid without initialization based on specified time consistency, characterized in that: The following steps are involved: Step 1, establish a mathematical model for the economic dispatch problem of smart grid: including each distributed generation unit, generation cost function, minimum total cost of economic dispatch, and supply and demand balance and generator power limit constraint function; Step 2: Convert to a dual problem: Convert the problem of solving the minimum value of the objective function in the economic dispatch mathematical model established in step 1 into the problem of solving the maximum value of the corresponding dual function, so that the power generation unit in the system and its neighboring nodes only need to exchange the Lagrange multiplier λ without exposing their respective local power generation, which plays a role in protecting privacy; Step 3: Construct the communication topology of the power system: According to the layout of the generator sets in the power generation system, a directed equilibrium topology structure is established to represent the communication relationship between the power generation units. According to the communication topology, the state variable λ in step 2 can be obtained. i The scope of exchange; Step 4, given the physical time required for the system to operate, determine the lower limit of the time that can be specified in advance, and then use the specified time consistency control algorithm to obtain the optimal incremental cost and optimal power generation; In step 4, a specified time consistency control algorithm is then used to obtain the optimal incremental cost and the optimal generated power; First, define a time-varying scalar function; in is its derivative; t h =t0+T, Indicates the start time; T>0 is the convergence time that can be specified in advance and must be greater than the physical time of the system; k>2 is the adjustment parameter selected in advance; The designed specified time consistency control algorithm is: p i (t)=ψ i (l i (t)), (9) Among them, b>0, c>0, θ>0, η>0 are design parameters, α i is the quadratic coefficient of the ith generator, ψ i (·) is defined in formula (5); represents the control input in a multi-agent system, λ j and λ i They represent the Lagrange multipliers of agent i and agent j, i.e., the position state information in the multi-agent system. The optimal incremental cost is obtained from equation (8), and the optimal power generation is obtained from equation (9).
2. The method for economic dispatching of a smart grid without initialization based on specified time consistency according to claim 1, characterized in that: The mathematical model for establishing the smart grid economic dispatch problem in step 1 specifically includes: Where N represents the number of generators, P i represents the power generated by the i-th generator, C i (p i ) represents the power generation cost function of the ith generator, and the coefficient α in formula (2) i ,β i ,γ i >0 represents the cost parameter of the i-th generator; where d i is the local power demand, is the node set of the communication topology graph, P d is the total power demand, and Represents the upper and lower limits of the power generation of the i-th generator.
3. The method for economic dispatching of a smart grid without initialization based on specified time consistency according to claim 2, characterized in that: The specific steps of transforming the dual problem in step 2 are as follows: Before transforming the dual problem, we need to define the following Lagrangian function: λ is the Lagrange multiplier corresponding to the equality constraint and is called the incremental cost; For the Lagrangian function defined in step 3, the Lagrangian multiplier method can be used to obtain: It can be obtained that when λ1=λ2=…=λ N When , the total cost function is minimum and the system reaches the optimal state; Then convert it into the corresponding dual function as follows: Among them D i The gradient of (λ) is The optimal solution can be expressed as follows: in yes Limited to their individual power generation limits The inverse function inside .
4. The method for economic dispatching of a smart grid without initialization based on specified time consistency according to claim 3 is characterized in that: The step 3 establishes a directed balanced topological graph structure for representing the communication relationship between the power generation units according to the layout of the power generation units of the power generation system, and specifically includes: The communication topology diagram of the power generation unit is shown as follows: use Represents the topological relationship, and regards each power generation unit as a node, where is a node set, is the adjacency matrix of the topological graph, a ij , They represent the set of real numbers, the elements of the adjacency matrix, and the set of all N×N real matrices with N rows and N columns respectively; is the Laplace matrix; when the in-degree and out-degree of each node in the graph are equal, it is called a directed balanced graph.
