A power distribution network fusion topology construction, minimum switch configuration and safe switching time sequence optimization method and system for multi-mode switching

Abstract

The present application relates to power distribution network operation control and topology optimization technical field, specifically relates to a kind of power distribution network fusion topology construction, mode switch configuration and security switching time optimization method for multi-mode switching.The present application obtains multiple original electrical topologies and its nodes, branch and operating parameters, based on stable node name or equipment number, and combined with node type, voltage level, capacity, region, level and electrical distance, generate uniform fusion node set;On this basis, merge each original topology branch, form fusion parent topology, and identify common branch and difference branch through branch appearance vector;With the goal of restoring each original topology and reducing the number of switches, configure mode switch, express each original topology as target switch state;When topology is switched online, generate candidate action batch, perform power flow safety check on transition state, and output switch timing that meets safety constraints and has fewer batch numbers.

Description

Technical Field

[0001] This invention belongs to, but is not limited to, the fields of distribution network operation control, reconfigurable network design, topology optimization, switch control and power flow safety verification, and particularly relates to a method and system for constructing a converged distribution network topology for multi-mode switching, minimum switch configuration and safe switching timing optimization. Background Technology

[0002] With the increasing application of distributed power sources, flexible loads, energy storage devices, and multi-mode operating platform networks, distribution networks no longer maintain a single fixed topology. Instead, they need to switch between multiple original electrical topologies based on changes in power supply range, load distribution, maintenance status, and operating modes. Existing distribution network topology reconfiguration technologies typically use a known network structure as a basis, adjusting tie switches and sectionalizing switches to obtain a target operating topology that meets power flow, voltage, capacity, or power restoration requirements. Existing switch timing optimization technologies mostly focus on a determined initial and target topology, arranging the sequence of switch actions around loop closing, loop breaking, branch current, node voltage, and power supply connectivity. While these technologies can be effective in single topology reconfiguration or fault recovery scenarios, they typically deal with an existing network and its local switch combinations. Their operational logic mainly focuses on solving for the target topology or selecting the switch operation sequence, failing to adequately address engineering scenarios where multiple original topologies are connected to the same platform network.

[0003] In multi-mode distribution network design, upstream planning or operation tasks may simultaneously provide two or more original electrical topologies. Although each topology has electrical parameters such as node names, equipment numbers, node types, voltage levels, regions, levels, load capacities, and line impedances, the node numbers and branch representations are not necessarily consistent. If, in the traditional approach, an independent network structure is built for each topology and switches and operation schemes are configured separately, identical or similar electrical structures will be duplicated, common lines and nodes cannot be effectively reused, and the boundaries between different branches and common branches will be difficult to define, leading to an increase in the number of switches, higher equipment costs, and more complex operation and maintenance relationships. If a correspondence is established between multiple topologies solely based on manual experience, it is easily affected by changes in node numbers, local branch rearrangements, and non-nested topology structures, making it difficult to stably form a unified parent topology representation.

[0004] On the other hand, even if existing methods can obtain a target topology, they often focus on whether the final state satisfies constraints, while neglecting the continuous transition states that occur during online switching. In practice, after closing or opening batches are executed, the system may briefly enter an intermediate structure different from the initial and target topologies. This intermediate structure may present risks such as power flow non-convergence, branch capacity exceeding limits, node voltage exceeding limits, or load loss within the target topology. Especially in multi-topology switching scenarios with varying numbers of nodes and branch connections that do not have simple inclusion relationships, relying solely on a reconstruction model under a fixed topology or manual switching timing is insufficient to simultaneously guarantee topology reproducibility, fewer switch configurations, and safe transition states. Therefore, there is an urgent need for a closed-loop method that can first perform node compatibility matching and common electrical structure identification on multiple original topologies, then configure mode switches on the fused parent topology, and perform power flow safety verification on each candidate transition state to support the integrated optimization of platform network architecture and online switching timing. Summary of the Invention

[0005] The purpose of this invention is to provide a method and system for constructing a converged distribution network topology, minimizing switch configuration, and optimizing safe switching timing for multi-mode switching. By constructing a converged parent topology, the common and differential branches of multiple original topologies are uniformly expressed, and the online switching problem is transformed into a switch state space search problem with power flow safety constraints, thereby reducing the number of switches, reducing transient power flow pressure, and ensuring strict restoration of the target topology.

