Power distribution network topology verification method and system based on breadth-first search algorithm

Abstract

The invention discloses a power distribution network topology verification method based on a breadth-first search algorithm. The method comprises the following steps: step S101, constructing a topology model according to actual data of a power distribution network; step S102, using a breadth-first search algorithm to search from a starting node of the power distribution network; s103, in the breadth-first search process, the system can detect isolated nodes, loops and open circuits at the same time; and S104, after basic topology verification is completed, the system further detects whether redundant redundant connection exists in the power distribution network, and the invention further provides a verification system using the method. According to the method, multiple branches can be detected at the same time, once a certain branch goes wrong, traversal can be continued through other branches, the fault-tolerant capability of the verification process is improved, and the method is easy to implement, has good expansibility, is suitable for power distribution networks of different scales, can be combined with optimization algorithms such as artificial intelligence and the like, and has good application prospects. And the intelligent level of verification is further improved.

Description

Technical Field

[0001] The present application relates to the technical field of distribution network topology, and in particular to a distribution network topology verification method and system based on a breadth-first search algorithm. Background Art

[0002] With the rapid development of social economy and the acceleration of urbanization, the demand for electricity continues to grow. As the infrastructure of modern society, the safety, stability and efficiency of the power system are particularly important. As the key link connecting power sources and users in the power system, the complexity and importance of the distribution network are increasing. The reliability and operation efficiency of the distribution network directly affect the quality of power supply, and have an important impact on the development of social economy and the stability of residents' lives. Therefore, the distribution network must be strictly verified in all aspects of planning, design and operation to ensure that it meets the design specifications and actual operation requirements.

[0003] During the planning and design phase of the distribution network, it is usually necessary to design the network topology in detail. The topology describes the connection relationship between the nodes in the distribution network (such as substations, distribution transformers, switches, load nodes, etc.). A reasonable topology should ensure the reliable transmission and distribution of electricity, and have good fault tolerance so that the system can still maintain basic power supply functions in the event of a fault. In addition, the topology should be as simple as possible to facilitate maintenance and management.

[0004] Traditional topology verification methods mainly rely on manual inspection or semi-automatic tools, usually based on design drawings and operation data, through manual logical judgment and structural analysis. However, with the expansion of the scale of distribution networks and the complexity of their structures, the efficiency and accuracy of manual inspection are limited. This method is not only time-consuming and labor-intensive, but also prone to human omissions. Especially when dealing with large-scale distribution networks, incorrect verification may lead to serious consequences such as power outages and large-scale power outages. Summary of the invention

[0005] The purpose of the present invention is to provide a distribution network topology verification method and system based on a breadth-first search (BFS) algorithm, aiming to improve the efficiency and accuracy of distribution network topology verification and better adapt to the complex structure and verification requirements of modern distribution networks.

[0006] The present invention is implemented by the following technical means: a distribution network topology verification method based on a breadth-first search algorithm, comprising the following steps:

[0007] Step S101, constructing a topology model according to actual data of the distribution network;

[0008] Step S102, using a breadth-first search algorithm from the starting node of the distribution network;

[0009] Step S103, during the breadth-first search, the system will simultaneously detect isolated nodes, loops, and breaks;

[0010] Step S104, after completing the basic topology check, the system will further detect whether there are any redundant connections in the distribution network;

[0011] In step S101, the power grid topology model is:

[0012] G=(V,E),

[0013] Where: V is a node set, representing all nodes in the distribution network; E is an edge set, representing the lines connecting these nodes; each edge e∈E is connected by a pair of nodes (u,v), where u,v∈V.

[0014] In step S102, the basic steps of the breadth-first search include the following:

[0015] Initialize a queue Q to store the nodes to be traversed;

[0016] Select a starting node v0, put it into the queue, and set it to the "visited" state, that is, Q = {v0}. If the queue is not empty, take a node v from the head of the queue Q;

[0017] Traverse all adjacent nodes u of node v. For each adjacent node u, if its status is "unvisited", add it to the queue and mark it as "visited";

