Partitioned and layered carbon emission flow real-time calculation method and device for provincial power grid

Abstract

The invention discloses a provincial power grid-oriented partitioned and layered carbon emission flow real-time calculation method and device. The method comprises the following steps: acquiring real-time data of a provincial power grid, and performing AC steady-state power flow calculation based on the real-time data to obtain active power distribution and branch active power loss of each branch of a system; searching and identifying a ring network in the provincial power grid by adopting a graph theory method according to the active power distribution of the branches and the flow direction of the power flow in each branch; carrying out equivalent processing on the identified looped network, and enabling the provincial power grid to be equivalent to a loopless network; the method comprises the following steps: converting a loop-free network topology structure into a graph model based on balanced partition, and carrying out topological sorting on all network nodes in a region by utilizing a graph theory method to obtain a node sequence set; and based on the node sequence set, according to a preset carbon emission allocation principle, performing layer-by-layer allocation of the carbon emission flow from the source side of the generator according to the upstream and downstream topological connection structures of the power grid nodes to obtain the carbon emission flow distribution of the whole network of the system.

Description

Technical Field

[0001] This invention relates to the field of low-carbon power technology in power systems, and more specifically, to a method and apparatus for real-time calculation of zoned and hierarchical carbon emission flows for provincial power grids. Background Technology

[0002] In the context of achieving the "dual carbon" goals, accurate and comprehensive carbon emission accounting and responsibility allocation are crucial for the low-carbon transformation of the power energy system, playing a vital guiding and supporting role. Currently, the widely used load-side indirect carbon emission allocation method extensively employs the average electricity carbon emission factor method. This method calculates the indirect carbon emissions allocated to each load node by multiplying its actual electricity consumption by the average electricity carbon emission factor for its respective region. While the average electricity carbon emission factor method is simple to calculate and fast in large-scale provincial power grids, it uses the same average carbon emission factor within the region, neglecting the temporal and spatial differences in load-side indirect carbon emission allocation. This fails to reflect the differences in indirect carbon emission allocation caused by real-time fluctuations and spatial location differences among loads within the region, resulting in inaccurate allocation results.

[0003] Currently, there are also carbon flow analysis methods based on carbon emission flow theory. Most existing technologies for analyzing carbon emission flows are based on this theory, which directly obtains the indirect carbon emissions allocated to each node on the load side by solving the system power flow distribution matrix or by recursively and iteratively solving the node carbon emission factors. However, it cannot reflect the characteristics of carbon emission flow as a virtual network flow accompanying the system power flow, and the interpretability of the allocation results is not strong. At the same time, there are few studies on load-side indirect carbon emission allocation at the regional level using graph theory methods. Summary of the Invention

[0004] To address the shortcomings of existing technologies, this invention provides a method and apparatus for real-time calculation of zoned and hierarchical carbon emission flows for provincial power grids.

[0005] According to one aspect of the present invention, a method for real-time calculation of zoned and hierarchical carbon emission flows for provincial power grids is provided, comprising:

[0006] Real-time data of the provincial power grid is acquired, and AC steady-state power flow calculation is performed based on the real-time data to obtain the active power distribution and active power loss of each branch of the system.

[0007] Based on the active power distribution of branches, and according to the power flow direction in each branch, the graph theory method is used to search for and identify the ring network in the provincial power grid.

[0008] The identified ring networks are processed to convert the provincial power grid into a ring-free network.

[0009] The acyclic network topology is transformed into a graph model based on balanced partitioning, and graph theory methods are used to perform topological sorting of all network nodes within the partition to obtain the node order set.

[0010] Based on the node sequence set and according to the preset carbon emission allocation principle, starting from the generator source side, carbon emission flow is allocated layer by layer according to the upstream and downstream topology connection structure of the power grid nodes to obtain the carbon emission flow distribution of the entire system.

[0011] Optionally, real-time data of the provincial power grid is acquired, and AC steady-state power flow calculation is performed based on the real-time data to obtain the active power distribution and active power loss of each branch of the system, including:

[0012] Based on real-time data of the provincial power grid, AC steady-state power flow calculation is performed on the provincial power grid to obtain the balance equations of active power flow and reactive power flow at the nodes. The real-time data of the provincial power grid includes any combination of the following data: active power, reactive power, unit type, capacity, carbon capture rate, carbon content of coal, coal consumption characteristics per kilowatt-hour, and power consumption of loads at each node of the system.

[0013] The Newton-Raphson method was used to solve the equilibrium equations to obtain the voltage magnitude and angle at each node of the system.

[0014] Based on the voltage amplitude and angle of each node in the system, the active power distribution and active power loss of each branch of the provincial power grid are calculated.

[0015] Optionally, the balance equations for active power flow and reactive power flow at the nodes are:

[0016]

[0017] Among them, P Gi Q Gi P represents the active power and reactive power injected into generator set at node i, respectively. Li Q Li G represents the active and reactive power consumed by the load at node i, respectively. ij B ij U represents the amplitudes of the conductance and susceptance of branch ij, respectively. i U j Let δ be the node voltage magnitudes of nodes i and j. ij For the voltage angle δ at node i i and node j voltage angle δ j angular difference, i.e. δ ij =δ i -δ j ;

[0018] The calculation expressions for active power distribution and branch active power loss are as follows:

[0019] P ij =V i V j (G ij cosδ ij +B ij sinδ ij )

[0020] P ij loss =2U i U j G ij cosδ ij

[0021] In the formula, P ij P is the active power flowing through branch ij. ij loss Let be the active power loss of branch ij.

[0022] Optionally, based on the active power distribution of branches and according to the power flow direction in each branch, a graph theory method is used to search for and identify ring networks in the provincial power grid, including:

[0023] Step 1: Initialize the process algorithm, input the provincial power grid structure stored in the adjacency matrix, and input the starting node K (K=1) for the search;

[0024] Step 2: Search for all downstream nodes adjacent to node K to form a node set;

[0025] Step 3: Determine whether the node set contains the same node as the current path. If it does, add the duplicate node to the end of the path to form a network loop and save it. At the same time, delete the duplicate node from the node set.

[0026] Step 4: If it does not exist, take any node and add it to the end of the current path, remove the node from the set, use the new end node as the starting node for the search, and continue to search for the downstream adjacent nodes of the node to form the intermediate adjacent node set.

[0027] Step 5: Determine if the intermediate node set is empty. If it is not empty, return to step 3; otherwise, proceed to step 6.

[0028] Step 6: Return to the previous node set and determine if it is the initial node set. If it is the initial node set and the set is empty, it means that the cycle search of node K is complete, and proceed to step 7; otherwise, return to step 4 to continue the loop search to identify the cycle of node K.

[0029] Step 7: Determine if the value of node K is equal to the total number of nodes in the system network. If it is equal, it indicates that the ring network identification and search of all nodes in the network is complete and a ring network exists. Then output the saved connection information of all ring network nodes and the process ends. Otherwise, let K = K + 1 and return to step 2 to continue the loop search and identification of the next network node.

[0030] Optionally, the identified ring network is subjected to equivalent processing to transform the provincial power grid into a ring-free network, including:

[0031] The ring network nodes and the network branches connecting them are equivalent to a generalized bus node. The generator power flowing into each node in the ring network is equivalent to the generator power flowing into this equivalent bus node. Its equivalent injected carbon flow rate is obtained by summing the carbon flow rates injected into each node by each generator in the ring network.

[0032] The load power of each node in the ring network is equivalent to an equivalent load power added to the bus node. The carbon emission flow allocated to it is obtained based on the carbon emission allocation on the source side. After the equivalence, the connection branch between the generalized bus node and the provincial power grid and the power flow are the same as before the equivalence. The connecting branch is the cut set branch of the ring network, forming a ringless network.

[0033] Optionally, the acyclic network topology is transformed into a graph model based on balanced partitioning, and graph theory methods are used to perform topological sorting of all network nodes within the partition, resulting in a node order set, including:

[0034] Step 1: Process initialization, input the graph model G stored in the adjacency matrix;

[0035] Step 2: Determine if graph G is empty. If graph G is not empty, proceed to step 3; if graph G is empty, proceed to step 7.

[0036] Step 3: Search for nodes in the graph with zero in-degree and store the nodes with zero in-degree in the node set S in sequence;

[0037] Step 4: After storing the nodes with an in-degree of zero into the node set, search for the downstream neighboring nodes directly connected to the node according to the network topology.