[0006] This invention is implemented as follows: a method for constructing a converged distribution network topology for multi-mode switching, optimizing minimum switch configuration, and optimizing safe switching timing. The method includes:

[0007] S1: Obtain two or more original electrical topologies and their node tables, branch tables, equipment types, voltage levels, load capacities, line impedances, branch capacity limits, and operating mode parameters;

[0008] S2: Establish a deterministic matching relationship based on stable node names or device numbers; when node numbers are inconsistent or partial information is missing, further construct a compatibility score based on node type, voltage level, capacity, region, level and electrical distance to generate a unified fusion node set;

[0009] S3: Map the branches of each original topology to a unified fusion node set, construct the fusion parent topology, and establish the occurrence vector of each fusion branch in each original topology;

[0010] S4: Based on the occurrence vector, identify the common branches that are reused in all the original topologies and the differential branches that appear only in a portion of the original topologies, and form a common subgraph and a differential subgraph.

[0011] S5: With the goal of strictly restoring each original topology and minimizing or reducing the number of switches, configure mode switches in the differential branches or differential branch boundaries, and generate common segment candidate switches.

[0012] S6: Represent each original topology as a target switch state vector on the fused parent topology, and model the online switching between any two topologies as a switch state space search problem;

[0013] S7: Generate candidate batches of similar actions during the search process. Each batch contains only closing actions or only opening actions. Execute as many actions as possible when safety constraints are met to reduce the total number of batches.

[0014] S8: Call the power flow solver for each candidate transition state to verify power flow convergence, voltage constraints, branch capacity constraints, power supply continuity of loads within the target topology, and energization constraints of non-target areas;

[0015] S9: Outputs the minimum batch or fewer batches of switch switching timing that meet safety constraints, as well as topology fusion results, switch configuration table, transition state power flow verification table, failure diagnosis table, and, if necessary, auxiliary tie branch suggestions.

[0016] Furthermore, in step S2, the node compatibility score can be calculated as follows:

[0017]

[0018]

[0019] in, Let represent the compatibility between node i and node j. The r-th discrimination factor includes consistency of stable equipment identification, consistency of node type, proximity of voltage level, proximity of capacity, consistency of region, and proximity of level / electrical distance. For the corresponding weights, This is for matching thresholds. This expression avoids hardcoding specific fields into the main formula, making it easier to add or remove discriminant factors later based on the data completeness of Task 3.

[0020] Furthermore, in steps S3 to S4, an occurrence vector is established for any fusion branch e:

[0021]

[0022]

[0023]

[0024]

[0025] in, branch road Pattern appearance vectors in each original topology This represents the original number of topologies; For the collection of public branch roads, For the set of differential branches, To integrate the parent topology. The common subgraph is not limited to the unique maximum common subgraph in the strict graph isomorphism sense, but refers to the maximum common electrical structure that is reused by all original topologies after unified node mapping.

[0026] Furthermore, in step S5, the mode switch configuration satisfies the following optimization relationship:

[0027]

[0028]

[0029]

[0030] Where K is the set of mode switches, For the number of mode switches, For the m-th original topology, Let F be the target switching state of this topology on the fused parent topology, and let F be the mapping from topology to switching state.

[0031] Furthermore, in steps S6 to S8, the switch state space search can employ A* search, Dijkstra's search, or similar methods. t Ra search, dynamic programming search, heuristic search, or a combination thereof. In one implementation, A* search is used and defined as follows:

[0032]

[0033]

[0034]

[0035]

[0036] Where s is the current switch state, s * Let d be the target switch state, d be the Hamming distance, B be the maximum action size in a single batch, and f be the search evaluation function. L represents the number of batches, A represents the number of actions, R represents the branch load rate penalty, D represents the voltage deviation penalty, and Q represents the temporary action penalty of the common sectionalizing switch. to As weight.

[0037] Furthermore, in step S8, the transition state safety set is defined as:

[0038]

[0039]

[0040]

[0041]

[0042]