[0018] When all adjacent nodes of node v have been processed, mark node v as "completed";

[0019] When the queue Q is empty and all nodes are marked as "completed", the algorithm ends; if there are still nodes that have not been visited at this time, it means that there are isolated nodes or broken circuits in the topology structure.

[0020] In step S103, the isolated node is a node that is still in the "unvisited" state after the breadth-first search. The judgment logic is:

[0021] The loop detection method described in step 103 is to detect whether there is a node that is visited multiple times in the distribution network, and its judgment logic is u∈BFS(G,v0)and u≠Predecessor(v).

[0022] The disconnection detection described in step 103 is confirmed by the node reachability matrix:

[0023] R(u,v)=0,for some u,v∈V

[0024] R(u,v) represents the reachability between node u and node v. If R(u,v)=0, it means that the path between nodes u and v is interrupted in the topology structure.

[0025] The redundant edges in step 104 are determined using the Dijkstra algorithm, namely:

[0026] min{Length(P(u,v))}does not use e uv

[0027] The edge e uv Connect nodes u and v. If the formula holds, then edge e uv This is a redundant edge.

[0028] The method also includes a step of automatically updating a distribution network topology model. The automatically updated model is a topology model G(t)=(V(t), E(t)) updated over time, where t is a time parameter. When a topology change is detected, the BFS algorithm is re-executed to verify whether the new topology structure meets the design requirements.

[0029] After completing the topology check, a comprehensive check report is generated. The report lists in detail all the anomalies found and the corresponding corrective measures and optimization suggestions. The key content in the check result report is displayed in the form of an adjacency matrix, specifically:

[0030]

[0031] The above-mentioned method marks all problem nodes and connections.

[0032] A distribution network topology verification device based on a breadth-first search algorithm comprises the following structure:

[0033] Data input module: responsible for receiving the data of the distribution network topology map and performing data format conversion, data cleaning and data verification on the data of the distribution network topology map;

[0034] Algorithm execution module: used to implement distribution network topology verification based on breadth-first search algorithm;

[0035] Connectivity check module: used to verify the connectivity of the distribution network topology, ensure that all vertices can access each other through paths, prevent disconnected or isolated parts, and ensure the structural integrity of the distribution network;

[0036] Loop detection module: The loop detection module checks whether there is a loop during the breadth-first search algorithm, records the starting and ending points of the loop, and provides detailed loop information to help users find and solve problems that may cause short circuits or current loops;

[0037] Error detection and correction suggestion module: used to classify the detected distribution network topology errors and provide specific correction suggestions for each error type;

[0038] Result Analysis Module: used to generate a detailed verification report that lists all problems found, including the specific location and type of loops, isolated vertices and disconnected connections. The report also includes the possible causes of the problems and recommended corrective actions;

[0039] Report generation module: used to convert the output of the result analysis module into user-friendly reports, such as text, graphics and tables, to meet the needs of different users;

[0040] User interface module: used to provide an interactive interface that enables users to easily operate the system, view calibration results and generate reports;

[0041] Integration and management module: responsible for the overall coordination, configuration and maintenance of the system.

[0042] A computer device comprises a memory and a processor, wherein the memory stores a computer program, and is characterized in that the memory stores the computer program, and when the processor executes the computer program, it implements any one of the aforementioned distribution network topology verification methods based on a breadth-first search algorithm.

[0043] A computer-readable storage medium having a computer program stored thereon, wherein the storage medium includes a stored program, wherein when the program is run, the device where the storage medium is located is controlled to execute any of the aforementioned methods for verifying distribution network topology based on a breadth-first search algorithm.

[0044] This method can detect multiple branches at the same time. Once a problem occurs in a branch, it can continue to traverse through other branches to improve the fault tolerance of the verification process. The present invention is simple to implement and has good scalability, and is suitable for distribution networks of different sizes. In addition, it can also be combined with optimization algorithms such as artificial intelligence to further improve the intelligence level of verification. BRIEF DESCRIPTION OF THE DRAWINGS