[0038] Step 5: In graph G, directly delete the node with an in-degree of zero and its downstream outgoing branch, and reduce the in-degree of the downstream adjacent nodes by 1.

[0039] Step 6: Update graph G and return to step 2, and repeat the process of searching, sorting and deleting nodes with an in-degree of zero.

[0040] Step 7: If the graph G is empty after the judgment, it means that all nodes in the graph have been stored in the node set in the order of their in-degree being zero. The topological sorting of the nodes is completed. Output the node set S. The topological sorting process ends and the node order set is obtained.

[0041] Optionally, based on the node sequence set and according to a preset carbon emission allocation principle, starting from the generator source side, carbon emission flows are allocated layer by layer according to the upstream and downstream topology of the power grid nodes to obtain the carbon emission flow distribution of the entire system, including:

[0042] Step 1: Input the relevant technical parameters of the provincial power grid and calculate the real-time carbon injection rate of each generator unit in the balance zone of the provincial power grid. The relevant technical parameters include the technical parameters and operating status of the lines, transformers, and switchgear.

[0043] Step 2: Based on the obtained node sequence set S, visit the k-th level node in the node set, with k initially set to 1, and calculate the total injected carbon flow rate ∑R of the current node. k in And perform a breadth-first search on the k-th level node to search for its directly adjacent lower-level vertices;

[0044] Step 3: After obtaining the downstream neighboring nodes of the current node through breadth-first search, carbon emission flow is allocated according to the allocation principle at the load of the current node and in the connection branch between the current node and the downstream neighboring node, so as to obtain the carbon flow allocation results of the system network branch and the load side.

[0045] Step 4: Determine whether all nodes in the node set have been sequentially polled, i.e., k is less than the total number of nodes N in graph G. G If yes, then let k = k + 1 and return to step 2; otherwise, it indicates that the carbon emission allocation within the region is complete, the process ends, and the carbon emission flow distribution of the entire system network is obtained.

[0046] Optionally, input relevant technical parameters of the provincial power grid to calculate the real-time carbon injection rate of each generator unit within the provincial power grid balance zone, including:

[0047] Based on the current operating status and real-time power output of each generator unit, the coal consumption per kilowatt-hour (W) of each coal-fired unit can be obtained. i The calculation formula is as follows:

[0048] w i =(a i P Gi 2 +b i P Gi +c i )ζ i / P Gi

[0049] In the formula, ai b i c i These are the characteristic parameters of the unit's i-kWh coal consumption curve, ζ i This is a correction factor, which is related to the unit's operating status. Under normal conditions, it is taken as 1.0, P Gi The real-time active power output of unit i;

[0050] According to the coal consumption per kilowatt-hour of each coal-fired unit i Calculate the carbon emission intensity E of coal-fired power units Gi The calculation formula is as follows:

[0051]

[0052] In the formula, η i ξ represents the carbon content of the coal burned by unit i. i The oxidation rate of coal in unit i is generally taken as 98%, μ i For carbon capture rate, w i The coal consumption per kilowatt-hour calculated above, M c These are the molar masses of carbon dioxide and carbon, respectively.

[0053] According to the carbon emission intensity E Gi Calculate the real-time carbon injection rate R of each generator unit within the equilibrium zone. Gi Its calculation formula is: R Gi =P Gi E Gi .

[0054] Optionally, the carbon flow allocation results include:

[0055] Carbon flow rate R distributed across the load at node k Lk The calculation formula is:

[0056]

[0057] In the formula, P Lk P represents the active power of the load at node k. Nk This represents the power flowing through node k. This represents the sum of carbon flows into node k;

[0058] Carbon flow rate R distributed in branch ij ij The calculation formula is:

[0059]

[0060] In the formula, P ij P represents the active power in branch ij. Ni This represents the power flowing through the starting node i of branch ij. This represents the sum of carbon flows into the starting node i of branch ij;

[0061] The branch network loss carbon flow rate R corresponding to the power loss in branch ij ij loss The calculation formula is:

[0062]

[0063] In the formula, P ij loss This represents the active power loss in branch ij.

[0064] According to another aspect of the present invention, a real-time calculation device for zoned and hierarchical carbon emission flows for provincial power grids is provided, comprising:

[0065] The calculation module is used to acquire real-time data of the provincial power grid and perform AC steady-state power flow calculation based on the real-time data to obtain the active power distribution and active power loss of each branch of the system.

[0066] The identification module is used to search for and identify ring networks in the provincial power grid based on the active power distribution of branches and the power flow direction in each branch, using graph theory methods.

[0067] The equivalent module is used to perform equivalent processing on the identified ring network, and to convert the provincial power grid into a ringless network.

[0068] The sorting module is used to transform the acyclic network topology into a graph model based on balanced partitioning, and to use graph theory methods to perform topological sorting on all network nodes within the partition to obtain a node order set.

[0069] The carbon emission distribution module is used to distribute carbon emission flows layer by layer based on the node sequence set and according to the preset carbon emission distribution principle, starting from the generator source side and according to the upstream and downstream topology connection structure of the power grid nodes, to obtain the carbon emission flow distribution of the entire system.

[0070] According to another aspect of the present invention, a computer-readable storage medium is provided, the storage medium storing a computer program for performing the method of any of the above aspects of the present invention.

[0071] According to another aspect of the present invention, an electronic device is provided, comprising: a processor; a memory for storing processor-executable instructions; the processor being configured to read the executable instructions from the memory and execute the instructions to implement the method described in any of the preceding aspects of the present invention.

[0072] Therefore, the real-time calculation method for grid-regional and hierarchical carbon emission flows proposed in this invention utilizes real-time carbon emission data from the generation side and combines it with the characteristics of system carbon emission flows accompanying power flow. This solves the problems of insufficient accuracy in indirect carbon emission allocation on the load side by the average electric carbon emission factor method, and its inability to reflect the spatiotemporal differences in load-side carbon emission allocation. Compared with the average electric carbon emission factor method, it has higher allocation accuracy and more accurate results. Simultaneously, this invention uses graph theory to achieve layer-by-layer allocation of carbon emission flows in the provincial power grid starting from the carbon emission sources on the generation side. This solves the problem that current carbon flow analysis methods cannot reflect the characteristics of system carbon emission flows accompanying power flow. Compared with current carbon emission allocation and carbon flow tracking methods, the load-side carbon emission allocation results obtained are more interpretable and have certain theoretical significance and practical value. Attached Figure Description

[0073] Exemplary embodiments of the present invention can be more fully understood by referring to the following figures:

[0074] Figure 1 This is a flowchart illustrating a method for real-time calculation of zoned and hierarchical carbon emission flows for provincial power grids, provided by an exemplary embodiment of the present invention.

[0075] Figure 2 This is a flowchart of real-time calculation of carbon emission flows in a provincial power grid zone and layer, provided by an exemplary embodiment of the present invention.

[0076] Figure 3 This is a flowchart of a provincial power grid ring network search and identification process provided by an exemplary embodiment of the present invention;

[0077] Figure 4 This is a flowchart of node topology sorting within a provincial power grid balance zone provided by an exemplary embodiment of the present invention;

[0078] Figure 5 This is a schematic diagram of node power flow and carbon emission flow provided in an exemplary embodiment of the present invention;

[0079] Figure 6 This is a schematic diagram of the node power flow and carbon emission flow after equivalent branch network loss provided in an exemplary embodiment of the present invention;

[0080] Figure 7 This is a flowchart of carbon emission allocation within a provincial power grid balancing zone provided by an exemplary embodiment of the present invention;

[0081] Figure 8 This is a schematic diagram of a node breadth-first search provided in an exemplary embodiment of the present invention;

[0082] Figure 9 This is an AC steady-state power flow distribution diagram of the system within the equilibrium region provided by an exemplary embodiment of the present invention;

[0083] Figure 10 This is an AC steady-state power flow distribution diagram of the system after the equivalent ring network in the equilibrium region provided by an exemplary embodiment of the present invention;

[0084] Figure 11 This is a weighted directed graph of the equivalent ring network system provided by an exemplary embodiment of the present invention;

[0085] Figure 12 This is a diagram showing the carbon emission allocation results obtained by stratifying and allocating system carbon emissions according to an exemplary embodiment of the present invention.