[0043] in, =0 indicates the power flow equation corresponding to the transient state. For power flow state variables, The node voltage amplitude, For the apparent power of the branch, For the set of safety switch states, This represents the criterion for ensuring the continuity of power supply to loads within the target topology. The embodiment uses MATPOWER for power flow calculations, but the invention is not limited to MATPOWER.

[0044] When the actual branch capacity limit is missing, an estimated limit can be generated by multiplying the maximum value of the ground state power flow of each original topology by a safety margin factor:

[0045]

[0046] This estimated limit is only used for algorithm screening and case verification before the actual parameters of Task 3 are reached, and does not replace the actual equipment thermal stability limit or protection setting.

[0047] Another objective of this invention is to provide a distribution network safety switching timing optimization method for multi-mode switching, comprising the following steps: obtaining the target switch states corresponding to the fused parent topology and two original electrical topologies, wherein the fused parent topology is formed by node compatibility matching and branch merging of two or more original electrical topologies; modeling the online switching between the two target switch states as a switch state space search problem; generating candidate action batches based on the current switch state and the target switch state; calling a power flow solver to perform safety verification on the transition state formed after the candidate action batches are executed; selecting the switching path with fewer batches from the candidate action batches that meet the safety constraints; and outputting the switch switching timing according to the switching path.

[0048] Furthermore, the switch state space search employs one or more of the following: A-star search, Dijkstra's search, dynamic programming search, and heuristic search.

[0049] Furthermore, the same candidate action batch may contain only closing actions or only opening actions, and the candidate action batch that can execute a larger number of switches simultaneously shall be selected while meeting safety constraints.

[0050] Furthermore, the security verification includes power flow convergence verification, node voltage constraint verification, branch capacity constraint verification, and load power supply continuity verification within the target topology.

[0051] Furthermore, when switching from a topology with a large number of nodes to a topology with a small number of nodes, power loss is allowed in non-target topology areas, but power loss is not allowed in the target topology's internal loads; the common branch section switch, as a controlled candidate switch, only participates in the search when the differential branch mode switch cannot form a switching path that meets the safety constraints, and the final target state is restored to the structure corresponding to the original target topology.

[0052] In combination with the above technical solutions, the significant technical advancements and unexpected effects of this invention are as follows:

[0053] This invention maps multiple original topologies to the same fused parent topology, avoiding the need for independent modeling of each topology and manual design of switching timing for each pair of topologies.

[0054] This invention transforms the original problem of configuring differential branch switches into a problem of configuring mode switches by identifying common and differential branches, thereby reducing the number of switches and construction costs.

[0055] This invention calls the power flow solver state-by-state during the switching timing search, ensuring that the transition topology, rather than just the final topology, satisfies the power flow, voltage, capacity, and power supply continuity constraints.

[0056] This invention allows non-target topology areas to be de-energized during shrinkage switching, while strictly ensuring uninterrupted power supply to loads within the target topology, thus meeting the engineering requirements for multi-mode switching.

[0057] This invention uses common sectionalizing switches and auxiliary connecting branches as controlled backup measures to avoid unnecessary investment caused by defaulting to a large number of new connecting branches.

[0058] The expected benefits and commercial value of the technical solution of this invention after transformation are as follows:

[0059] (1) Support online switching of two or more operating modes on the same platform network, reduce the construction of duplicate network and duplicate switches, and improve the operational flexibility and safe switching capability of the reconfigurable platform.

[0060] (2) The technical solution of the present invention fills the problem of the separation between multi-topology fusion design and switch switching safety verification in the prior art. Existing methods mostly focus on the safety of single topology reconstruction or single switch operation, while the present invention protects a combined technical solution from input topology, fusion parent topology construction, mode switch configuration, transient power flow constraint verification to switching timing output.

[0061] (3) The technical solution of the present invention solves the problem of difficulty in automatically planning online switching between multiple operating modes. Through state space search and transient power flow verification, the system can automatically output the closing and opening batches between different topologies, reducing reliance on manual experience.

[0062] (4) The technical solution of the present invention overcomes the tendency to add a large number of auxiliary connection branches by default in order to improve the switching safety. The auxiliary connection branches are only suggested outputs when the basic mode switch and the common segment candidate cannot meet the constraints or the power flow pressure is too high, and are not used as default construction items.

