A path planning method, system, device and medium for power distribution network backup resource planning

Abstract

The application discloses a kind of path planning methods, systems, equipment and medium for distribution network backup resource planning, comprising the following steps, in response to the acquisition of the position information of distribution network failure element, distribution network is divided into regions, obtain multiple failure influence areas;The load node of each failure influence area is prioritized, and the available backup resource is determined by the priority sorting result;By the position of available backup resource, obtain the initial load recovery path of available backup resource to each load node;The initial load recovery path is screened in a first level, and the target load recovery path of each load node is obtained;The target load recovery path in target area is optimized across regions, and the optimized load recovery path is obtained.The application further improves the rationality of the optimized load recovery path of low-priority load node under the premise of guaranteeing the power supply recovery of high-priority load node.

Description

Technical Field

[0001] This invention relates to the field of path planning technology, and specifically to a path planning method, system, device and medium for planning backup resources in distribution networks. Background Technology

[0002] After a fault occurs in a distribution network, existing load restoration path planning methods typically employ a centralized approach, performing path planning and resource allocation uniformly across the entire distribution network. For example, when multiple faults occur simultaneously in a distribution network, existing methods require unified calculation of restoration paths for all load nodes across the entire network. As the scale of the distribution network expands, the number of load nodes and the amount of reserve resources across the entire network increase rapidly, leading to an exponential increase in the computational workload of path planning. This makes it difficult to determine the effective restoration path for each load node in a timely manner, thus affecting the efficiency of power restoration after a fault. Summary of the Invention

[0003] In view of the above-mentioned problems, the present invention provides a path planning method, system, device and medium for distribution network backup resource planning.

[0004] Therefore, the technical problem solved by the present invention is that existing load restoration path planning methods usually adopt a centralized processing approach, that is, to uniformly plan paths and allocate resources for the entire distribution network.

[0005] To address the aforementioned technical problems, this invention provides the following technical solution: a path planning method for backup resource planning in a distribution network, comprising the following steps: in response to the acquisition of location information of faulty components in the distribution network, the distribution network is divided into regions to obtain multiple fault-affected regions; load nodes in each fault-affected region are prioritized, and available backup resources are determined based on the priority ranking results; initial load restoration paths from the available backup resources to each load node are obtained based on the location of the available backup resources; the initial load restoration paths are first-level filtered to obtain target load restoration paths for each load node; and cross-regional optimization of the target load restoration paths in the target regions is performed based on the interconnection relationships between target regions and the sharing relationships between backup resources in the target regions to obtain optimized load restoration paths.

[0006] As a preferred embodiment of the path planning method for distribution network reserve resource planning described in this invention, the step of obtaining the initial load recovery path includes: obtaining effective connection pairs of each available reserve resource based on the connection relationship between each load node and available reserve resource within each fault-affected area; filtering out effective connection pairs whose total load demand does not exceed the capacity of the corresponding available reserve resource based on the capacity of each available reserve resource and the load demand of each load node in the effective connection pair, thereby obtaining the target effective connection pairs of each available reserve resource; obtaining the necessary node dependency relationship between any two load nodes within each fault-affected area; determining the coverage node range of each available reserve resource by combining the priority ranking result and the target effective connection pair with the necessary node dependency relationship; and performing reverse tracing on each load node within the coverage node range to generate the initial load recovery path from each available reserve resource to each load node.

[0007] As a preferred embodiment of the path planning method for distribution network backup resource planning described in this invention, the step of determining the coverage node range of each available backup resource includes: selecting load nodes with a priority no lower than the highest priority in the current fault-affected area from the target valid connection pairs based on the priority ranking results, as priority coverage nodes; determining load nodes in the target valid connection pairs that have a necessary node dependency relationship with the priority coverage nodes as indirect coverage nodes based on the necessary node dependency relationship; and combining the priority coverage nodes and indirect coverage nodes to constitute the coverage node range of each available backup resource.

[0008] As a preferred embodiment of the path planning method for distribution network backup resource planning described in this invention, the step of performing a first-level screening of the initial load restoration path includes: obtaining a first candidate path in response to the initial load restoration paths of each load node that have passed the safety constraint verification; removing paths that pass through the faulty component from the first candidate path to obtain a second candidate path, and selecting the path with the shortest path length from the second candidate path to obtain a third candidate path; when there is only one third candidate path, it is determined as the target load restoration path for the corresponding load node; when there are multiple third candidate paths, the equipment distance between each load node and the faulty component in each third candidate path is calculated, and the third candidate path with the fewest equipment distances less than or equal to a preset distance threshold is determined as the target load restoration path for the corresponding load node.