[0045] Figure 1 A flow chart of a distribution network topology verification method based on a breadth-first search algorithm provided in an embodiment of the present application;

[0046] Figure 2 A workflow diagram between modules of a distribution network topology verification system based on a breadth-first search algorithm provided in an embodiment of the present application. DETAILED DESCRIPTION

[0047] The present invention is further described in detail below in conjunction with the accompanying drawings:

[0048] The present invention relates to a distribution network topology verification method based on a breadth-first search algorithm. Figure 1 As shown, the following steps are included:

[0049] Step S101, construct a topology model based on the actual data of the distribution network, which includes collecting all relevant node information (such as substations, switches, lines, etc.) and the connection relationships between them, and integrating this information into a graph structure. This step ensures that the physical and logical structure of the distribution network is accurately represented in the model, providing a basis for subsequent algorithm verification;

[0050] Step S102, using a breadth-first search algorithm, the breadth-first search (BFS) algorithm starts from the starting node of the distribution network (such as the main substation) and traverses the entire topology layer by layer. The BFS algorithm can ensure that the traversal process is carried out according to the node level, which helps to clearly grasp the hierarchical structure of the distribution network and lays the foundation for subsequent topology verification (such as detecting isolated nodes, loops, circuit breaks, etc.);

[0051] Step S103, during the breadth-first search, the system will simultaneously perform detection of isolated nodes, loops and broken circuits. Specifically, the isolated node detection is to check all nodes that have not been visited during the traversal process. These nodes may be isolated due to the lack of physical connection or incorrect configuration;

[0052] The loop detection is to detect whether there is a loop in the distribution network by checking whether the node has been accessed multiple times. The loop will cause the current flow to be uncertain, affecting the safety and stability of the system;

[0053] The circuit break detection is to check whether there are unconnected nodes or edges in the topology to identify potential circuit break problems. Circuit breakage will cause power supply interruption in some areas and need to be repaired in time;

[0054] Step S104: After completing the basic topology check, the system will further detect whether there are any redundant connections in the distribution network. Redundant connections may increase the complexity of the distribution network, cause unnecessary power loss or increase the risk of failure. The system will identify these unnecessary connections and recommend optimization or removal to ensure the simplicity and efficiency of the distribution network.

[0055] In step S101 of the present invention, the power grid topology model is:

[0056] G=(V,E),

[0057] Where: V is a node set, representing all nodes in the distribution network; E is an edge set, representing the lines connecting these nodes; each edge e∈E is connected by a pair of nodes (u,v), where u,v∈V.

[0058] More specifically, in step S102, the basic steps of the breadth-first search include the following:

[0059] Initialize a queue Q to store the nodes to be traversed;

[0060] Select a starting node v0, put it into the queue, and set it to the "visited" state, that is, Q = {v0}. If the queue is not empty, take a node v from the head of the queue Q;

[0061] Traverse all adjacent nodes u of node v. For each adjacent node u, if its status is "unvisited", add it to the queue and mark it as "visited";

[0062] When all adjacent nodes of node v have been processed, mark node v as "completed";

[0063] When the queue Q is empty and all nodes are marked as "completed", the algorithm ends; if there are still nodes that have not been visited at this time, it means that there are isolated nodes or broken circuits in the topology structure.

[0064] Furthermore, in step S103 of the present invention, the isolated node is a node that is still in the "unvisited" state after the breadth-first search, and its judgment logic is:

[0065] Furthermore, the loop detection method described in step 103 of the present invention is to detect whether there is a node that is visited multiple times in the distribution network, and its judgment logic is u∈BFS(G,v0)and u≠Predecessor(v).

[0066] Furthermore, the disconnection detection in step 103 of the present invention is confirmed by a node reachability matrix:

[0067] R(u,v)=0,for some u,v∈V

[0068] R(u,v) represents the reachability between node u and node v. If R(u,v)=0, it means that the path between nodes u and v is interrupted in the topology structure.