[0063] This invention does not involve separate distribution network topology reconstruction or separate generation of switch timing sequences. Instead, it first achieves node compatibility matching by stabilizing node names, equipment numbers, and electrical attributes, enabling original topologies under different numbering systems to be mapped to the same fused node set. Then, it distinguishes common and differential branches using branch occurrence vectors, allowing common electrical structures to be reused and differential electrical structures to be centrally incorporated into the mode-based switch control scope, thereby avoiding the redundant construction of independent network structures for each operating mode. Based on this, the invention transforms each original topology into a target switch state on the fused parent topology and performs power flow convergence, voltage, capacity, and power supply continuity verification on each transition state formed by candidate action batches, ensuring that intermediate topologies during switching processes remain within a verifiable safety range. This effect is not simply about reducing the number of switches or simply ensuring the correctness of the target topology, but rather about creating a linkage between topology fusion, switch configuration, and timing selection, enabling topology restoration, equipment simplification, and process safety to be balanced even in non-nested multi-topology scenarios.

[0064] Existing technologies typically follow two paths: one is to find a better reconfiguration scheme in a fixed distribution network structure, and the other is to arrange the switching operation sequence between a known initial topology and a target topology. The former focuses on the final network state and lacks processing for a unified expression of multiple original topologies and the reuse of common structures; the latter focuses on the order of actions and usually assumes that the topology objects are already determined, making it difficult to solve the problem of constructing a parent topology when node numbers are inconsistent, branch relationships are not nested, and different branches exist in a scattered manner. This invention changes the above processing path. First, it establishes a fused parent topology using node compatibility matching and occurrence vectors, then it uniformly expresses different original topologies using the target switching state, and finally it performs power flow safety screening on the transition state in the state space. The logic of this technology is not to simply put conventional topology reconfiguration and conventional switching timing in parallel, but to directly transform the topology structure identification result into the basis for switching configuration, and then use the switching configuration result as the state basis for safe switching search. Even if those skilled in the art master single reconfiguration or timing optimization methods, it is difficult to naturally obtain this closed-loop collaborative mechanism for multiple original topologies. Attached Figure Description

[0065] Figure 1This is a schematic diagram of the multi-topology fusion and mode switching switch timing generation process provided in an embodiment of the present invention;

[0066] Figure 2 This is a schematic diagram of topology fusion and common subgraph identification provided in an embodiment of the present invention;

[0067] Figure 3 This is a schematic diagram of the fusion parent topology and mode switch configuration provided in an embodiment of the present invention;

[0068] Figure 4 This is a schematic diagram of transitional security verification and switching path search provided in an embodiment of the present invention;

[0069] Figure 5 A comparative diagram of 16-node, 24-node, and 33-node input topology structures provided in embodiments of the present invention;

[0070] Figure 6 This is a schematic diagram of online switching timing output provided in an embodiment of the present invention;

[0071] Figure 7 This is a 33-node input topology diagram provided in an embodiment of the present invention;

[0072] Figure 8 This is a non-nested 39-node input topology diagram provided in an embodiment of the present invention;

[0073] Figure 9 The parent topology diagram after the fusion of 33 nodes and 39 nodes is provided in an embodiment of the present invention. Detailed Implementation

[0074] To make the objectives, technical solutions, and advantages of this invention clearer, the invention will be further described in detail below with examples of multi-mode radial distribution networks with 16, 24, and 33 nodes, as well as a comparative example of 33 nodes and non-nested 39 nodes. It should be understood that the specific embodiments described herein are for illustrative purposes only and are not intended to limit the invention.