[0009] As a preferred embodiment of the path planning method for distribution network reserve resource planning described in this invention, the step of obtaining the optimized load restoration path includes: determining adjacent target area pairs from each target area using a pre-constructed association structure tree and the switching status of switchable tie switches; calculating the remaining shared capacity of each target area based on the total capacity of available reserve resources in each target area of ​​the adjacent target area pair; determining the sharing range of available reserve resources in each target area based on the location of available reserve resources and the location of switchable tie switches in each target area; and performing cross-regional optimization on the adjacent target areas based on the remaining shared capacity and the sharing range to obtain the optimized load restoration path.

[0010] As a preferred embodiment of the path planning method for distribution network reserve resource planning described in this invention, the step of cross-regional optimization of the adjacent target areas includes: for any target area in the pair of adjacent target areas, determining whether the remaining shared capacity of the other target area is not less than the load demand of the load node to be optimized in the target area, and the load demand does not exceed the transmission power limit of the switchable tie switch, and the load node to be optimized is located within the shared range of the other target area; in response to the simultaneous satisfaction, combining the adjacent target areas with the other target area to obtain a cross-regional path; comparing the path length of the cross-regional path with the path length of the target load recovery path corresponding to the load node to be optimized, and selecting the one with the smaller path length as the optimized load recovery path for the load node to be optimized.

[0011] As a preferred embodiment of the path planning method for distribution network reserve resource planning described in this invention, the step of determining available reserve resources based on priority ranking results includes: prioritizing the load nodes in each fault-affected area according to their load type and load demand, and obtaining priority ranking results; determining the load nodes in each fault-affected area that require priority power restoration based on the priority ranking results; and determining the reserve resources whose capacity meets the load demand of the load nodes that require priority power restoration as available reserve resources.

[0012] This invention provides a path planning system for planning backup resources in distribution networks.

[0013] To solve the above technical problems, the present invention provides the following technical solution: a path planning system for backup resource planning in distribution networks, comprising: a resource calculation module, used to prioritize load nodes in each fault-affected area and determine available backup resources based on the priority ranking results; The primary calculation module obtains the initial load recovery path from the available backup resources to each load node based on the location of the available backup resources; The secondary calculation module performs primary filtering on the initial load recovery path to obtain the target load recovery path for each load node; The optimized path determination module optimizes the target load recovery path across regions by considering the communication relationships between target regions and the sharing relationships between backup resources in the target regions.

[0014] The present invention provides a computer device, including a memory and a processor. The memory stores a computer program, and the processor executes the computer program to implement the steps of the path planning method for backup resource planning in a distribution network.

[0015] The present invention provides a computer-readable storage medium having a computer program stored thereon, wherein the computer program, when executed by a processor, implements the steps of the path planning method for distribution network reserve resource planning.

[0016] The beneficial effects of this invention are as follows: By acquiring the location information of faulty components in the distribution network, the distribution network is divided into multiple fault-affected areas. Within each fault-affected area, the priority ranking of load nodes, the determination of available backup resources, the acquisition of initial load restoration paths, and primary screening are carried out independently. This decomposes the path planning problem, which originally required unified processing across the entire network, into multiple smaller regional problems. Each fault-affected area can be processed in parallel, avoiding the problem of exponential growth in computational load as the scale of the distribution network expands. Furthermore, by leveraging the interconnections between target areas and the sharing relationships among backup resources within target areas, cross-regional optimization of target load restoration paths is performed. This allows each fault-affected area to achieve resource complementarity by utilizing the remaining shared capacity and shared range of adjacent target areas, while still ensuring power restoration for high-priority load nodes. This further improves the rationality of optimized load restoration paths for low-priority load nodes while guaranteeing power restoration for high-priority load nodes. Attached Figure Description

[0017] To more clearly illustrate the technical solutions of the embodiments of the present invention, the accompanying drawings used in the description of the embodiments will be briefly introduced below. Obviously, the accompanying drawings described below are only some embodiments of the present invention. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0018] Figure 1 This is a flowchart illustrating a path planning method for distribution network reserve resource planning, as provided in one embodiment of the present invention. Detailed Implementation

[0019] To make the present invention more apparent and understandable, the specific embodiments of the present invention will be described in detail below with reference to the accompanying drawings. Obviously, the described embodiments are only a part of the embodiments of the present invention, not all of them. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative effort should fall within the protection scope of the present invention.

[0020] Example 1, referring to Figure 1 This is one embodiment of the present invention, which provides a path planning method for distribution network reserve resource planning, including the following steps: S1. In response to the acquisition of the location information of faulty components in the distribution network, the distribution network is divided into regions to obtain multiple fault-affected areas.

[0021] S2. Prioritize the load nodes in each affected area of ​​the fault, and determine the available backup resources based on the priority ranking results.

[0022] S3. Obtain the initial load recovery path from the available backup resources to each load node based on the location of the available backup resources.

[0023] S4. Perform a first-level screening on the initial load recovery path to obtain the target load recovery path for each load node.