[0069] Furthermore, the redundant edges in step 104 are determined using the Dijkstra algorithm, that is:

[0070] min{Length(P(u,v))}does not use e uv

[0071] The edge e uv Connect nodes u and v. If the formula holds, then edge e uv This is a redundant edge.

[0072] In the present invention, the topology of the power grid may change with the passage of time and the change of operating conditions. Therefore, the system has the function of dynamic verification and adjustment, that is, creating a model that is automatically updated when the topology changes, and re-executing the verification process. This step ensures that the topology model of the distribution network is always consistent with the actual situation, and improves the real-time performance and reliability of the system.

[0073] Specifically, the automatic update model is a topology model G(t)=(V(t), E(t)) updated over time, where t is a time parameter. When a topology change is detected, the BFS algorithm is re-executed to verify whether the new topology structure meets the design requirements.

[0074] After completing the topology check, the present invention generates a comprehensive check report, which lists in detail all the anomalies found (such as isolated nodes, loops, disconnections and redundant connections, etc.) and the corresponding correction measures and optimization suggestions. The key content in the check result report is displayed in the form of an adjacency matrix, specifically:

[0075]

[0076] The above-mentioned method marks all problem nodes and connections.

[0077] The present invention also includes a distribution network topology verification device based on a breadth-first search algorithm, such as Figure 2 As shown, it includes the following structure:

[0078] Data input module: responsible for receiving the data of the distribution network topology map and performing data format conversion, data cleaning and data verification on the data of the distribution network topology map; data format conversion converts the input raw data into an internal data structure that the system can process. Data cleaning is responsible for identifying and repairing errors or inconsistencies in the data, such as duplicate data, missing data, etc. Data verification ensures the integrity and accuracy of the input data to ensure the correct operation of subsequent algorithms;

[0079] The data input module is the basic module of the system, responsible for receiving and processing raw data from the distribution network. This module can import information from various data sources, including distribution network nodes, lines, switches and their connection relationships. By parsing and standardizing these data, the data input module converts them into a format suitable for topology model construction, providing accurate basic data for subsequent topology verification;

[0080] Algorithm execution module: used to implement distribution network topology verification based on breadth-first search algorithm. BFS algorithm is used in graph theory to traverse all vertices and edges of a graph, with low time complexity and high efficiency. The algorithm execution module is the core part of the system, responsible for implementing the breadth-first search (BFS) algorithm to traverse and analyze the distribution network topology. Starting from the specified starting node (such as the main substation), the module scans each node and edge in the topology structure layer by layer. Through the traversal process, the algorithm execution module can generate a topology diagram of the distribution network and provide a basis for subsequent connectivity checks, loop detection and other verification operations.

[0081] Connectivity check module: used to verify the connectivity of the distribution network topology diagram, ensure that all vertices can access each other through paths, prevent disconnected or isolated parts, and ensure the structural integrity of the distribution network; the connectivity check module uses the topological information generated by the algorithm execution module. This module checks the connection of all nodes and edges, identifies isolated nodes and unconnected areas. The purpose of the connectivity check is to ensure the integrity of the distribution network structure, detect potential topological breaks or isolation phenomena, and pass this information to the error detection and correction suggestion module;

[0082] Loop detection module: The loop detection module checks whether there is a loop during the breadth-first search algorithm, records the starting and ending points of the loop, and provides detailed loop information to help users find and solve problems that may cause short circuits or current loops; this module uses the access paths recorded during the topology traversal process to analyze whether there is repeated access to nodes or repeated use of edges, thereby determining the existence and location of loops, and providing relevant information to the error detection and correction suggestion module

[0083] Error detection and correction suggestion module: used to classify the detected distribution network topology errors and provide specific correction suggestions for each error type; the error detection and correction suggestion module integrates the analysis results from the connectivity check module and the loop check module to perform comprehensive error analysis and diagnosis. This module can not only identify common problems such as isolated nodes, circuit breaks and loops, but also make correction suggestions based on the detection results, including but not limited to optimizing node connections, adjusting line configurations, etc. By providing specific repair plans and suggestions, this module helps maintenance personnel quickly locate problems and take measures to improve the reliability and stability of the distribution network;