[0075] Figures 1 to 6 The forward execution sequence of data processing and online switching according to the embodiments of the present invention is arranged to fully illustrate the entire process of multi-mode distribution network from original topology input, fusion parent topology construction, mode switch configuration, transitional safety screening to final switching timing output. Figure 1The diagram illustrates the overall timing generation process. On the left, input topology A, topology B, topology C, and other optional topologies. Each topology includes power supply, bus, branch, load node, and existing switch status. The system first identifies and merges multiple topologies to form a merged parent topology. Then, it configures mode switches at the locations of the different branches. Subsequently, it performs a transitional power flow safety check on the switching action to be executed. Finally, it outputs the online switching timing in the form of a batch table. Figure 2 Further demonstrating the identification relationship of common subgraphs, after node compatibility matching of multiple original topologies, common branches that exist or are stable in different topologies are extracted to form the largest common subgraph, which is used as the basic skeleton of the fusion parent topology; branches that only partially exist in different topologies are identified as differential branches and are retained as candidate branches that need to be controlled in the fusion parent topology. Figure 3 The diagram demonstrates the configuration of mode switches on the fused parent topology. Common branches maintain the basic connectivity of the topology, while different branches are equipped with mode switches K1 to K6. Different combinations of switch states are used to recreate modes A, B, and C. The table in the lower right corner shows the closing or opening status of each mode switch under different modes, illustrating that a fused parent topology can represent multiple original operating topologies. Figure 4 The system demonstrates the power flow safety screening and path search process during transition states. First, it generates closing and opening batches based on the set of controllable switches. Then, it uses the state formed after each action as a node in the state space and performs voltage constraints, current constraints, capacity constraints, connectivity constraints, and power flow calculation verification on the candidate transition states. States that do not meet the constraints are eliminated, while states that meet the constraints enter the safety set. Feasible paths to the target state are then searched within the safety set. Figure 5 The invention provides a comparison of input topologies with 16 nodes, 24 nodes, and 33 nodes to illustrate that the embodiments of the invention can uniformly process input topologies of different scales of distribution networks. Figure 6 The final online switching timing output format is displayed. The initial mode A switches to the target mode B after passing multiple security checks. Each batch specifies the action type, switch set, and check result.

[0076] Figures 7 to 9 To further illustrate, the embodiments of the present invention are not only applicable to multi-topology scenarios where the number of nodes increases progressively and the structure has a simple inclusion relationship, but also applicable to complex scenarios where there are differences in branch paths, node distribution, and branch structure between a 33-node topology and a non-nested 39-node topology. Figure 7 A 33-node input topology is given, which includes power supply nodes, load nodes, generator nodes and inverter nodes. Each node is connected through a main line and multiple branch lines, reflecting the electrical connection relationship under a primitive operating mode. Figure 8A non-nested 39-node input topology is given. Compared with the 33-node topology, this topology does not simply add nodes at the end, but has different connection paths, different node arrangements and new branches at multiple trunk and branch positions, reflecting the multi-mode input characteristics under non-simple containment relationship. Figure 9 The system provides a parent topology structure after merging 33-node and 39-node topologies. The system identifies corresponding nodes and common electrical structures in the two types of topologies through node compatibility matching, and retains the different branches in the merged parent topology. A mode switch is set at the different connection position so that the merged parent topology can restore the 33-node topology and the 39-node topology respectively, and provides a unified state space for subsequent safe switching timing search.

[0077] Example 1: Multi-topology data input and node compatibility matching

[0078] This invention provides three radial distribution network topologies: 16 nodes, 24 nodes, and 33 nodes. Nodes use stable names from BUS01 to BUS33, along with equipment type, voltage level, capacity, and hierarchy information. The system first establishes deterministic matching based on stable names, and then verifies any missing or conflicting node information using a compatibility score, thereby forming a unified, merged node set.

[0079] Example 2: Construction of common subgraph and fused parent topology

[0080] The system maps branches of the three topologies to a unified fusion node set and records the occurrence vector of each branch in the three topologies. Branches appearing in all three topologies form a common subgraph, while branches appearing in some topologies form differential branches. In the current example, the fusion parent topology contains 33 nodes and 32 branches, which can fully support the three original structures of 16 nodes, 24 nodes, and 33 nodes.

[0081] Example 3: Minimum Mode Switch Configuration

[0082] If a naive switch configuration is used for all differential branches, 17 differential branch switches are required. Through group multiplexing relationships and target topology state difference analysis, the system maps differential branches to 6 mode switches, saving 11 switches, with a switch retention rate of approximately 35.29%. Common segment switches are only considered as candidates and do not participate in the first-level search.