[0086] Figure 13 This is a schematic diagram comparing the load allocation results of the graph theory hierarchical allocation method and the average carbon emission factor method provided in an exemplary embodiment of the present invention.

[0087] Figure 14 This is a schematic diagram of the structure of a zoned and hierarchical carbon emission flow real-time calculation device for a provincial power grid provided in an exemplary embodiment of the present invention;

[0088] Figure 15 This is the structure of an electronic device provided in an exemplary embodiment of the present invention. Detailed Implementation

[0089] Hereinafter, exemplary embodiments according to the present invention will be described in detail with reference to the accompanying drawings. Obviously, the described embodiments are merely some embodiments of the present invention, and not all embodiments of the present invention. It should be understood that the present invention is not limited to the exemplary embodiments described herein.

[0090] It should be noted that, unless otherwise specifically stated, the relative arrangement, numerical expressions, and values ​​of the components and steps described in these embodiments do not limit the scope of the invention.

[0091] Those skilled in the art will understand that the terms "first," "second," etc., in the embodiments of the present invention are only used to distinguish different steps, devices, or modules, and do not represent any specific technical meaning, nor do they indicate a necessary logical order between them.

[0092] It should also be understood that in the embodiments of the present invention, "multiple" can refer to two or more, and "at least one" can refer to one, two or more.

[0093] It should also be understood that any component, data or structure mentioned in the embodiments of the present invention can generally be understood as one or more unless explicitly defined or given contrary instructions in the context.

[0094] Furthermore, the term "and / or" in this invention is merely a description of the relationship between related objects, indicating that three relationships can exist. For example, A and / or B can represent: A existing alone, A and B existing simultaneously, or B existing alone. Additionally, the character " / " in this invention generally indicates that the preceding and following related objects have an "or" relationship.

[0095] It should also be understood that the description of the various embodiments in this invention emphasizes the differences between the various embodiments, and the similarities or similarities can be referred to each other. For the sake of brevity, they will not be described in detail.

[0096] At the same time, it should be understood that, for ease of description, the dimensions of the various parts shown in the accompanying drawings are not drawn according to actual scale.

[0097] The following description of at least one exemplary embodiment is merely illustrative and is in no way intended to limit the invention or its application or use.

[0098] Techniques, methods, and equipment known to those skilled in the art may not be discussed in detail, but where appropriate, they should be considered part of the specification.

[0099] It should be noted that similar labels and letters in the following figures indicate similar items; therefore, once an item is defined in one figure, it does not need to be discussed further in subsequent figures.

[0100] The embodiments of this invention can be applied to electronic devices such as terminal devices, computer systems, and servers, and can operate together with a wide range of other general-purpose or special-purpose computing system environments or configurations. Well-known examples of terminal devices, computing systems, environments, and / or configurations suitable for use with electronic devices such as terminal devices, computer systems, and servers include, but are not limited to: personal computer systems, server computer systems, thin clients, thick clients, handheld or laptop devices, microprocessor-based systems, set-top boxes, programmable consumer electronics, network PCs, minicomputer systems, mainframe computer systems, and distributed cloud computing environments including any of the above systems, etc.

[0101] Electronic devices such as terminal devices, computer systems, and servers can be described in the general context of computer system executable instructions (such as program modules) executed by a computer system. Typically, program modules can include routines, programs, object programs, components, logic, data structures, etc., which perform specific tasks or implement specific abstract data types. Computer systems / servers can be implemented in distributed cloud computing environments, where tasks are executed by remote processing devices linked through communication networks. In distributed cloud computing environments, program modules can reside on local or remote computing system storage media, including storage devices.

[0102] Exemplary methods

[0103] Figure 1 This is a flowchart illustrating a method for real-time calculation of zoned and stratified carbon emission flows for provincial power grids, provided by an exemplary embodiment of the present invention. This embodiment can be applied to electronic devices, such as… Figure 1 As shown, the real-time calculation method 100 for zoned and stratified carbon emission flows for provincial power grids includes the following steps:

[0104] Step 101: Obtain real-time data of the provincial power grid and perform AC steady-state power flow calculation based on the real-time data to obtain the active power distribution and active power loss of each branch of the system.

[0105] Step 102: Based on the active power distribution of the branches, and according to the power flow direction in each branch, use graph theory to search for and identify the ring network in the provincial power grid.

[0106] Step 103: Perform equivalent processing on the identified ring network to convert the provincial power grid into a ring-free network;

[0107] Step 104: Transform the acyclic network topology into a graph model based on balanced partitioning, and use graph theory methods to perform topological sorting on all network nodes within the partition to obtain the node order set;

[0108] Step 105: Based on the node sequence set and according to the preset carbon emission allocation principle, starting from the generator source side, carbon emission flow is allocated layer by layer according to the upstream and downstream topology connection structure of the power grid nodes to obtain the carbon emission flow distribution of the entire system.

[0109] Specifically, to address the limitations of existing carbon emission flow analysis techniques, the present invention aims to provide a real-time calculation method for zoned and layered carbon emission flows in provincial power grids, referencing... Figure 2 As shown, the technical solution adopted in this invention includes the following steps:

[0110] S1 acquires real-time data of the provincial power grid and performs AC steady-state power flow calculations to obtain the power distribution P of each branch of the system. ijand branch power loss P ij loss The power flow distribution of each branch of the power grid obtained in step 1 is the basis for the power grid ring network identification in step 2 and the carbon emission flow layer by layer allocation in step 4, and will be further applied in the two steps.

[0111] S2 performs ring network identification and equivalent processing of the provincial power grid. Based on the power flow distribution of the power grid obtained in step 1, the ring network is identified according to the power flow direction in each branch and using graph theory. Then, the ring network is equivalently processed to transform the provincial power grid into a loop-free network.

[0112] S3 transforms the loopless power grid topology obtained in step 2 into a graph model based on balanced partitioning. Using graph theory, all network nodes within the partition are topologically sorted. The sorted node order is the basis for the layer-by-layer carbon emission allocation in step 4 and will be applied in step 4.

[0113] S4 further needs to clarify the carbon emission allocation principle and carry out the layer-by-layer allocation of carbon emissions on the source side. After clarifying the basis and principle of carbon emission allocation, starting from the generator source side, the carbon emission flow on the source side is allocated layer by layer according to the upstream and downstream topology connection structure of the power grid nodes and the node order after topology sorting, so as to obtain the carbon emission flow distribution of the entire system network.

[0114] Further, in step S1, the real-time data of the provincial power grid obtained includes the active power, reactive power, unit type, capacity, carbon capture rate, carbon content of coal, and coal consumption characteristics per kilowatt-hour provided by each generator unit, as well as the power consumption of the loads at each node of the system. Relevant technical parameters include the technical parameters and operating status of lines, transformers, and switching equipment. After clarifying the input conditions and parameters, the AC steady-state power flow calculation of the provincial power grid is further performed. For an n-node power system, the active and reactive power flow balance equations for each node are:

[0115]

[0116] Among them, P Gi Q Gi P represents the active power and reactive power injected into generator set at node i, respectively. Li Q Li G represents the active and reactive power consumed by the load at node i, respectively. ij B ij Let δ represent the amplitudes of the conductance and susceptance of branch ij, respectively, and U represent the amplitude of the node voltage. ij For the voltage angle δ at node i i and node j voltage angle δ j angular difference, i.e. δ ij =δ i -δ j .

[0117] The voltage amplitude V at each node of the system can be obtained by using the Newton-Raphson method. i Angle δ i Subsequently, the real-time (at a certain power flow section) AC steady-state power flow distribution of the provincial power grid can be calculated, that is, the active power distribution P of each branch. ij and branch active power loss P ij loss They are respectively:

[0118] P ij =V i V j (G ij cosδ ij +B ij sinδ ij (3)

[0119] P ij loss =2U i U j G ij cosδ ij (4)

[0120] Among them, P ij P is the active power flowing through branch ij. ij loss Let be the active power loss of branch ij.

[0121] Furthermore, in step S2, since loop networks may exist in complex provincial power grids, meaning that the power flow from a certain node passes through a series of nodes and then returns to the initial outflow node, forming a loop, the graph theory method for carbon emission allocation may lead to a dead loop during the layer-by-layer allocation process if loop networks exist. This would prevent the smooth allocation of carbon emissions from the source side to the system network side and the load side. Therefore, it is necessary to search for and identify loop networks in the provincial power grid and perform further equivalent processing.

[0122] Ring network identification in provincial power grids employs graph theory search. By searching for feasible connectivity paths among the network nodes, it determines whether a path from the starting node back to the starting node exists, thus identifying whether a ring network exists within the provincial power grid. If a ring network exists, the connecting nodes constituting that ring network are output. The graph theory ring network search and identification process is as follows: Figure 3 As shown, it includes:

[0123] S201 process algorithm initialization: Input the provincial power grid structure stored in the adjacency matrix, and input the starting node K (K=1) for the search.

[0124] S202 searches for all downstream nodes adjacent to node K, forming a node set.

[0125] S203 Determine if the node set contains the same node as the current path. If it does, it means there is a loop in the system network. After adding the duplicate node to the end of the path, the network loop is formed and saved. At the same time, the duplicate node is deleted from the node set.

[0126] If S204 does not exist, then any one of the nodes is randomly selected and added to the end of the current path, and the node is removed from the set. The new end node is used as the starting node for continuing the search, and the downstream adjacent nodes of the node are searched to form the intermediate adjacent node set.

[0127] S205 Determine if the intermediate node set is empty. If it is not empty, return to step S203; otherwise, proceed to step S206.

[0128] S206 Return to the previous node set and determine if it is the initial node set. If it is the initial node set and the set is empty, it means that the cycle search of node K is complete, and proceed to step S207; otherwise, return to step S204 to continue the loop search to identify the cycle of node K.

[0129] S207 determines whether the value of node K is equal to the total number of nodes in the system network. If it is equal, it indicates that the ring network identification and search of all nodes in the network is complete and a ring network exists. Then, the saved connection information of all ring network nodes is output and the process ends. Otherwise, K = K + 1 is set, and the process returns to step S202 to continue the loop search and identification of the next network node's loop information.

[0130] Furthermore, equivalent processing of the ring network is required: After identifying and searching all nodes of the provincial power grid, if nodes constitute a ring network, the ring network needs to be equivalently processed. The ring network nodes and the network branches connecting them are equivalent to a generalized bus node. The generator power flowing into each node in the ring network is equivalent to the generator power flowing into the equivalent bus node. Its equivalent injected carbon flow rate is obtained by summing the carbon flow rates injected into each node by each generator in the ring network. At the same time, the load power of each node in the ring network is equivalent to an equivalent load power added to the bus node. Its allocated carbon emission flow is obtained based on the source-side carbon emission allocation. After equivalence, the connecting branches of the generalized bus node and the provincial power grid and the power flow flow are the same as before equivalence. The connecting branches are the cut set branches of the ring network.

[0131] Furthermore, in step S3, the provincial loop-free power network is divided into balanced regions. The power grid structure within each balanced region can be abstracted as a graph model, and the provincial power grid structure is stored and represented using an adjacency matrix H. For a weighted directed graph G = (V, E) with n nodes, its adjacency matrix H is an n×n square matrix, where the matrix elements H mn This indicates the existence of a slave node v. m to v nThe edge, H mn The size represents the weight of the edge. If node v m to v n If there is no connecting edge between them, then H mn =0, specifically, the main diagonal element H. nn =0. After storing the power grid structure using an adjacency matrix, it is necessary to perform topological sorting on all nodes of the power grid within the equilibrium zone using graph theory methods to obtain a linear sequence S of all power grid nodes within the zone. The purpose of topological sorting is to ensure that all upstream nodes of any given node are ordered before that node. The linear sequence of nodes obtained through topological sorting is the same as the allocation order of each node in the carbon flow allocation process. The flowchart of node topological sorting in step S3 is as follows. Figure 4 As shown, it includes:

[0132] S301 process initialization, input the graph model G stored in the adjacency matrix;

[0133] S302 Determine whether graph G is empty. If graph G is not empty, proceed to step S303; if graph G is empty, proceed to step S307.

[0134] S303 searches for nodes in the graph with zero in-degree and stores the nodes with zero in-degree in the node set S in sequence.

[0135] After storing the nodes with an in-degree of zero into the node set, S304 searches for downstream adjacent nodes directly connected to the node based on the network topology.

[0136] S305 directly deletes nodes with an in-degree of zero and their downstream outgoing branches in graph G, and reduces the in-degree of the downstream adjacent nodes found by 1.

[0137] S306 Update graph G and return to step S302, cyclically executing the search, sorting, and deletion processes for nodes with an in-degree of zero.

[0138] If S307 determines that graph G is empty, it means that all nodes in the graph have been stored in the node set in the order of their in-degree being zero. The topological sorting of the nodes is complete. Output the node set S, and the topological sorting process ends.

[0139] Furthermore, in step S4, the principle for allocating carbon emissions from the source side to the load side is based on the principle of "shared bus concentration, proportional allocation to branches." For a given bus node, the "carbon content" of the active power flowing into each branch is first thoroughly mixed and homogenized at that bus node to achieve the same "node carbon concentration" before flowing out. Then, the "total carbon content" collected by that bus will be allocated to each outflowing branch according to the proportion of its outflowing active power, using the same "node carbon concentration." Figure 5 As shown.

[0140] The carbon content R of branches a and b flowing into the bus node a R b After thorough mixing at the busbar node, the carbon content R in the downstream outflowing branches c and d is... c R d The power is distributed according to the proportion of the active power flowing through branches c and d in the total power flowing through the node, and the calculation formula is as follows:

[0141]

[0142] The power flowing through the bus node can be represented by P. N This means that the power flowing through a node is equal to the sum of the power of all branches flowing into that node from its upstream side, and also equal to the sum of the power of all branches flowing out of that node from its downstream side, i.e., P. N =P a +P b =P c +P d .

[0143] Furthermore, the branch network loss power is equivalently added to the branch starting node and regarded as virtual load power, such as... Figure 6 As shown, the formula for calculating the carbon content corresponding to the network loss of the downstream branch of the bus node is:

[0144]

[0145] Where, ΔR cL loss ΔR dL loss Let ΔP represent the network loss carbon flow rates of downstream branches c and d, respectively. cL loss ΔP dL loss These represent the branch power losses of downstream branches c and d, respectively. R in the figure... c ′、R d ′ represent the carbon flow rate corresponding to the active power at the end of the downstream branch c and branch d, respectively.

[0146] Furthermore, in step S4, after clarifying the basic principles of carbon emission allocation, carbon emissions from the source side are allocated layer by layer to the load side, as shown in the flowchart below. Figure 7 As shown, it includes the following steps:

[0147] After inputting the relevant technical parameters of the provincial power grid, S401 first calculates the real-time carbon injection rate R of each generator unit within the balance zone of the provincial power grid. Gi Based on the current operating status and real-time power output of each generator unit, the coal consumption per kilowatt-hour (W) of each coal-fired unit can be obtained.i The calculation formula is as follows:

[0148] w i =(a i P Gi 2 +b i P Gi +c i )ζ i / P Gi

[0149] In the formula, a i b i c i These are the characteristic parameters of the unit's i-kWh coal consumption curve, ζ i This is a correction factor, which is related to the unit's operating status. Under normal conditions, it is taken as 1.0, P Gi This refers to the real-time active power output of unit i.

[0150] Furthermore, the carbon emission intensity E of coal-fired power units Gi The calculation formula is:

[0151]

[0152] In the formula, η i ξ represents the carbon content of the coal burned by unit i. i The oxidation rate of coal in unit i is generally taken as 98%, μ i For carbon capture rate, w i The coal consumption per kilowatt-hour calculated above, M C These are the molar masses of carbon dioxide and carbon, respectively.

[0153] Furthermore, the real-time carbon injection rate R of each generator unit within the balance zone is... Gi The calculation formula is:

[0154] R Gi =P Gi E Gi (11)

[0155] Based on the obtained node sequence set S, S402 visits the k-th level node in the node set (k is initially set to 1) and calculates the total injected carbon flow rate ∑R of the current node. k in Then, perform a breadth-first search on the k-th level node to search for its directly adjacent lower-level vertices.

[0156] The breadth-first search (BFS) process in graph theory involves starting from the initial vertex n0 in graph G and searching for all unvisited vertices n1, n2...n adjacent to vertex n0. tAs the second layer, then sequentially search the vertices n1, n2...n of the second layer. t All unvisited adjacent vertices are treated as the third layer, and this process continues layer by layer until all vertices in the graph have been traversed. The characteristic of breadth-first search is that it starts from the initial vertex and searches neighboring vertices as widely as possible in a radial manner, covering the entire network topology. For example... Figure 8 As shown, this is a 9-node graph model network. Starting from the initial node A, the search order of each node using breadth-first search is A→BDE→CG→FH→I.

[0157] After obtaining the downstream neighboring nodes of the current node through breadth-first search, S403 allocates carbon emission flow according to the allocation principle at the load of the current node and in the connection branch between the current node and the downstream neighboring node, thus obtaining the carbon flow allocation results of the system network branches and the load side.

[0158] Wherein, the carbon flow rate R distributed across the load at node k Lk The calculation formula is:

[0159]

[0160] In the formula, P Lk P represents the active power of the load at node k. Nk This represents the power flowing through node k. This represents the sum of carbon flows into node k.

[0161] Among them, the carbon flow rate R allocated in branch ij ij The calculation formula is:

[0162]

[0163] In the formula, P ij P represents the active power in branch ij. Ni This represents the power flowing through the starting node i of branch ij. This represents the sum of carbon flows into the starting node i of branch ij.

[0164] Among them, the branch network loss carbon flow rate R corresponding to the power loss in branch ij ij loss The calculation formula is:

[0165]

[0166] In the formula, P ij loss This represents the active power loss in branch ij.

[0167] S404 determines whether all nodes in the node set have been sequentially polled, i.e., k is less than the total number of nodes N in graph G.G If yes, then let k = k + 1 and return to step S402; otherwise, it indicates that the carbon emission allocation within the region is complete, output the result, and the process ends.

[0168] Based on the steps described above, it is possible to finally realize the real-time allocation calculation of carbon emission flows in the regional and hierarchical areas of the provincial power grid, clarify the physical process of carbon emission allocation in the regional power grid and the distribution of carbon emission flows across the entire network.

[0169] To visually demonstrate the feasibility and effectiveness of the aforementioned method for real-time calculation of zoned and stratified carbon emission flows, a small system with a ring network within a certain equilibrium zone is used as an example for implementation analysis and verification. After acquiring real-time data of the system network at a certain moment, AC power flow calculation is performed to obtain the steady-state AC power flow distribution map of that power flow section of the system, as shown below. Figure 9 As shown.

[0170] Next, using the ring network search and identification method designed in step 2, the ring network nodes in the system are searched sequentially, and the ring network is output. During the process of searching for feasible connectivity paths between nodes, it can be observed that starting from node 4, after passing through nodes 7 and 9, the system power flow returns to the starting node 4. Therefore, nodes 4-7-9 constitute a ring network in the system. Further, an equivalent processing of this ring network needs to be implemented. The newly added generalized bus node after the equivalent processing is defined as node 15. The steady-state power flow distribution diagram of the system after the ring network equivalent processing is as follows: Figure 10 As shown, the connection branches between the equivalent generalized bus node and the system are the cut set branches connecting the ring network and the system before the equivalence. The node power conservation of each node in the system before and after the equivalence is still satisfied.

[0171] Transform the equivalent steady-state power flow distribution diagram of the ring network into Figure 11 After the weighted directed graph shown, an adjacency matrix is ​​formed, and the node topology sorting method designed in step 3 is used to realize the topology sorting of all nodes in the equivalent ringless power grid, which prepares for the next step of stratified carbon emission flow allocation. The node order obtained after topology sorting is 1-8-2-5-6-15-3-11-12-13-10-14. The linear sequence of nodes obtained by topology sorting is the same as the allocation order of nodes in the stratified carbon flow allocation process.

[0172] Further, based on the calculation formulas for the carbon emission intensity of the generator units in step 4, equations (9) and (10), and combined with the current operating status and power output of each generator unit and other relevant technical parameters (the characteristic parameters of each unit are shown in Table 1), the carbon emission intensity of each generator unit on the generator side and the carbon flow rate of the injected system can be calculated, as shown in Table 2.

[0173] Table 1 Unit Characteristic Parameters

[0174]

[0175] Table 2 Carbon emission intensity of each unit and carbon flow rate of the injection system

[0176]

[0177]

[0178] After calculating the carbon flow rate of each unit injected into the system, a breadth-first search is performed on the sorted nodes according to the node order after topological sorting. Based on the allocation principle and the allocation formula (12), (13), and (14), after the lower-level adjacent nodes of the node are found, the branch carbon flow rate allocated in the connecting branch and the load carbon flow rate allocated at the node load are calculated. This allocation process has the characteristic of allocating carbon emissions from the power generation side to the downstream branches and loads layer by layer. The resulting system layer allocation process and results are shown in Figure 12.

[0179] exist Figure 12 In the diagram, numbers 1-15 represent the bus nodes in the system. Nodes at the same level and their downstream carbon emission branches are highlighted with the same color. The connecting branches between nodes include the direction of carbon emission flow and the magnitude of carbon emission flow within the branch. The difference in carbon emission flow between the beginning and end of a branch represents the branch network loss carbon emission corresponding to the branch power loss. Additionally, the downward arrows at each node indicate the load carbon emission allocated to that node's load. The carbon emission flow allocation in the diagram starts from the generator nodes on the power generation side and proceeds downstream in a layered allocation to the network branches. The allocation order for each node in this layered allocation process is as follows: Level 1 nodes 1 and 8; Level 2 node 2; Level 3 node 5; Level 4 nodes 6 and 15; Level 5 nodes 3, 11, and 12; Level 6 nodes 10 and 13; Level 7 node 14. For visual clarity, the carbon emission flow allocated to each node and its downstream branches is highlighted with different colors.

[0180] Figure 13 This invention compares the carbon emission allocation results at each node load using the graph theory-based hierarchical allocation method and the average electrical carbon emission factor method. The average electrical carbon emission factor for this system region is calculated based on the average ratio of the carbon flow rate injected into the system by each unit within the region to the active power output of each unit. The average electrical carbon emission factor for this region is 0.6090 tCO2 / (MW·h), and the carbon flow rate allocated to each node load is obtained using this average electrical carbon emission factor. Figure 12As can be seen, due to the installation of carbon capture devices in node unit G3, its carbon emission intensity is significantly reduced, far below the system average. However, the carbon emission allocation result obtained by using the average electrical carbon emission factor method is much higher than the actual situation, which in turn leads to the carbon emission allocation result of other nodes being slightly lower than the actual situation. The carbon emission allocation result is relatively coarse. The allocation result of the graph theory hierarchical allocation method is more in line with the actual situation, and can also reflect the difference in carbon emission allocation results on the load side due to time and space differences, with higher allocation accuracy.

[0181] The calculation analysis and results of the above embodiments verify the feasibility and effectiveness of the real-time carbon emission calculation method proposed in this invention. The allocation results are more accurate, and the allocation process is more interpretable and demonstrative. It can provide a basis for the division of carbon emission reduction responsibilities in the power system, and further provide a reference for the visualization of carbon emission flows in the system. It has certain guiding significance and practical value.

[0182] Therefore, the real-time calculation method for grid-regional and hierarchical carbon emission flows proposed in this invention utilizes real-time carbon emission data from the generation side and combines it with the characteristics of system carbon emission flows accompanying power flow. This solves the problems of insufficient accuracy in indirect carbon emission allocation on the load side by the average electric carbon emission factor method, and its inability to reflect the spatiotemporal differences in load-side carbon emission allocation. Compared with the average electric carbon emission factor method, it has higher allocation accuracy and more accurate results. Simultaneously, this invention uses graph theory to achieve layer-by-layer allocation of carbon emission flows in the provincial power grid starting from the carbon emission sources on the generation side. This solves the problem that current carbon flow analysis methods cannot reflect the characteristics of system carbon emission flows accompanying power flow. Compared with current carbon emission allocation and carbon flow tracking methods, the load-side carbon emission allocation results obtained are more interpretable and have certain theoretical significance and practical value.

[0183] Exemplary device

[0184] Figure 14 This is a schematic diagram of the structure of a real-time calculation device for zoned and hierarchical carbon emission flows for provincial power grids, provided in an exemplary embodiment of the present invention. Figure 14 As shown, the device 1400 includes:

[0185] The calculation module 1410 is used to acquire real-time data of the provincial power grid and perform AC steady-state power flow calculation based on the real-time data to obtain the active power distribution and active power loss of each branch of the system.

[0186] The identification module 1420 is used to search for and identify ring networks in the provincial power grid based on the active power distribution of branches and the power flow direction in each branch, using graph theory methods.

[0187] Equivalent module 1430 is used to perform equivalent processing on the identified ring network, and to convert the provincial power grid into a ringless network.

[0188] The sorting module 1440 is used to transform the acyclic network topology into a graph model based on balanced partitioning, and to use graph theory methods to perform topological sorting on all network nodes within the partition to obtain a node order set.

[0189] The carbon emission distribution module 1450 is used to distribute carbon emission flows layer by layer based on the node sequence set and according to the preset carbon emission distribution principle, starting from the generator source side and according to the upstream and downstream topology connection structure of the power grid nodes, to obtain the carbon emission flow distribution of the entire system.

[0190] Optionally, the computing module 1410 includes:

[0191] The first calculation submodule is used to perform AC steady-state power flow calculation on the provincial power grid based on real-time data of the provincial power grid, and obtain the balance equations of active power flow and reactive power flow at the nodes. The real-time data of the provincial power grid includes any combination of the following data: active power, reactive power, unit type, capacity, carbon capture rate, carbon content of coal, and coal consumption characteristics per kilowatt-hour, as well as the power consumption of the load at each node of the system.

[0192] The solver submodule is used to solve the equilibrium equations using the Newton-Raphson method to obtain the voltage magnitude and angle of each node in the system.

[0193] The second calculation submodule is used to calculate the active power distribution and active power loss of each branch of the provincial power grid based on the voltage amplitude and angle of each node in the system.

[0194] Optionally, the balance equations for active power flow and reactive power flow at the nodes are:

[0195]

[0196] Among them, P Gi Q Gi P represents the active power and reactive power injected into generator set at node i, respectively. Li Q Li G represents the active and reactive power consumed by the load at node i, respectively. ij B ij U represents the amplitudes of the conductance and susceptance of branch ij, respectively. i U j Let δ be the node voltage magnitudes of nodes i and j. ij For the voltage angle δ at node i i and node j voltage angle δ j angular difference, i.e. δ ij =δ i -δ j ;

[0197] The calculation expressions for active power distribution and branch active power loss are as follows:

[0198] P ij =V i V j (G ij cosδ ij +B ij sinδ ij )

[0199] P ij loss =2U i U j G ij cosδ ij

[0200] In the formula, P ij P is the active power flowing through branch ij. ij loss Let be the active power loss of branch ij.

[0201] Optionally, the identification module 1420 includes:

[0202] Step 1: Initialize the process algorithm, input the provincial power grid structure stored in the adjacency matrix, and input the starting node K (K=1) for the search;

[0203] Step 2: Search for all downstream nodes adjacent to node K to form a node set;

[0204] Step 3: Determine whether the node set contains the same node as the current path. If it does, add the duplicate node to the end of the path to form a network loop and save it. At the same time, delete the duplicate node from the node set.

[0205] Step 4: If it does not exist, take any node and add it to the end of the current path, remove the node from the set, use the new end node as the starting node for the search, and continue to search for the downstream adjacent nodes of the node to form the intermediate adjacent node set.

[0206] Step 5: Determine if the intermediate node set is empty. If it is not empty, return to step 3; otherwise, proceed to step 6.

[0207] Step 6: Return to the previous node set and determine if it is the initial node set. If it is the initial node set and the set is empty, it means that the cycle search of node K is complete, and proceed to step 7; otherwise, return to step 4 to continue the loop search to identify the cycle of node K.

[0208] Step 7: Determine if the value of node K is equal to the total number of nodes in the system network. If it is equal, it indicates that the ring network identification and search of all nodes in the network is complete and a ring network exists. Then output the saved connection information of all ring network nodes and the process ends. Otherwise, let K = K + 1 and return to step 2 to continue the loop search and identification of the next network node.

[0209] Optionally, the equivalent module 1430 includes:

[0210] The first equivalent submodule is used to convert the ring network nodes and the network branches connected between them into a generalized bus node. The generator power flowing into each node in the ring network is equivalent to the generator power flowing into the equivalent bus node. Its equivalent injected carbon flow rate is obtained by summing the carbon flow rates injected into each node by each generator in the ring network.

[0211] The second equivalent submodule is used to convert the load power of each node in the ring network into an equivalent load power added to the bus node. The carbon emission flow allocated to it is obtained based on the carbon emission allocation on the source side. After the equivalence, the connection branch between the generalized bus node and the provincial power grid and the power flow are the same as before the equivalence. The connecting branch is the cut set branch of the ring network, forming a ringless network.

[0212] Optionally, the sorting module 1440 includes:

[0213] Step 1: Process initialization, input the graph model G stored in the adjacency matrix;

[0214] Step 2: Determine if graph G is empty. If graph G is not empty, proceed to step 3; if graph G is empty, proceed to step 7.

[0215] Step 3: Search for nodes in the graph with zero in-degree and store the nodes with zero in-degree in the node set S in sequence;

[0216] Step 4: After storing the nodes with an in-degree of zero into the node set, search for the downstream neighboring nodes directly connected to the node according to the network topology.

[0217] Step 5: In graph G, directly delete the node with an in-degree of zero and its downstream outgoing branch, and reduce the in-degree of the downstream adjacent nodes by 1.

[0218] Step 6: Update graph G and return to step 2, and repeat the process of searching, sorting and deleting nodes with an in-degree of zero.

[0219] Step 7: If the graph G is empty after the judgment, it means that all nodes in the graph have been stored in the node set in the order of their in-degree being zero. The topological sorting of the nodes is completed. Output the node set S. The topological sorting process ends and the node order set is obtained.

[0220] Optionally, the sharing module 1450 includes:

[0221] Step 1: Input the relevant technical parameters of the provincial power grid and calculate the real-time carbon injection rate of each generator unit in the balance zone of the provincial power grid. The relevant technical parameters include the technical parameters and operating status of the lines, transformers, and switchgear.

[0222] Step 2: Based on the obtained node sequence set S, visit the k-th level node in the node set, with k initially set to 1, and calculate the total injected carbon flow rate ∑R of the current node. k in And perform a breadth-first search on the k-th level node to search for its directly adjacent lower-level vertices;

[0223] Step 3: After obtaining the downstream neighboring nodes of the current node through breadth-first search, carbon emission flow is allocated according to the allocation principle at the load of the current node and in the connection branch between the current node and the downstream neighboring node, so as to obtain the carbon flow allocation results of the system network branch and the load side.

[0224] Step 4: Determine whether all nodes in the node set have been sequentially polled, i.e., k is less than the total number of nodes N in graph G. G If yes, then let k = k + 1 and return to step 2; otherwise, it indicates that the carbon emission allocation within the region is complete, the process ends, and the carbon emission flow distribution of the entire system network is obtained.

[0225] Optionally, input relevant technical parameters of the provincial power grid to calculate the real-time carbon injection rate of each generator unit within the provincial power grid balance zone, including:

[0226] Based on the current operating status and real-time power output of each generator unit, the coal consumption per kilowatt-hour (W) of each coal-fired unit can be obtained. i The calculation formula is as follows:

[0227] w i =( a iP Gi 2 +b i P Gi +c i )ζ i / P Gi

[0228] In the formula, a i b i c i These are the characteristic parameters of the unit's i-kWh coal consumption curve, ζ i This is a correction factor, which is related to the unit's operating status. Under normal conditions, it is taken as 1.0, P Gi The real-time active power output of unit i;

[0229] According to the coal consumption per kilowatt-hour of each coal-fired unit i Calculate the carbon emission intensity E of coal-fired power units Gi The calculation formula is as follows:

[0230]

[0231] In the formula, η i ξ represents the carbon content of the coal burned by unit i. i The oxidation rate of coal in unit i is generally taken as 98%, μ i For carbon capture rate, w i The coal consumption per kilowatt-hour calculated above, M C These are the molar masses of carbon dioxide and carbon, respectively.

[0232] According to the carbon emission intensity E Gi Calculate the real-time carbon injection rate R of each generator unit within the equilibrium zone. Gi Its calculation formula is: R Gi =P Gi E Gi .

[0233] Optionally, the carbon flow allocation results include:

[0234] Carbon flow rate P distributed across the load at node k Lk The calculation formula is:

[0235]

[0236] In the formula, P Lk P represents the active power of the load at node k. Nk This represents the power flowing through node k. This represents the sum of carbon flows into node k;

[0237] Carbon flow rate R distributed in branch ij ij The calculation formula is:

[0238]

[0239] In the formula, P ij P represents the active power in branch ij. Ni This represents the power flowing through the starting node i of branch ij. This represents the sum of carbon flows into the starting node i of branch ij;

[0240] The branch network loss carbon flow rate R corresponding to the power loss in branch ij ij loss The calculation formula is:

[0241]

[0242] In the formula, P ij loss This represents the active power loss in branch ij.

[0243] Exemplary electronic devices

[0244] Figure 15 This is the structure of an electronic device provided in an exemplary embodiment of the present invention. For example... Figure 15 As shown, the electronic device 150 includes one or more processors 151 and memory 152.

[0245] The processor 151 may be a central processing unit (CPU) or other form of processing unit with data processing capabilities and / or instruction execution capabilities, and may control other components in the electronic device to perform desired functions.

[0246] Memory 152 may include one or more computer program products, which may include various forms of computer-readable storage media, such as volatile memory and / or non-volatile memory. The volatile memory may include, for example, random access memory (RAM) and / or cache memory. The non-volatile memory may include, for example, read-only memory (ROM), hard disk, flash memory, etc. One or more computer program instructions may be stored on the computer-readable storage medium, and processor 151 may execute the program instructions to implement the methods of the software programs of the various embodiments of the present invention described above, and / or other desired functions. In one example, the electronic device may also include an input device 153 and an output device 154, these components being interconnected via a bus system and / or other forms of connection mechanisms (not shown).

[0247] In addition, the input device 153 may also include, for example, a keyboard, a mouse, etc.

[0248] The output device 154 can output various information to the outside. The output device 154 may include, for example, a display, a speaker, a printer, and a communication network and its connected remote output devices, etc.

[0249] Of course, for the sake of simplicity, Figure 15 Only some of the components of this electronic device relevant to the present invention are shown, omitting components such as buses, input / output interfaces, etc. In addition, the electronic device may include any other suitable components depending on the specific application.

[0250] Exemplary computer program products and computer-readable storage media

[0251] In addition to the methods and apparatus described above, embodiments of the present invention may also be computer program products, which include computer program instructions that, when executed by a processor, cause the processor to perform the steps in the methods according to various embodiments of the present invention described in the "Exemplary Methods" section above.

[0252] The computer program product can be written in any combination of one or more programming languages ​​to perform the operations of the embodiments of the present invention. The programming languages ​​include object-oriented programming languages ​​such as Java and C++, as well as conventional procedural programming languages ​​such as C or similar languages. The program code can be executed entirely on the user's computing device, partially on the user's computing device, as a standalone software package, partially on the user's computing device and partially on a remote computing device, or entirely on a remote computing device or server.

[0253] Furthermore, embodiments of the present invention may also be computer-readable storage media storing computer program instructions thereon, which, when executed by a processor, cause the processor to perform the steps of the methods according to various embodiments of the present invention described in the "Exemplary Methods" section above.

[0254] The computer-readable storage medium may be any combination of one or more readable media. A readable medium may be a readable signal medium or a readable storage medium. A readable storage medium may be, for example, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, device, or any combination thereof. More specific examples (a non-exhaustive list) of readable storage media include: an electrical connection having one or more wires, a portable disk, a hard disk, random access memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM or flash memory), optical fiber, portable compact disk read-only memory (CD-ROM), optical storage device, magnetic storage device, or any suitable combination thereof.