[0084] Result Analysis Module: used to generate a detailed verification report that lists all problems found, including the specific location and type of loops, isolated vertices and disconnected connections. The report also includes the possible causes of the problems and recommended corrective actions;

[0085] Report generation module: used to convert the output of the result analysis module into user-friendly reports, such as text, graphics and tables, to meet the needs of different users;

[0086] The result analysis and report generation module is responsible for collating and presenting the results of the entire topology verification process. Based on the data and analysis results provided by other modules, this module generates a detailed inspection report, which covers the type of problems found, their location, severity, and correction suggestions. The report can be presented in the form of graphics and text, which is convenient for operation and maintenance personnel to quickly understand and make decisions. This module also supports customized report output, and generates documents in different formats according to user needs, providing strong support for the management and maintenance of the distribution network;

[0087] User interface module: provides an interactive interface that allows users to easily operate the system, view verification results, and generate reports. The main functions include: Data import: supports multiple data import methods, such as file upload, data interface, etc. Users can choose the appropriate import method according to their needs; Result display: displays the distribution network topology and verification results in a visual manner. Users can view error highlights and problem marks in the topology map through the interface; Interactive operation: allows users to interact with the verification results, such as viewing detailed information, adjusting parameters, exporting reports, etc. The user interface module is designed to provide a friendly and intuitive operating experience, and improve user efficiency and satisfaction with the distribution network topology verification system;

[0088] Integration and management module: responsible for the overall coordination, configuration and maintenance of the system. The main functions include: Module integration: ensure the smooth data flow and efficient collaboration between functional modules. The system integration and management module coordinates the work of each module and optimizes system performance; System configuration: provides system settings and parameter configuration functions, such as algorithm parameter adjustment, data format setting, etc. Users can customize system configuration according to their needs; Performance optimization: monitor the system operation status, perform performance tuning and troubleshooting. The system integration and management module ensures the stability and efficient operation of the system.

[0089] The present invention also provides a computer device, including a memory and a processor, wherein the memory stores a computer program, and is characterized in that the memory stores the computer program, and when the processor executes the computer program, it implements any of the above-mentioned distribution network topology verification methods based on a breadth-first search algorithm.

[0090] The present invention also provides a computer-readable storage medium having a computer program stored thereon, wherein the storage medium includes a stored program, wherein when the program is running, the device where the storage medium is located is controlled to execute any of the aforementioned distribution network topology verification methods based on a breadth-first search algorithm.

Claims

1. A distribution network topology verification method based on a breadth-first search algorithm, characterized in that: The following steps are involved: Step S101, constructing a topology model according to actual data of the distribution network; Step S102, using a breadth-first search algorithm from the starting node of the distribution network; Step S103, during the breadth-first search, the system will simultaneously detect isolated nodes, loops, and breaks; Step S104, after completing the basic topology check, the system will further detect whether there are any redundant connections in the distribution network; In step S101, the power grid topology model is: G=(V,E), Where: V is a node set, representing all nodes in the distribution network; E is an edge set, representing the lines connecting these nodes; each edge e∈E is connected by a pair of nodes (u,v), where u,v∈V.

2. The method for verifying the topology of a distribution network based on a breadth-first search algorithm according to claim 1, characterized in that: In step S102, the basic steps of the breadth-first search include the following: Initialize a queue Q to store the nodes to be traversed; Select a starting node v0, put it into the queue, and set it to the "visited" state, that is, Q = {v0}. If the queue is not empty, take a node v from the head of the queue Q; Traverse all adjacent nodes u of node v. For each adjacent node u, if its status is "unvisited", add it to the queue and mark it as "visited"; When all adjacent nodes of node v have been processed, mark node v as "completed"; When the queue Q is empty and all nodes are marked as "completed", the algorithm ends; if there are still nodes that have not been visited at this time, it means that there are isolated nodes or broken circuits in the topology structure.