[0083] Example 4: Inter-topology switch switching timing search

[0084] The system represents each topology as a switch state vector on a fused parent topology and performs a state space search for switching between any two topologies. Candidate actions are generated according to the principle of the same batch and the same type, that is, only closing or opening is performed in the same batch, and as many actions as possible are performed when the power flow safety constraints are satisfied, so as to reduce the number of batches.

[0085] Example 5: MATPOWER Transition State Security Verification

[0086] For each candidate transition state, the system constructs a corresponding MATPOWER case and performs power flow calculations to verify power flow convergence, voltage upper and lower limits, branch capacity utilization, power supply continuity of loads within the target topology, and the energized state of non-target areas. For shrinking switches such as switching from 33 nodes to 16 nodes, power loss in non-target areas is allowed, but power loss of loads within the 16-node target topology is not permitted.

[0087] Example 6: Controlled backup strategy for common sectionalizing switch and auxiliary interconnection branch

[0088] Basic search prioritizes using only differential branch mode switches. The system only allows common segment candidate switches to temporarily participate in the search when a safe path cannot be found at the basic layer. Auxiliary link branches are not built by default; suggestions are only output when constraints cannot be met at both the basic and common segment layers, or when transitional power flow pressure is too high. The current example does not trigger auxiliary link branch suggestions.

[0089] Example 7: Verification of fusion and switching between 33-node and non-nested 39-node topologies

[0090] To avoid examples that only demonstrate a gradual increase in nodes or a nested topology, this embodiment uses a 33-node topology and an independently constructed 39-node radial topology for verification. The 39-node topology is not formed by adding nodes or branches to the 33-node topology, but rather by reorganizing the trunk line and branch structure under the premise that stable device names can be matched, so that the two only share some common branches.

[0091] The system first performs node compatibility matching based on the stable node name, equipment type, voltage level, capacity, region, and level information. Then, it identifies the common and different branches of the 33-node topology and the 39-node topology on the unified fusion node set, generates a fusion parent topology, and represents the two original topologies as the target switch states on the fusion parent topology.

[0092] During the switching timing solution phase, the system generates candidate batches based on the principle of actions of the same type within the same batch, and verifies each candidate transition state by calling power flow calculation. Verification results show that, without the default addition of auxiliary tie branches, safe switching paths that meet power flow, voltage, and branch capacity constraints can be obtained in both directions from node 33 to node 39 and from node 39 to node 33.

[0093] Evidence related to the technical effects obtained by the embodiments of the present invention:

[0094] To verify the effectiveness of the embodiments of the present invention in multi-mode topology fusion, mode switch configuration, and safe switching timing generation, software simulation is used for verification. The simulation is not intended to represent the results of field hardware tests, but rather to illustrate that, given nodes, branches, and operating parameters, the method of the embodiments of the present invention can output reproducible fused parent topology, switch configuration results, and power flow-verified switching paths.

[0095] I. Simulation Verification Environment and Evaluation Indicators

[0096] Simulation inputs include node tables, branch tables, node types, voltage levels, load capacities, line impedances, and normal switching states for each original topology. The system generates branch occurrence vectors on the unified fused node set and identifies common and differential branches accordingly. Subsequently, it constructs target switching states on the fused parent topology and performs safety checks on each transition state formed by candidate switching batches using power flow calculations.

[0097]

[0098] II. Verification of the Fusion of 16-node, 24-node, and 33-node Modes

[0099] This example only includes three input topologies: 16-node, 24-node, and 33-node. All three topologies are radial distribution networks. The 16-node topology serves as a common skeleton, the 24-node topology adds several branches to the common skeleton, and the 33-node topology further adds branches to the 24-node topology. After performing node compatibility matching, common branch identification, and differential branch identification on the three topologies, the system forms a fused parent topology capable of reconstructing the three operating modes.

[0100]

[0101] As can be seen from the table, the embodiments of the present invention do not set independent switches for each of the different branches, but instead use the grouped access relationship of the different branches to configure mode switches, so that the basic switch requirements corresponding to the 17 different branches are compressed into 6 mode switches, reducing 11 switches while maintaining the strict restoration of the three original topologies.