[0255] The basic principles of the present invention have been described above with reference to specific embodiments. However, it should be noted that the advantages, benefits, and effects mentioned in the present invention are merely examples and not limitations, and should not be considered as essential features of each embodiment of the present invention. Furthermore, the specific details disclosed above are for illustrative and facilitative purposes only, and are not limitations. These details do not limit the present invention to the necessity of employing the aforementioned specific details.

[0256] The various embodiments in this specification are described in a progressive manner, with each embodiment focusing on its differences from other embodiments. Similar or identical parts between embodiments can be referred to interchangeably. For system embodiments, since they largely correspond to method embodiments, the description is relatively simple; relevant parts can be referred to the descriptions in the method embodiments.

[0257] The block diagrams of devices, systems, devices, and systems involved in this invention are merely illustrative examples and are not intended to require or imply that they must be connected, arranged, or configured in the manner shown in the block diagrams. As those skilled in the art will recognize, these devices, systems, devices, and systems can be connected, arranged, and configured in any manner. Words such as “comprising,” “including,” “having,” etc., are open-ended terms meaning “including but not limited to,” and are used interchangeably with them. The terms “or” and “and” as used herein refer to the terms “and / or,” and are used interchangeably with them unless the context clearly indicates otherwise. The term “such as” as used herein refers to the phrase “such as but not limited to,” and is used interchangeably with it.