[0024] S5. Through the communication relationships between target areas and the sharing relationships between backup resources in the target areas, cross-regional optimization is performed on the target load recovery path in the target areas to obtain the optimized load recovery path.

[0025] It should be noted that after a fault occurs in the distribution network, power supply needs to be restored quickly to reduce power outage losses. However, traditional load restoration methods often only consider the allocation of backup resources within a single area, resulting in low utilization of backup resources and difficulty in achieving globally optimal load restoration in the event of a multi-area fault. Furthermore, while there is a possibility of sharing backup resources between different areas, traditional methods lack cross-regional coordination mechanisms, failing to fully utilize the remaining capacity of adjacent areas. This leads to some areas having idle resources while others face resource shortages, affecting the overall load restoration effect.

[0026] Therefore, to address the aforementioned issues of load recovery path planning and cross-regional resource coordination, a load recovery framework based on regional division is constructed through steps S1-S5 to achieve accurate identification of the scope of fault impact and priority management of load nodes; through a multi-level screening mechanism, the optimal recovery path for each load node is obtained under the premise of meeting safety constraints.

[0027] Example 2, refer to Figure 1As an embodiment of the present invention, a path planning method for distribution network reserve resource planning is provided based on the previous embodiment, including the following steps: S1. In response to the acquisition of the location information of faulty components in the distribution network, the distribution network is divided into regions to obtain multiple fault-affected areas.

[0028] After a fault occurs in the distribution network, the path planning system obtains the location information of all faulty components and, based on the topology of the distribution network, divides the entire distribution network into multiple independent fault-affected areas, with the faulty components as the dividing points. The connection between the load nodes in each fault-affected area and the external normal power grid is cut off by the faulty components.

[0029] In this embodiment, a power distribution network consists of a main line and several branch lines. The main line is equipped with two switching stations, A and B, and each branch line is led out from the two switching stations and connected to different load nodes.

[0030] When a line break occurs between substations A and B on the main line, the path planning system obtains the location information of the faulty component and divides the distribution network into two fault-affected areas, using the break point as the dividing point.

[0031] The first fault affected area was substation A and the load nodes of its connected branch lines, while the second fault affected substation B and the load nodes of its connected branch lines. Both fault-affected areas were disconnected from the external normal power grid due to the line breakage fault.

[0032] S2. Prioritize the load nodes in each affected area of ​​the fault, and determine the available backup resources based on the priority ranking results.

[0033] For each affected area, the path planning system analyzes the load type and load demand of each load node within the area, prioritizes the loads, and determines available backup resources accordingly. The steps include S2.1 to S2.3: S2.1. Prioritize the load nodes in each affected area based on their load type and load demand, and obtain the priority ranking result.

[0034] The path planning system obtains the load type and load demand of each load node in each affected area of ​​the fault. The load types include, but are not limited to, hospitals, residential communities, and commercial buildings. Different load types correspond to different power supply guarantee requirements. Load requirements include the power size and power supply continuity requirements of each load node. Then, priority ranking is performed to obtain the priority ranking result.

[0035] Taking the first fault-affected area as an example, this area includes hospital load node F, commercial building load node E and residential community load node D, with load demands of 500kW, 300kW and 200kW respectively.

[0036] Since the load type of hospital load node F has the highest requirement for power supply continuity, followed by commercial building load node E, and residential community load node D has a relatively lower requirement, the priority ranking result of the fault-affected area determined by the path planning system is: hospital load node F > commercial building load node E > residential community load node D.

[0037] S2.2. Based on the priority ranking results, determine the load nodes in each fault-affected area that require priority power restoration.

[0038] Taking the first affected area as an example, based on the priority ranking results, the path planning system determines that the hospital load node F and the commercial building load node E are the load nodes that need to be prioritized for power restoration, with a total load demand of 800kW.

[0039] S2.3. Reserve resources whose capacity meets the load demand of the load nodes that need to be prioritized for power restoration are identified as available reserve resources.

[0040] In this embodiment, the route planning system discovered two backup resources in the area: an emergency generator G1 with a capacity of 600kW located near substation A; and a substation G2 with a backup capacity of 1000kW located in the adjacent area.

[0041] Since the combined load demand of load nodes F and E, which require priority power restoration, is 800kW, and G1's capacity of 600kW is less than 800kW, it cannot simultaneously meet the load demand of F and E, but it can meet the load demand of F (500kW) or E (300kW) alone; G2's capacity of 1000kW is greater than 800kW, and it can simultaneously meet the load demand of F and E.

[0042] Therefore, the path planning system identifies both G1 and G2 as available backup resources, and records that G1 is located near substation A with a capacity of 600kW, and G2 is located in an adjacent substation with a backup capacity of 1000kW.

[0043] S3. Obtain the initial load recovery path from the available backup resources to each load node based on the location of the available backup resources.