[0102]

[0103] In all six directed switching scenarios described above, safe paths were found in the base layer search, and no suggestions for adding auxiliary communication branches were triggered. Power flow converged in each transition state, with the lowest voltage not lower than 0.999409 pu and the maximum branch capacity utilization not exceeding 0.800000, indicating that the embodiments of the present invention can simultaneously meet the requirements of topology restoration, batch output, and transition state safety verification during multi-mode switching.

[0104] III. Supplementary Verification of the 33-Node and Non-Nested 39-Node Topologies

[0105] To further illustrate that the embodiments of the present invention do not rely on simple node extension relationships, a 33-node topology and a non-nested 39-node topology are used for supplementary verification. This 39-node topology is a self-built radial topology used to verify the non-nested structure. Its purpose is to test whether the embodiments of the present invention can still complete the construction of the fusion parent topology, the configuration of mode switches, and the generation of safe switching timing when the common structure is limited and the differential branches are dispersed.

[0106]

[0107]

[0108] Supplementary verification shows that, without the default addition of new auxiliary connection branches, safe switching paths can be obtained in both directions: from node 33 to node 39 and from node 39 to node 33. Although the common segment switch is listed as a candidate resource, the actual switching path does not call the common segment switch. The final configuration table only retains the four mode switches that have actually been activated, avoiding the misclassification of unused candidate resources as mandatory switches.

[0109] IV. Explanation based on the renderings

[0110]

[0111] In summary, the software simulation results support the technical effects of the embodiments of the present invention from three aspects: structural reuse, reduction of the number of switches, and safety of transition states. First, common nodes and common branches are uniformly mapped to the fused parent topology, avoiding redundant modeling. Second, different branches are controlled in groups by mode switches, compressing 17 naive switches to 6 in the three-mode example and 40 naive switches to 4 in the non-nested 33 / 39 example. Third, all listed directed switching paths have passed power flow convergence, voltage and capacity constraint verification, proving that the method can output executable and safe switching timing.

[0112] It should be noted that embodiments of the present invention can be implemented using hardware, software, or a combination of both. The software portion can be stored in memory and executed by an appropriate instruction execution system. Those skilled in the art will understand that the above-described devices and methods can be implemented using computer-executable instructions and / or included in processor control code.

[0113] The above description is merely a specific embodiment of the present invention, but the scope of protection of the present invention is not limited thereto. Any modifications, equivalent substitutions, and improvements made by those skilled in the art within the scope of the technology disclosed in the present invention, and within the spirit and principles of the present invention, should be included within the scope of protection of the present invention.

Claims

1. A method for constructing a converged distribution network topology and configuring mode switching for multi-mode switching, characterized in that, The method includes: S1: Obtain two or more original electrical topologies and their node tables, branch tables, equipment types, voltage levels, load capacities, line impedances, branch capacity limits, and operating mode parameters; S2: Establish a deterministic matching relationship based on stable node names or device numbers; when node numbers are inconsistent or partial information is missing, further construct a compatibility score based on node type, voltage level, capacity, region, level and electrical distance to generate a unified fusion node set; S3: Map the branches of each original topology to a unified fusion node set, construct the fusion parent topology, and establish the occurrence vector of each fusion branch in each original topology; S4: Based on the occurrence vector, identify the common branches that are reused in all the original topologies and the differential branches that appear only in a portion of the original topologies, and form a common subgraph and a differential subgraph. S5: With the goal of strictly restoring each original topology and minimizing or reducing the number of switches, configure mode switches in the differential branches or differential branch boundaries, and generate common segment candidate switches. S6: Represent each original topology as a target switch state vector on the fused parent topology, and model the online switching between any two topologies as a switch state space search problem; S7: Generate candidate batches of similar actions during the search process. Each batch contains only closing actions or only opening actions. Execute as many actions as possible when safety constraints are met to reduce the total number of batches. S8: Call the power flow solver for each candidate transition state to verify power flow convergence, voltage constraints, branch capacity constraints, power supply continuity of loads within the target topology, and energization constraints of non-target areas; S9: Outputs the minimum batch or fewer batches of switch switching timing that meet safety constraints, as well as topology fusion results, switch configuration table, transition state power flow verification table, failure diagnosis table, and, if necessary, auxiliary tie branch suggestions.