[0258] The methods and systems of the present invention may be implemented in many ways. For example, they may be implemented by software, hardware, firmware, or any combination of software, hardware, and firmware. The above-described order of steps for the methods is for illustrative purposes only, and the steps of the methods of the present invention are not limited to the order specifically described above unless otherwise specifically stated. Furthermore, in some embodiments, the present invention may also be implemented as a program recorded on a recording medium, the program comprising machine-readable instructions for implementing the methods according to the present invention. Thus, the present invention also covers recording media storing programs for performing the methods according to the present invention.

[0259] It should also be noted that in the systems, apparatus, and methods of the present invention, the components or steps can be disassembled and / or recombined. These disassemblies and / or recombinations should be considered equivalents of the present invention. The above description of the disclosed aspects is provided to enable any person skilled in the art to make or use the invention. Various modifications to these aspects will be readily apparent to those skilled in the art, and the general principles defined herein can be applied to other aspects without departing from the scope of the invention. Therefore, the invention is not intended to be limited to the aspects shown herein, but rather to be carried out within the widest scope consistent with the principles and novel features disclosed herein.

[0260] The above description has been given for purposes of illustration and description. Furthermore, this description is not intended to limit the embodiments of the invention to the forms disclosed herein. Although numerous exemplary aspects and embodiments have been discussed above, those skilled in the art will recognize certain variations, modifications, alterations, additions, and sub-combinations thereof.