[0044] The steps for obtaining the initial load recovery path include S3.1 to S3.5: S3.1. Based on the connection relationship between each load node and available backup resources within each fault-affected area, obtain the effective connection pairs of each available backup resource.

[0045] By checking one by one whether there is a valid connection between each load node and each available backup resource in each affected area of ​​the fault, the combination of load nodes and available backup resources with valid connections is determined as the valid connection pair of the available backup resource.

[0046] In this embodiment, the available backup resources in this area are G1 and G2, and the load nodes are F, E, and D.

[0047] After checking the connection relationships one by one, the route planning system confirmed that G1 and F are connected via switch station A and line L1, and there is a valid connection relationship, forming a valid connection pair (G1, F). G1 and E are connected via switch station A and line L2, and there is a valid connection relationship, forming a valid connection pair (G1, E). G1 and D are connected via switch station A, line L2 and its branches, and have a valid connection relationship, forming a valid connection pair (G1, D).

[0048] G2 is connected to F, E, and D via tie line L3, switch station A, and corresponding lines, and all have valid connection relationships, forming valid connection pairs (G2, F), (G2, E), and (G2, D) respectively.

[0049] Therefore, the valid connection pairs of G1 are (G1, F), (G1, E), and (G1, D), and the valid connection pairs of G2 are (G2, F), (G2, E), and (G2, D).

[0050] S3.2. Based on the capacity of each available backup resource and the load demand of each load node in the effective connection pair, select the effective connection pairs whose total load demand does not exceed the capacity of the corresponding available backup resource, and obtain the target effective connection pairs for each available backup resource.

[0051] The path planning system performs capacity verification on each valid connection pair of available backup resources, accumulates the load demand of each load node in the valid connection pair, and retains valid connection pairs whose total load demand does not exceed the capacity of the available backup resource, thus obtaining the target valid connection pairs for each available backup resource.

[0052] Specifically, G1 has a capacity of 600kW, F has a load requirement of 500kW, E has a load requirement of 300kW, and D has a load requirement of 200kW.

[0053] The path planning system performs capacity verification on each valid connection pair of G1. When supplying power to F alone, the total load demand is 500kW, not exceeding 600kW, and is therefore reserved. When supplying power solely to E, the total load requirement is 300kW, not exceeding 600kW, and is retained. When supplying power solely to D, the total load requirement is 200kW, not exceeding 600kW, and is retained. The total load requirement when supplying power to both F and E is 800kW, which exceeds 600kW, so it is excluded. The total load requirement when supplying power to both F and D is 700kW, which exceeds 600kW, so it is excluded. The total load requirement when supplying power to both E and D is 500kW, not exceeding 600kW, and is reserved. The total load requirement when supplying power to F, E, and D simultaneously is 1000kW, which exceeds 600kW, so it is excluded.

[0054] Therefore, the target valid connection pairs for G1 are (G1, F), (G1, E), (G1, D), and (G1, E, D). G2 has a capacity of 1000kW. After verification in the same way, the total load demand of any combination of the three load nodes F, E, and D does not exceed 1000kW. Therefore, the target valid connection pairs for G2 include all single nodes and combined connection pairs of F, E, and D.

[0055] S3.3 Obtain the necessary node dependencies between any two load nodes within each fault-affected area.

[0056] The path planning system analyzes the topology of each fault-affected area to determine whether there is a necessary node dependency between any two load nodes. Specifically, it determines whether all paths connecting the subsequent load node to available backup resources must pass through the preceding load node. If so, it determines that there is a necessary node dependency between the two.

[0057] Specifically, within this area, F is connected to switch station A via line L1, E is connected to switch station A via line L2, and D is connected to E via a branch of line L2.

[0058] Analysis revealed that F and E can both be directly connected to available backup resources via switch station A, and they are independent of each other. Therefore, there is no necessary node dependency between F and E. Between D and E, all paths from D to available backup resources must pass through E, therefore D has a necessary node dependency relationship with E; Between D and F, the path for D to access available backup resources must pass through E instead of F, therefore there is no necessary node dependency between D and F.

[0059] S3.4. By combining the priority sorting results and the target valid connection pairs with the dependency relationship of the necessary nodes, determine the coverage node range of each available backup resource.

[0060] Specifically, the steps for determining the coverage node range of each available backup resource include A1~A3: A1. Based on the priority sorting results, select load nodes with a priority no lower than the highest priority in the current fault-affected area from the target valid connection pairs, and use them as priority coverage nodes.

[0061] Based on the priority ranking results, the path planning system selects load nodes with a priority no lower than the highest priority in the current fault-affected area from the load nodes included in the target effective connection pairs of each available backup resource, and determines them as priority coverage nodes.