2. The method according to claim 1, characterized in that, In step S2, the node compatibility score can be calculated as follows: ； ； in, Let represent the compatibility between node i and node j. The r-th discrimination factor includes consistency of stable equipment identification, consistency of node type, proximity of voltage level, proximity of capacity, regional consistency, and proximity of hierarchical / electrical distance. For the corresponding weights, This is for matching thresholds. This expression avoids hardcoding specific fields into the main formula, making it easier to add or remove discriminant factors later based on the data completeness of Task 3.

3. The method according to claim 1, characterized in that, In steps S3 to S4, an occurrence vector is established for any fusion branch e: ； ； ； ； in, branch road Pattern appearance vectors in each original topology This represents the original number of topologies; For the collection of public branch roads, For the set of differential branches, To integrate the parent topology; the common subgraph is not limited to the unique maximum common subgraph in the strict graph isomorphism sense, but refers to the maximum common electrical structure that is reused by all original topologies after unified node mapping.

4. The method according to claim 1, characterized in that, In step S5, the mode switch configuration satisfies the following optimization relationship: ； ； ； Where K is the set of mode switches, Number of mode switches For the m-th original topology, Let F be the target switching state of this topology on the fused parent topology, and let F be the mapping from topology to switching state; In steps S6 to S8, the switch state space search can employ A* search, Dijkstra's search, or similar methods. t Ra search, dynamic programming search, heuristic search, or a combination thereof; using A* search and defining it as follows: ； ； ； ； Where s is the current switch state, s * For the target switch state, d is the Hamming distance, B is the maximum action size in a single batch, f is the search evaluation function; L represents the number of batches, A represents the number of actions, R represents the branch load rate penalty, D represents the voltage deviation penalty, and Q represents the temporary action penalty of the common sectionalizing switch. to As weight.

5. The method according to claim 1, characterized in that, In step S8, the transition state safety set is defined as: ； ； ； ； ； in, =0 indicates the power flow equation corresponding to the transient state. For power flow state variables, The node voltage amplitude, For the apparent power of the branch, For the set of safety switch states, This represents the criterion for determining the continuity of power supply to loads within the target topology. When the actual branch capacity limit is missing, an estimated limit can be generated by multiplying the maximum value of the ground state power flow of each original topology by a safety margin factor: ； This estimated limit is only used for algorithm screening and case verification before the actual parameters of Task 3 are reached, and does not replace the actual equipment thermal stability limit or protection setting.

6. A method for optimizing the timing of safe switching in a distribution network for multi-mode switching, characterized in that, The process includes the following steps: obtaining the target switch states corresponding to the fused parent topology and two original electrical topologies, wherein the fused parent topology is formed by node compatibility matching and branch merging of two or more original electrical topologies; modeling the online switching between the two target switch states as a switch state space search problem; generating candidate action batches based on the current switch state and the target switch state; calling the power flow solver to perform safety verification on the transition state formed after the candidate action batches are executed; selecting the switching path with fewer batches from the candidate action batches that meet the safety constraints; and outputting the switch switching sequence according to the switching path.

7. The method according to claim 6, characterized in that, The switch state space search employs one or more of the following: A* search, Dijkstra's search, dynamic programming search, and heuristic search.

8. The method according to claim 6, characterized in that, Within the same candidate action batch, there may be only closing actions or only opening actions, and the candidate action batch with a larger number of switches that can be executed simultaneously shall be selected, provided that safety constraints are met.

9. The method according to claim 6, characterized in that, The security verification includes power flow convergence verification, node voltage constraint verification, branch capacity constraint verification, and load power supply continuity verification within the target topology.

10. The method according to claim 6, characterized in that, When switching from a topology with a large number of nodes to a topology with a small number of nodes, power loss is allowed in non-target topology areas, but power loss is not allowed in the target topology. The common branch section switch, as a controlled candidate switch, only participates in the search when the differential branch mode switch cannot form a switching path that meets the safety constraints, and the final target state is restored to the structure corresponding to the original target topology.

Images