Claims

1. A method for real-time calculation of zoned and stratified carbon emission flows for provincial power grids, characterized in that, include: Real-time data of the provincial power grid is acquired, and AC steady-state power flow calculation is performed based on the real-time data to obtain the active power distribution and active power loss of each branch of the system. Based on the active power distribution of the branches, and according to the power flow direction in each branch, the graph theory method is used to search for and identify the ring network in the provincial power grid. The identified ring network is processed to convert the provincial power grid into a ring-free network. The acyclic network topology is transformed into a graph model based on balanced partitioning, and graph theory methods are used to perform topological sorting of all network nodes within the partition to obtain the node order set. Based on the node sequence set and according to the preset carbon emission allocation principle, starting from the generator source side, carbon emission flow is allocated layer by layer according to the upstream and downstream topology connection structure of the power grid nodes to obtain the carbon emission flow distribution of the entire system.

2. The method according to claim 1, characterized in that, Acquire real-time data of the provincial power grid, and perform AC steady-state power flow calculations based on the real-time data to obtain the active power distribution and active power loss of each branch of the system, including: Based on the real-time data of the provincial power grid, the AC steady-state power flow calculation of the provincial power grid is performed to obtain the balance equations of active power flow and reactive power flow at the nodes. The real-time data of the provincial power grid includes any combination of the following data: active power, reactive power, unit type, capacity, carbon capture rate, carbon content of coal, and coal consumption characteristics per kilowatt-hour, as well as the power consumption of the load at each node of the system. The Newton-Raphson method was used to solve the equilibrium equations to obtain the voltage amplitude and angle at each node of the system. Based on the voltage amplitude and angle of each node in the system, the active power distribution and active power loss of each branch of the provincial power grid are calculated.