[0062] For example, the highest priority load node in this area is F, which is the hospital. The route planning system filters the target valid connection pairs of G1 and G2. Among the target valid connection pairs of G1, F has a priority equal to the highest priority, which meets the condition. E and D have priorities lower than the highest priority, which do not meet the condition. Therefore, the priority coverage node of G1 is F. Similarly, among the target valid connection pairs of G2, only F meets the condition. Therefore, the priority coverage node of G2 is F.

[0063] A2. Based on the necessary node dependency relationship, the load nodes in the target effective connection pair that have a necessary node dependency relationship with the priority coverage node are determined as indirect coverage nodes.

[0064] Based on the dependency relationship of necessary nodes, the path planning system searches for load nodes that have a necessary node dependency relationship with the priority coverage node in the target effective connection pairs of each available backup resource, and identifies them as indirect coverage nodes.

[0065] The priority coverage node for both G1 and G2 is F. There is no necessary node dependency between E and F, nor is there a necessary node dependency between D and F. Therefore, neither G1 nor G2 has any indirect coverage nodes.

[0066] Suppose that a new load node I is added to the region, and all paths of I to the available backup resources must pass through F. Then I has a necessary node dependency relationship with F. When (G2, I) is in the target valid connection pair of G2, I is determined to be the indirect coverage node of G2.

[0067] A3. The priority coverage nodes and indirect coverage nodes together constitute the coverage node range of each available backup resource.

[0068] The path planning system merges the priority coverage nodes and indirect coverage nodes of each available backup resource to form the coverage node range of that available backup resource.

[0069] For example, G1 has a priority coverage node F and no indirect coverage nodes, so the coverage node range of G1 is {F}. G2 has a priority coverage node F and no indirect coverage nodes, therefore the coverage node range of G2 is {F}.

[0070] If, as assumed in step A2, G2 has an indirect covering node I, then the range of covering nodes for G2 is: .

[0071] S3.5. Perform reverse tracing on each load node within the coverage area to generate an initial load recovery path from each available backup resource to each load node.

[0072] The coverage area of ​​G1 is The path planning system traces backwards from F: The load recovery path from G1 to F is [G1→A switch station→F], which is reached via line L1 to switch station A and then to G1.

[0073] The coverage area of ​​G2 is The path planning system traces backwards from F: The load recovery path from G2 to F is as follows: via line L1 to switch station A, and then via tie line L3 to G2. The initial load recovery path from G2 to F is: [G2 → tie line L3 → switch station A → F].

[0074] S4. Perform a first-level screening on the initial load recovery path to obtain the target load recovery path for each load node.

[0075] The step of performing primary screening of the initial load recovery path includes S4.1: S4.1. In response to the initial load recovery path of each load node that has passed the security constraint verification, the first candidate path is obtained.

[0076] Safety constraint verification is performed on all initial load restoration paths generated in step S3. Safety constraint verification includes checking whether the current of each line on the path exceeds its rated capacity, verifying whether the voltage of each node is within the allowable range (in this example, the allowable range is set to 0.95-1.05 per unit), and confirming whether the number of operations of the switching equipment on the path is within a reasonable range.

[0077] For example, for load node L1, assuming its initial path set contains 5 paths, after security constraint verification, 3 paths satisfy all constraints, and these 3 paths constitute the first candidate path set.

[0078] S4.2. Eliminate the paths that pass through the faulty component from the first candidate paths to obtain the second candidate paths, and select the path with the shortest path length from the second candidate paths to obtain the third candidate path.

[0079] Remove all paths that pass through the faulty component from the first candidate paths, and select the path with the shortest path length from the remaining paths.

[0080] Taking load node L1 as an example, the first candidate path includes path A (passing through 5 nodes), path B (passing through 4 nodes), and path C (passing through 6 nodes). If path C passes through faulty line L12-13, it will be eliminated. The remaining path A and path B constitute the second candidate path. After comparing the path lengths, path B (4 nodes) is the shortest and is selected as the third candidate path.

[0081] S4.3 When there is only one third candidate path, it is determined as the target load recovery path for the corresponding load node.

[0082] For example, if only path D remains after the above filtering of load node L2, then path D is the target load recovery path for L2.

[0083] S4.4 When there are multiple third candidate paths, the equipment distance between each load node and the faulty component in each third candidate path is calculated, and the third candidate path with the fewest equipment distances less than or equal to the preset distance threshold is determined as the target load recovery path for the corresponding load node.

[0084] When there are multiple third candidate paths, further filtering based on device distance is required.

[0085] Taking load node L3 as an example, the third candidate path includes path E and path F, both of which have a length of 4 nodes. By setting the preset distance threshold to 3 device intervals, it was found after calculation that there are 2 load nodes in path E whose device distance from the faulty component is less than or equal to 3, while there is only 1 load node in path F whose device distance from the faulty component is less than or equal to 3. Since there are fewer load nodes close to the faulty component in path F, path F is selected as the target load recovery path for L3.