3. A distribution network topology verification method based on a breadth-first search algorithm according to claim 2, characterized in that: In step S103, the isolated node is a node that is still in the "unvisited" state after the breadth-first search, and its judgment logic is:

4. The method for verifying the topology of a distribution network based on a breadth-first search algorithm according to claim 2, characterized in that: The loop detection method described in step 103 is to detect whether there is a node that is visited multiple times in the distribution network, and its judgment logic is u∈BFS(G,v0)and u≠Predecessor(v).

5. The method for verifying the topology of a distribution network based on a breadth-first search algorithm according to claim 2, characterized in that: The disconnection detection described in step 103 is confirmed by the node reachability matrix: R(u,v)=0,for some u,v∈V R(u,v) represents the reachability between node u and node v. If R(u,v)=0, it means that the path between nodes u and v is interrupted in the topology structure.

6. The method for verifying the topology of a distribution network based on a breadth-first search algorithm according to claim 1, characterized in that: The redundant edges in step 104 are determined using the Dijkstra algorithm, namely: min{Length(P(u,v))}does not use e uv The edge e uv Connect nodes u and v. If the formula holds, then edge e uv This is a redundant edge.

7. The method for verifying the topology of a distribution network based on a breadth-first search algorithm according to claim 1, characterized in that: The method also includes a step of automatically updating a distribution network topology model. The automatically updated model is a topology model G(t)=(V(t), E(t)) updated over time, where t is a time parameter. When a topology change is detected, the BFS algorithm is re-executed to verify whether the new topology structure meets the design requirements.

8. The method for verifying the topology of a distribution network based on a breadth-first search algorithm according to claim 1, characterized in that: After completing the topology check, a comprehensive check report is generated. The report lists in detail all the anomalies found and the corresponding corrective measures and optimization suggestions. The key content in the check result report is displayed in the form of an adjacency matrix, specifically: The above-mentioned method marks all problem nodes and connections.

9. A distribution network topology verification system based on a breadth-first search algorithm, characterized in that: Includes the following structure: Data input module: responsible for receiving the data of the distribution network topology map and performing data format conversion, data cleaning and data verification on the data of the distribution network topology map; Algorithm execution module: used to implement distribution network topology verification based on breadth-first search algorithm; Connectivity check module: used to verify the connectivity of the distribution network topology, ensure that all vertices can access each other through paths, prevent disconnected or isolated parts, and ensure the structural integrity of the distribution network; Loop detection module: The loop detection module checks whether there is a loop during the breadth-first search algorithm, records the starting and ending points of the loop, and provides detailed loop information to help users find and solve problems that may cause short circuits or current loops; Error detection and correction suggestion module: used to classify the detected distribution network topology errors and provide specific correction suggestions for each error type; Result Analysis Module: used to generate a detailed verification report that lists all problems found, including the specific location and type of loops, isolated vertices and disconnected connections. The report also includes the possible causes of the problems and recommended corrective actions; Report generation module: used to convert the output of the result analysis module into user-friendly reports, such as text, graphics and tables, to meet the needs of different users; User interface module: used to provide an interactive interface that enables users to easily operate the system, view calibration results and generate reports; Integration and management module: responsible for the overall coordination, configuration and maintenance of the system.

10. A computer device, characterized in that: The method comprises a memory and a processor, wherein the memory stores a computer program, and is characterized in that the memory stores a computer program, and when the processor executes the computer program, a distribution network topology verification method based on a breadth-first search algorithm as described in any one of claims 1 to 8 is implemented.

11. A computer-readable storage medium having a computer program stored thereon, characterized in that: The storage medium includes a stored program, wherein when the program is running, the device where the storage medium is located is controlled to execute a distribution network topology verification method based on a breadth-first search algorithm according to any one of claims 1 to 8.

Images