3. The method according to claim 2, characterized in that, The balance equations for the active power flow and reactive power flow at the node are as follows: Among them, P Gi Q Gi P represents the active power and reactive power injected into generator set at node i, respectively. Li Q Li G represents the active and reactive power consumed by the load at node i, respectively. ij B ij U represents the amplitude of the conductance and susceptance of branch ij, respectively. i U j Let δ be the node voltage magnitudes of nodes i and j. ij For the voltage angle δ at node i i and node j voltage angle δ j The angle difference, i.e., δ ij =δ i -δ j ; The calculation expressions for the active power distribution and branch active power loss are as follows: P ij =V i V j (G ij cosδ ij +B ij sinδ ij ) P ij loss =2U i U j G ij cosδ ij In the formula, P ij P represents the active power flowing through branch ij. ij loss Let be the active power loss of branch ij.

4. The method according to claim 1, characterized in that, Based on the active power distribution of the branches, and according to the power flow direction in each branch, a graph theory method is used to search for and identify ring networks in the provincial power grid, including: Step 1: Initialize the process algorithm, input the provincial power grid structure stored in the adjacency matrix, and input the starting node K (K=1) for the search; Step 2: Search for all downstream nodes adjacent to node K to form a node set; Step 3: Determine whether the node set contains the same node as the current path. If it does, add the duplicate node to the end of the path to form a network loop and save it. At the same time, delete the duplicate node from the node set. Step 4: If it does not exist, take any node and add it to the end of the current path, remove the node from the set, use the new end node as the starting node for the search, and continue to search for the downstream adjacent nodes of the node to form the intermediate adjacent node set. Step 5: Determine if the intermediate node set is empty. If it is not empty, return to step 3; otherwise, proceed to step 6. Step 6: Return to the previous node set and determine if it is the initial node set. If it is the initial node set and the set is empty, it means that the cycle search of node K is complete, and proceed to step 7; otherwise, return to step 4 to continue the loop search to identify the cycle of node K. Step 7: Determine if the value of node K is equal to the total number of nodes in the system network. If it is equal, it indicates that the ring network identification and search of all nodes in the network is complete and a ring network exists. Then output the saved connection information of all ring network nodes and the process ends. Otherwise, let K = K + 1 and return to step 2 to continue the loop search and identification of the next network node.

5. The method according to claim 1, characterized in that, The identified ring network is then processed to convert the provincial power grid into a loop-free network, including: The ring network nodes and the network branches connecting them are equivalent to a generalized bus node. The generator power flowing into each node in the ring network is equivalent to the generator power flowing into this equivalent bus node. Its equivalent injected carbon flow rate is obtained by summing the carbon flow rates injected into each node by each generator in the ring network. The load power of each node in the ring network is equivalent to an equivalent load power added to the bus node. The carbon emission flow allocated to it is obtained based on the carbon emission allocation on the source side. After the equivalence, the connection branch between the generalized bus node and the provincial power grid and the power flow are the same as before the equivalence. The connecting branch is the cut set branch of the ring network, forming the ringless network.

6. The method according to claim 1, characterized in that, The acyclic network topology is transformed into a graph model based on balanced partitioning, and graph theory methods are used to perform topological sorting of all network nodes within the partition, resulting in a node order set, including: Step 1: Process initialization, input the graph model G stored in the adjacency matrix; Step 2: Determine if graph G is empty. If graph G is not empty, proceed to step 3; if graph G is empty, proceed to step 7. Step 3: Search for nodes in the graph with zero in-degree and store the nodes with zero in-degree in the node set S in sequence; Step 4: After storing the nodes with an in-degree of zero into the node set, search for the downstream neighboring nodes directly connected to the node according to the network topology. Step 5: In graph G, directly delete the node with an in-degree of zero and its downstream outgoing branch, and reduce the in-degree of the downstream adjacent nodes by 1. Step 6: Update graph G and return to step 2, and repeat the process of searching, sorting and deleting nodes with an in-degree of zero. Step 7: If the graph G is found to be empty after the judgment, it means that all nodes in the graph have been stored in the node set in the order of their in-degree being zero. The topological sorting of the nodes is completed. Output the node set S. The topological sorting process ends and the node order set is obtained.

7. The method according to claim 1, characterized in that, Based on the node sequence set and according to the preset carbon emission allocation principle, starting from the generator source side, carbon emission flows are allocated layer by layer according to the upstream and downstream topology of the power grid nodes to obtain the carbon emission flow distribution of the entire system, including: Step 1: Input the relevant technical parameters of the provincial power grid and calculate the real-time carbon injection rate of each generator unit in the balance zone of the provincial power grid. The relevant technical parameters include the technical parameters and operating status of the lines, transformers, and switching equipment. Step 2: Based on the obtained node sequence set S, visit the k-th level node in the node set, with k initially set to 1, and calculate the total injected carbon flow rate ΣR of the current node. k in And perform a breadth-first search on the k-th level node to search for its directly adjacent lower-level vertices; Step 3: After obtaining the downstream neighboring nodes of the current node through breadth-first search, carbon emission flow is allocated according to the allocation principle at the load of the current node and in the connection branch between the current node and the downstream neighboring node, so as to obtain the carbon flow allocation results of the system network branch and the load side. Step 4: Determine whether all nodes in the node set have been sequentially polled, i.e., k is less than the total number of nodes N in graph G. G If yes, then let k = k + 1 and return to step 2; otherwise, it indicates that the carbon emission allocation within the region is complete, the process ends, and the carbon emission flow distribution of the entire system network is obtained.

8. The method according to claim 7, characterized in that, Input relevant technical parameters of the provincial power grid and calculate the real-time carbon injection rate of each generator unit within the balance zone of the provincial power grid, including: Based on the current operating status and real-time power output of each generator unit, the coal consumption per kilowatt-hour (W) of each coal-fired unit can be obtained. i The calculation formula is as follows: w i =(a i P Gi 2 +b i P Gi +c i )ζ i / P Gi In the formula, a i b i c i These are the characteristic parameters of the unit's i-kWh coal consumption curve, ζ i This is a correction factor, which is related to the unit's operating status. Under normal conditions, it is taken as 1.0, P Gi The real-time active power output of unit i; According to the coal consumption per kilowatt-hour of each coal-fired unit i Calculate the carbon emission intensity E of coal-fired power units Gi The calculation formula is as follows: In the formula, η i ξ represents the carbon content of the coal burned by unit i. i The oxidation rate of coal in unit i is generally taken as 98%, μ i For carbon capture rate, w i The coal consumption per kilowatt-hour calculated above, M C These are the molar masses of carbon dioxide and carbon, respectively. According to the carbon emission intensity E Gi Calculate the real-time carbon injection rate R of each generator unit within the equilibrium zone. Gi Its calculation formula is: R Gi =P Gi E Gi .

9. The method according to claim 7, characterized in that, The carbon flow allocation results include: Carbon flow rate R distributed across the load at node k Lk The calculation formula is: In the formula, P Lk P represents the active power of the load at node k. Nk This represents the power flowing through node k. This represents the sum of carbon flows into node k; Carbon flow rate R distributed in branch ij ij The calculation formula is: In the formula, P ij P represents the active power in branch ij. Ni This represents the power flowing through the starting node i of branch ij. This represents the sum of carbon flows into the starting node i of branch ij; The branch network loss carbon flow rate R corresponding to the power loss in branch ij ij loss The calculation formula is: In the formula, R ij loss This represents the active power loss in branch ij.

10. A real-time calculation device for zoned and hierarchical carbon emission flows for provincial power grids, characterized in that, include: The calculation module is used to acquire real-time data of the provincial power grid and perform AC steady-state power flow calculation based on the real-time data to obtain the active power distribution and active power loss of each branch of the system. The identification module is used to search and identify the ring network in the provincial power grid based on the active power distribution of the branch and the power flow direction in each branch, using graph theory methods. The equivalent module is used to perform equivalent processing on the identified ring network, and to convert the provincial power grid into a ring-free network. The sorting module is used to transform the acyclic network topology into a graph model based on balanced partitioning, and to use graph theory methods to perform topological sorting on all network nodes within the partition to obtain a node order set. The carbon emission distribution module is used to distribute carbon emission flows layer by layer according to the upstream and downstream topology of the power grid nodes, starting from the generator source side, based on the node sequence set and a preset carbon emission distribution principle, to obtain the carbon emission flow distribution of the entire system.

11. A computer-readable storage medium, characterized in that, The storage medium stores a computer program for performing the method described in any one of claims 1-9.

12. An electronic device, characterized in that, The electronic device includes: processor; Memory used to store the processor's executable instructions; The processor is configured to read the executable instructions from the memory and execute the instructions to implement the method described in any one of claims 1-9.

Images