[0086] S5. Through the communication relationships between target areas and the sharing relationships between backup resources in the target areas, cross-regional optimization is performed on the target load recovery path in the target areas to obtain the optimized load recovery path.

[0087] The steps to obtain the optimized load recovery path include S5.1 to S5.4: S5.1 Determine adjacent target region pairs from each target region using a pre-built association structure tree and the switching states of switchable communication switches.

[0088] It is important to know that the association structure tree is a tree-shaped data structure used to represent the topological connection relationship between target areas in a distribution network. Each node in the tree represents a target area, and the edges between nodes represent the tie switches connecting the two areas and the lines they are located on. The edges are labeled with the tie switch number, location information, and transmission power limit of the tie switch, etc.

[0089] For example, suppose the distribution network is divided into 5 target areas (Zone1-Zone5). The association structure tree shows that there is an edge between Zone1 and Zone2. This edge is labeled as tie switch SW12, located between nodes N8 and N9, and the transmission power is limited to 500kW. There is an edge between Zone2 and Zone3, labeled as tie switch SW23, located between nodes N15 and N20, with a transmission power limit of 600kW.

[0090] After checking the current status of each contact switch, it was found that SW12 and SW23 were both in a switchable state, thus determining the adjacent target area pairs as (Zone1,Zone2) and (Zone2,Zone3).

[0091] S5.2. Calculate the remaining shared capacity of each target area based on the total capacity of available spare resources in each target area of ​​the adjacent target area pair.

[0092] Taking Zone 1 as an example, the total available standby resource capacity within Zone 1 is 2000kW, and the capacity already allocated to load restoration within Zone 1 is 1200kW. Therefore, the remaining shared capacity of Zone 1 is 800kW. Similarly, the remaining shared capacity of Zone 2 is calculated to be 600kW, and the remaining shared capacity of Zone 3 is 1000kW.

[0093] S5.3 Determine the sharing range of available backup resources in each target area by the location of available backup resources and the location of switchable communication switches in each target area.

[0094] Taking Zone1 as an example, the spare feeder F1 of Zone1 is located at node N5, and the tie switch SW12 is located at node N8. The path from N5 to SW12 covers the set of nodes. The shared scope of Zone1 is defined as all load nodes in Zone2 that can be connected to this path via SW12, specifically the nodes in Zone2. These nodes can be powered by the backup resources of Zone1 after SW12 is closed.

[0095] S5.4. Based on the remaining shared capacity and the shared range, perform cross-regional optimization on the adjacent target areas to obtain an optimized load recovery path.

[0096] Taking (Zone1,Zone2) as an example, for the load node L5 to be optimized in Zone2, execute step B1 to check whether the remaining shared capacity of Zone1 (800kW) is not less than 300kW, check whether the transmission power limit of tie switch SW12 (500kW) is not less than 300kW, and check whether L5 is within the shared range of Zone1.

[0097] Since L5 is located at node N10, it falls within the shared scope. If all three conditions are met simultaneously, the system generates a cross-regional path: L5→N10→SW12→N8→N7→N6→N5. Then, the system executes step B2, comparing the length of this cross-regional path with the length of the original target load recovery path for L5. Since the original path length is shorter, the target load recovery path for L5 remains unchanged.

[0098] For another load node L6 in Zone2 to be optimized, the three conditions of step B1 are also met and a cross-regional path is generated. The length of the cross-regional path is 4 nodes, while the length of the original target load recovery path of L6 is 6 nodes. According to step B2, since the length of the cross-regional path is smaller, the optimized load recovery path of L6 is updated to a cross-regional path, and the remaining shared capacity of Zone1 is updated to 550kW.

[0099] Repeat the above process for all adjacent target areas to obtain the optimized load recovery path for each load node.

[0100] The steps for cross-region optimization of the adjacent target regions include B1~B2: B1. For any target area in the pair of adjacent target areas, determine whether the remaining shared capacity of the other target area is not less than the load demand of the load node to be optimized in the target area, and the load demand does not exceed the transmission power limit of the switchable tie switch, and the load node to be optimized is located within the shared range of the other target area; in response to the simultaneous satisfaction, the adjacent target areas are combined with the other target area to obtain a cross-regional path.

[0101] In this example, cross-region optimization is performed on the adjacent target region pair (Zone1, Zone2). For the load node L5 to be optimized in Zone2, it is first determined whether the remaining shared capacity of 800kW in Zone1 is not less than the load demand of L5 of 300kW. The result is that the condition is met.

[0102] Next, it is determined whether the load demand of L5, 300kW, does not exceed the transmission power limit of 500kW of the switchable tie switch SW12 connecting Zone1 and Zone2. The result is that the condition is met.

[0103] Finally, we determine whether L5 is within the shared range of Zone1. Since L5 is located at node N10, and the shared range of Zone1 includes nodes in Zone2... Therefore, L5 is located within the shared area of ​​Zone1, and the judgment result is that the condition is met.

[0104] Since all three conditions are met, the system combines Zone2 with Zone1 to generate a cross-zone path: L5→N10→SW12→N8→N7→N6→N5. This path allows L5 to be powered by the backup resources of Zone1 after closing the tie switch SW12.

[0105] B2. Compare the path length of the cross-regional path with the path length of the target load recovery path corresponding to the load node to be optimized, and select the one with the smaller path length as the optimized load recovery path for the load node to be optimized.

[0106] The cross-regional path of L5 is L5→N10→SW12→N8→N7→N6→N5, with a path length of 6 nodes. The original target load recovery path for L5 is L5→N10→N15→N16→N17→N18, with a path length of 5 nodes.

[0107] After comparison, it was found that the original target load recovery path length 5 is less than the cross-regional path length 6. Therefore, the original target load recovery path is selected as the optimized load recovery path of L5, and the path of L5 is kept unchanged.

[0108] For another load node L6 in Zone2 to be optimized, after the three condition judgments in step B1, a cross-regional path L6→N9→SW12→N8→N7→N5 is generated. The length of this cross-regional path is 4 nodes, while the original target load recovery path L6→N9→N14→N15→N16→N17→N18 has a length of 6 nodes.

[0109] After comparison, it was found that the cross-regional path length 4 is less than the original target load restoration path length 6. Therefore, the cross-regional path was selected as the optimized load restoration path for L6, and the remaining shared capacity of Zone1 was updated to 800kW-250kW=550kW.

[0110] By repeating steps B1 and B2 above for all load nodes to be optimized in all adjacent target area pairs, the optimized load recovery path for each load node is finally obtained.

[0111] Example 3 is an embodiment of the present invention. This embodiment provides a path planning system for distribution network reserve resource planning, including a resource calculation module for prioritizing load nodes in each fault-affected area and determining available reserve resources based on the priority ranking results. The primary calculation module obtains the initial load recovery path from the available backup resources to each load node based on the location of the available backup resources; The secondary calculation module performs primary filtering on the initial load recovery path to obtain the target load recovery path for each load node; The optimized path determination module optimizes the target load recovery path across regions by considering the communication relationships between target regions and the sharing relationships between backup resources in the target regions.

[0112] This embodiment also provides an electronic device applicable to a path planning method for distribution network reserve resource planning, comprising: a memory and a processor; the memory is used to store computer-executable instructions, and the processor is used to execute the computer-executable instructions to implement the path planning method for distribution network reserve resource planning as proposed in the above embodiment.

[0113] This embodiment also provides a storage medium storing a computer program that, when executed by a processor, implements a path planning method for distribution network reserve resource planning as proposed in the above embodiment.

[0114] The storage medium proposed in this embodiment and the path planning method for implementing backup resource planning in the above embodiment belong to the same inventive concept. Technical details not described in detail in this embodiment can be found in the above embodiments, and this embodiment has the same beneficial effects as the above embodiments.

[0115] Based on the above description of the implementation methods, those skilled in the art can clearly understand that the present invention can be implemented using software and necessary general-purpose hardware, and of course, it can also be implemented using hardware, but in many cases the former is a better implementation method. Based on this understanding, the technical solution of the present invention, or the part that contributes to the prior art, can be embodied in the form of a software product. This computer software product can be stored in a computer-readable storage medium, such as a computer floppy disk, read-only memory (ROM), random access memory (RAM), flash memory, hard disk, or optical disk, etc., including several instructions to cause a computer device (which may be a personal computer, server, or network device, etc.) to execute the methods of the various embodiments of the present invention.

[0116] It should be noted that the above embodiments are only used to illustrate the technical solutions of the present invention and not to limit it. Although the present invention has been described in detail with reference to preferred embodiments, those skilled in the art should understand that modifications or equivalent substitutions can be made to the technical solutions of the present invention without departing from the spirit and scope of the technical solutions of the present invention, and all such modifications or substitutions should be covered within the scope of the claims of the present invention.

Claims

1. A path planning method for distribution network reserve resource planning, characterized in that: Includes the following steps, In response to the acquisition of location information of faulty components in the distribution network, the distribution network is divided into regions to obtain multiple fault-affected areas; Prioritize the load nodes in each affected area of ​​the fault, and determine the available backup resources based on the priority ranking results; By identifying the location of the available backup resources, the initial load recovery path from the available backup resources to each load node is obtained; The initial load recovery path is filtered first-level to obtain the target load recovery path for each load node; By leveraging the inter-regional connections and the sharing relationships among backup resources within the target regions, cross-regional optimization is performed on the target load recovery path within the target regions to obtain the optimized load recovery path.

2. The path planning method for distribution network reserve resource planning as described in claim 1, characterized in that: The steps for obtaining the initial load recovery path include: Based on the connection relationship between each load node and available backup resources within each affected area of ​​a fault, the effective connection pairs of each available backup resource are obtained; Based on the capacity of each available backup resource and the load demand of each load node in the effective connection pair, effective connection pairs whose total load demand does not exceed the capacity of the corresponding available backup resource are selected, and the target effective connection pairs of each available backup resource are obtained. Obtain the necessary node dependencies between any two load nodes within each fault-affected area; By combining the priority sorting results and the target valid connection pairs with the dependency relationship of the necessary nodes, the coverage node range of each available backup resource is determined; Reverse tracing is performed on each load node within the coverage area to generate an initial load recovery path from each available backup resource to each load node.

3. The path planning method for distribution network reserve resource planning as described in claim 2, characterized in that: The steps to determine the coverage area of ​​each available backup resource include: Based on the priority sorting results, load nodes with a priority no lower than the highest priority in the current fault-affected area are selected from the target valid connection pairs and used as priority coverage nodes. Based on the necessary node dependencies, load nodes that have necessary node dependencies on the priority coverage nodes in the target effective connection pair are identified as indirect coverage nodes; The priority coverage nodes and indirect coverage nodes together constitute the coverage node range of each available backup resource.

4. The path planning method for distribution network reserve resource planning as described in claim 3, characterized in that: The steps for primary screening of the initial load recovery path include: In response to the initial load recovery path of each load node that has passed the safety constraint verification, the first candidate path is obtained; The first candidate path is eliminated by removing the path that passes through the faulty component to obtain the second candidate path, and the path with the shortest path length is selected from the second candidate path to obtain the third candidate path. When there is only one third candidate path, it is determined as the target load recovery path for the corresponding load node. When there are multiple third candidate paths, the equipment distance between each load node and the faulty component in each third candidate path is calculated, and the third candidate path with the fewest equipment distances less than or equal to a preset distance threshold is determined as the target load recovery path for the corresponding load node.

5. The path planning method for distribution network reserve resource planning as described in claim 4, characterized in that: The steps to obtain the optimized load recovery path include: By using a pre-built association structure tree and the on / off state of a switchable communication switch, adjacent target region pairs are determined from each target region; The remaining shared capacity of each target area is calculated based on the total available spare resources in each target area of ​​the adjacent target area pair. The sharing range of available backup resources in each target area is determined by the location of available backup resources and switchable communication switches in each target area; Based on the remaining shared capacity and the shared range, cross-regional optimization is performed on the adjacent target areas to obtain an optimized load recovery path.

6. The path planning method for distribution network reserve resource planning as described in claim 5, characterized in that: The steps for cross-regional optimization of the adjacent target regions include: For any target area in the adjacent target area pair, determine whether the remaining shared capacity of the other target area is not less than the load demand of the load node to be optimized in the target area, and the load demand does not exceed the transmission power limit of the switchable tie switch, and the load node to be optimized is located within the shared range of the other target area; When both conditions are met, the adjacent target areas are combined with another target area to obtain a cross-regional path; The path length of the cross-regional path is compared with the path length of the target load recovery path corresponding to the load node to be optimized, and the path with the smaller path length is selected as the optimized load recovery path for the load node to be optimized.

7. The path planning method for distribution network reserve resource planning as described in claim 6, characterized in that: The steps for determining available standby resources based on priority ranking results include: By prioritizing the load nodes in each affected area based on their load type and load demand, the priority ranking results are obtained. Based on the priority ranking results, determine the load nodes within each fault-affected area that require priority power restoration; The spare resources whose capacity meets the load demand of the load nodes that need to be prioritized for power restoration are identified as available spare resources.

8. A path planning system for distribution network reserve resource planning, employing the path planning method for distribution network reserve resource planning as described in any one of claims 1 to 7, characterized in that, include: The resource calculation module is used to prioritize the load nodes in each affected area of ​​a fault and determine the available backup resources based on the priority ranking results. The primary calculation module obtains the initial load recovery path from the available backup resources to each load node based on the location of the available backup resources; The secondary calculation module performs primary filtering on the initial load recovery path to obtain the target load recovery path for each load node; The optimized path determination module optimizes the target load recovery path across regions by considering the communication relationships between target regions and the sharing relationships between backup resources in the target regions.

9. A computer device comprising a memory and a processor, wherein the memory stores a computer program, characterized in that, When the processor executes the computer program, it implements the steps of the path planning method for distribution network reserve resource planning as described in any one of claims 1 to 7.

10. A computer-readable storage medium having a computer program stored thereon, characterized in that, When the computer program is executed by the processor, it implements the steps of the path planning method for distribution network backup resource planning as described in any one of claims 1 to 7.

Images