Power distribution network dynamic topology updating system and method based on DFS, equipment and medium

Abstract

The invention provides a DFS-based power distribution network dynamic topology updating system and method, equipment and medium, and the system comprises a sub-graph division module which is used for determining a local sub-graph based on an initial whole network model and a power distribution network abnormal event, and the initial whole network model comprises the local sub-graph; the incremental DFS execution module is in communication connection with the sub-graph division module and is used for performing depth-first search on the local sub-graphs to obtain target sub-graphs and performing topological splicing on the basis of the obtained non-dynamic region topological data and the target sub-graphs to obtain a target whole network model, the initial whole network model is composed of local sub-graphs and non-dynamic region topological data. According to the technical scheme provided by the embodiment of the invention, only the local sub-graph is subjected to depth-first search to obtain the target sub-graph, and the target whole network model is obtained based on the target sub-graph and the non-dynamic region topological data, so that the topology required to be updated can be reduced, the calculation amount and the calculation time are reduced, the response delay is reduced, and the real-time requirement is met.

Description

TECHNICAL FIELD

[0001] The present application relates to the technical field of power distribution network topology updating, in particular to a DFS-based power distribution network dynamic topology updating system, method, device and medium. BACKGROUND

[0002] In traditional power distribution network modeling, depth-first search (DFS) is usually used for full-network topology traversal to generate connectivity analysis results. However, after dynamic scenarios such as load fluctuation, distributed power supply access, and switch state change occur, topology updating needs to be performed to obtain a new full-network model, so as to generate accurate connectivity analysis results, wherein the full-network model is a topology model of the power distribution network.

[0003] In the prior art, static DFS is adopted, and after each dynamic scenario of the power distribution network occurs, the power distribution network is forced to perform full-network topology updating, and global DFS traversal is performed to generate a new full-network model. However, the local dynamic scenario of the power distribution network forces global topology updating, which leads to waste of computing resources of the central server and high response delay, and it is difficult to meet the real-time requirement. SUMMARY

[0004] The present application aims to at least solve one of the technical problems existing in the prior art. To this end, the present application proposes a DFS-based power distribution network dynamic topology updating system, method, device and medium, which can only update the local topology that has changed, thereby reducing the required computing resources and reducing the response delay.

[0005] In a first aspect, an embodiment of the present application provides a DFS-based power distribution network dynamic topology updating system, comprising: A subgraph division module, configured to determine a local subgraph based on an initial full-network model and a power distribution network abnormal event, wherein the initial full-network model is a topology model of the power distribution network, the power distribution network abnormal event is a power distribution network event causing the initial full-network model to change, the local subgraph is the smallest connected subgraph affected by the power distribution network abnormal event, and the initial full-network model includes the local subgraph. An incremental DFS execution module, in communication connection with the subgraph division module, configured to perform depth-first search on the local subgraph to obtain a target subgraph, and configured to perform topology splicing based on the obtained non-dynamic region topology data and the target subgraph to obtain a target full-network model, wherein the target full-network model is a topology model of the power distribution network after dynamic updating of the initial full-network model, and the initial full-network model is composed of the local subgraph and the non-dynamic region topology data.

[0006] According to some embodiments of the present application, the subgraph division module comprises a plurality of event trigger nodes, which are configured to determine the subgraph boundary of the local subgraph; and the incremental DFS execution module comprises a plurality of boundary nodes connected to the event trigger nodes, which are configured to perform the depth-first search and the topology splicing.

[0007] According to some embodiments of the present application, the system further comprises a distributed storage module configured to store the initial full-network model, wherein the distributed storage module comprises at least one master node and at least one slave node, the slave node is communicatively connected to the master node, the boundary nodes are respectively connected to the master node and the slave node, the master node is configured to write the initial full-network model and the target subgraph, and the slave node is capable of synchronizing data with the master node.

[0008] According to some embodiments of the present application, the incremental DFS execution module comprises a plurality of threads, all of which are processed in parallel, and the threads are configured to perform the topology splicing between the target subgraph and the non-dynamic region topology data, wherein the local subgraphs processed by different threads are different.

[0009] In a second aspect, the embodiments of the present application provide a method of a DFS-based dynamic topology updating system for power distribution network, which is applied to the DFS-based dynamic topology updating system for power distribution network in the first aspect, and the method comprises the following steps: The subgraph division module listens to the power distribution network event based on the initial full-network model, determines the local subgraph based on the initial full-network model and the power distribution network abnormal event when the subgraph division module listens to the power distribution network abnormal event, and sends the local subgraph to the incremental DFS execution module, wherein the power distribution network event comprises the power distribution network abnormal event; The incremental DFS execution module performs the depth-first search on the local subgraph to obtain a target subgraph, calls the distributed storage module to obtain the initial full-network model, deletes the local subgraph based on the initial full-network model to obtain the non-dynamic region topology data, performs the topology splicing between the non-dynamic region topology data and the target subgraph to obtain a target full-network model.

[0010] According to some embodiments of the present application, the subgraph division module comprises a plurality of event trigger nodes, which are configured to determine the subgraph boundary of the local subgraph; and the incremental DFS execution module comprises a plurality of boundary nodes connected to the event trigger nodes, which are configured to perform the depth-first search and the topology splicing. The subgraph division module listens to power distribution network events based on the initial full network model, and when the subgraph division module listens to a power distribution network abnormal event, determines a local subgraph based on the initial full network model and the power distribution network abnormal event, including: All event trigger nodes of the subgraph division module listen to power distribution network events of the initial full network model, wherein the power distribution network events include the power distribution network abnormal event; When any one of the event trigger nodes listens to the power distribution network abnormal event, a target boundary node is determined by extending downstream with the event trigger node as the center, a subgraph boundary is determined based on the event trigger node and the target boundary node, and the local subgraph is determined based on the subgraph boundary, wherein the target boundary node is the boundary node closest to the center point, and all boundary nodes include the target boundary node.

[0011] According to some embodiments of the present application, the power distribution network dynamic topology updating system further comprises a distributed storage module for storing the initial full network model, the distributed storage module comprising at least one master node and at least one slave node, the slave node being communicatively connected to the master node, the boundary nodes being respectively connected to the master node and the slave node, the master node being used for writing the initial full network model and the target subgraph, and the slave node being capable of realizing data synchronization with the master node; After the incremental DFS execution module performs depth-first search on the local subgraph to obtain a target subgraph, further comprising: The boundary node sends the target subgraph to the master node and the slave node of the distributed storage module, and the master node writes the target subgraph; The master node sends the target subgraph to the slave node, and the slave node acquires the master node; The master node performs consistency check on the target subgraph and the non-dynamic regional topology data, and when the target subgraph and the non-dynamic regional topology data pass the consistency check, it indicates that the target subgraph and the non-dynamic regional topology data can be topologically spliced.

[0012] According to some embodiments of the present application, the incremental DFS execution module comprises a plurality of threads, all of which are processed in parallel, and the threads are used for topologically splicing the target subgraph and the non-dynamic regional topology data, wherein the local subgraphs processed by different threads are not the same; When any one of the event trigger nodes listens to the power distribution network abnormal event, including: When at least two of the event trigger nodes listen to different power grid abnormal events at the same time, multiple threads are started, wherein the number of the threads is equal to the number of the power grid abnormal events; In any one of the threads, the target boundary node of the event trigger node is determined based on one of the event trigger nodes and the power grid abnormal event listened to by the event trigger node, the subgraph boundary is determined based on the event trigger node and the target boundary node, the local subgraph is determined based on the subgraph boundary, and the target subgraph is obtained by performing a depth-first search on the local subgraph; All the target subgraphs are sent to the distributed storage module, and the distributed storage module performs consistency checking on all the target subgraphs and the initial whole-network model; When all the target subgraphs pass the consistency checking, the target whole-network model is obtained by performing topological splicing based on all the target subgraphs and the non-dynamic region topological data.

[0013] In a third aspect, an apparatus of a DFS-based power grid dynamic topology updating system is provided, comprising at least one control processor and a memory in communication connection with the at least one control processor; the memory stores instructions executable by the at least one control processor, and the instructions are executed by the at least one control processor to enable the at least one control processor to perform the method of the DFS-based power grid dynamic topology updating system as described in the second aspect.

[0014] In a fourth aspect, a computer-readable storage medium is provided, which stores computer-executable instructions for performing the method of the DFS-based power grid dynamic topology updating system as described in the second aspect.

[0015] According to the power distribution network dynamic topology updating system based on DFS provided by the embodiment of the present application, at least the following beneficial effects are achieved: the subgraph division module is configured to determine a local subgraph based on an initial full-network model and a power distribution network abnormal event, wherein the initial full-network model is a topology model of the power distribution network, the power distribution network abnormal event is a power distribution network event causing the initial full-network model to change, the local subgraph is a minimum connected subgraph affected by the power distribution network abnormal event, and the initial full-network model includes the local subgraph; the incremental DFS execution module is communicatively connected to the subgraph division module, and is configured to perform a depth-first search on the local subgraph to obtain a target subgraph, and perform topology splicing based on the obtained non-dynamic region topology data and the target subgraph to obtain a target full-network model, wherein the target full-network model is a topology model of the power distribution network after the initial full-network model is dynamically updated, and the initial full-network model is composed of the local subgraph and the non-dynamic region topology data. According to the technical solution of the embodiment of the present application, the subgraph division module determines a minimum connected subgraph affected by the power distribution network abnormal event, that is, a local subgraph, the incremental DFS execution module only performs a depth-first search on the local subgraph, and reuses non-dynamic region topology data, and a target full-network model is obtained based on the target subgraph and the non-dynamic region topology data, which can reduce the topology to be updated, thereby reducing the calculation amount and calculation time, reducing the waste of computing resources, and reducing the response delay, thereby meeting the real-time requirement. BRIEF DESCRIPTION OF DRAWINGS

[0016] Figure 1 FIG. 1 is a structural schematic diagram of a power distribution network dynamic topology updating system according to an embodiment of the present application; Figure 2 FIG. 2 is a workflow diagram of a single thread according to another embodiment of the present application; Figure 3 FIG. 3 is a flowchart of a method of a power distribution network dynamic topology updating system based on DFS according to another embodiment of the present application; Figure 4 FIG. 4 is a structural diagram of an apparatus of a power distribution network dynamic topology updating system based on DFS according to another embodiment of the present application. DETAILED DESCRIPTION

[0017] Embodiments of the present application are described in detail below, examples of which are shown in the accompanying drawings, wherein the same or similar reference signs represent the same or similar elements or elements having the same or similar functions throughout. The embodiments described below by referring to the accompanying drawings are exemplary and are only used to explain the present application, and cannot be understood as a limitation of the present application.

[0018] In the description of the present application, it should be understood that the orientation description, such as the orientation or position relationship indicated by the upper, lower, front, rear, left, right and the like, is based on the orientation or position relationship shown in the drawings, and is only for the convenience of describing the present application and simplifying the description, and therefore cannot be understood as indicating or implying that the device or element indicated must have a particular orientation, be constructed and operated in a particular orientation, and therefore cannot be understood as limiting the present application.

[0019] In the description of the present application, one or more is understood as one or more, more than two is understood as more than two, greater than, less than, more than, etc. are understood as not including the number, above, below, etc. are understood as including the number. If the first, second is described, it is only for the purpose of distinguishing technical features, and cannot be understood as indicating or implying relative importance or implicitly indicating the number of indicated technical features or the sequence of indicated technical features.

[0020] In the description of the present application, unless otherwise explicitly limited, the words such as setting, installing, connecting and the like should be understood in a broad sense, and those skilled in the art can reasonably determine the specific meaning of the above words in the present application in combination with the specific content of the technical solution.

[0021] The power distribution network dynamic topology updating system based on DFS according to the embodiment of the present application has at least the following beneficial effects: including: a subgraph division module, the subgraph division module is used for determining a local subgraph based on an initial full network model and a power distribution network abnormal event, wherein the initial full network model is a topology model of the power distribution network, the power distribution network abnormal event is a power distribution network event causing the initial full network model to change, the local subgraph is the smallest connected subgraph affected by the power distribution network abnormal event, and the initial full network model includes the local subgraph; an incremental DFS execution module, the incremental DFS execution module is communicatively connected to the subgraph division module, the incremental DFS execution module is used for performing a depth-first search on the local subgraph to obtain a target subgraph, and is used for performing topology splicing based on obtained non-dynamic region topology data and the target subgraph to obtain a target full network model, wherein the target full network model is a topology model of the power distribution network after the initial full network model is dynamically updated, and the initial full network model is composed of the local subgraph and the non-dynamic region topology data. According to the technical solution of the embodiment of the present application, the smallest connected subgraph affected by the power distribution network abnormal event, i.e. the local subgraph, is determined by the subgraph division module, the incremental DFS execution module only performs a depth-first search on the local subgraph, and reuses the non-dynamic region topology data, the target full network model is obtained based on the target subgraph and the non-dynamic region topology data, the topology to be updated can be reduced, the calculation amount and calculation time can be reduced, the waste of calculation resources can be reduced, and the response delay can be reduced, thereby meeting the real-time requirement.

[0022] First, refer to Figures 1 to 3The DFS-based power distribution network dynamic topology updating system provided by the embodiments of the present application comprises: The subgraph division module 10 is configured to determine a local subgraph based on an initial full-network model and a power distribution network abnormal event, wherein the initial full-network model is a topology model of the power distribution network, the power distribution network abnormal event is an event of the power distribution network that causes a change in the initial full-network model, and the local subgraph is a minimum connected subgraph affected by the power distribution network abnormal event, and the initial full-network model comprises the local subgraph. The incremental DFS execution module 20 is communicatively connected to the subgraph division module 10, and is configured to perform a depth-first search on the local subgraph to obtain a target subgraph, and to perform topology splicing based on the obtained non-dynamic region topology data and the target subgraph to obtain a target full-network model, wherein the target full-network model is a topology model of the power distribution network after dynamic updating of the initial full-network model, and the initial full-network model is composed of the local subgraph and the non-dynamic region topology data.

[0023] It should be noted that the event-driven mechanism is a programming model, and the running of a program is triggered by an "event" and produces different response actions after perceiving different "events". The subgraph division module 10 combines the event-driven mechanism to quickly determine the local subgraph. When a power distribution network abnormal event occurs in the power distribution network, the initial full-network model generated based on the power distribution network will change in topology, and the dynamic subgraph division technology can automatically demarcate the minimum connected subgraph affected, that is, the local subgraph is determined based on the initial full-network model and the power distribution network abnormal event.

[0024] It should be noted that the subgraph division module 10 can listen to the power distribution network event in real time, the power distribution network event is an event that affects the topology change of the initial full-network model, such as a switch position signal, start-stop of a distributed generation (DG), and the like, the subgraph division module 10 can determine the local subgraph affected based on the type and position of the power distribution network abnormal event, and send the local subgraph to the incremental DFS execution module 20.

[0025] It should be noted that the depth-first search (DFS) is an algorithm for traversing or searching a tree or a graph, and the core idea is to explore as deep a branch as possible from a starting node until it cannot continue.

[0026] It should be noted that, through the incremental DFS execution module 20, the depth-first search is only performed on the local subgraph, the historical topology data is reused, that is, the non-dynamic region topology data not affected by the power distribution network abnormal event is reused, the global recalculation is avoided, thereby reducing the required calculation amount and the required calculation time, and the topology updating efficiency is improved and the real-time requirement is met.

[0027] It should be noted that the incremental DFS execution module 20 acquires the local subgraph, starts a lightweight DFS in the local subgraph to obtain a target subgraph, and automatically splices the target subgraph with non-dynamic area topology data to obtain a target full network model.

[0028] It should be noted that in the conventional power distribution network modeling, DFS is usually used for full network topology traversal to generate connectivity analysis results. However, after dynamic scenarios such as load fluctuation, distributed power access, and switch state change occur, topology update is needed to obtain a new full network model, so as to generate accurate connectivity analysis results, wherein the full network model is a topology model of the power distribution network. In the prior art, static DFS can be used, and after each dynamic scenario of the power distribution network occurs, the power distribution network is forced to perform full network topology update, and global DFS traversal is performed to generate a new full network model. However, general switch displacement only affects the local topology, and when a dynamic scenario occurs locally in the power distribution network, global topology update must be forced, which causes full calculation redundancy, wastes the computing resources of the center server, reduces the calculation efficiency, has high response delay, and is difficult to meet the real-time requirement. Alternatively, a breadth-first algorithm (Breadth-First Search, BFS for short) and an adjacency list can be used, but the BFS and the adjacency list lack bidirectional mapping from a parent tree to a child tree, and cannot quickly locate the boundary device of an electrical island. Alternatively, an incremental minimum spanning tree can be used, but the incremental minimum spanning tree uses a serial calculation mode and cannot use the independence of the sub-tree to perform parallel optimization.

[0029] It should be noted that, by the present application, only the local subgraph that needs to be updated due to topology change is subjected to depth-first search, and the non-dynamic area topology data is reused, the target full network model is obtained based on the target subgraph and the non-dynamic area topology data, the topology that needs to be updated can be reduced, the calculation amount and the calculation time can be reduced, the waste of computing resources can be reduced, the response delay can be reduced, and the real-time requirement can be met.

[0030] It should be noted that, by the present application, the range of calculation needed is reduced to 5%-15% of the changed area by pruning the dynamic power distribution network, thereby reducing the local calculation amount of the initial full network model by 60%-90%, and the node update delay is compressed to the ms level by using the incremental DFS combined with the multi-thread reconstruction engine. In terms of real-time requirement, the calculation delay is greatly reduced, which has good performance for scenarios of high-frequency topology change, and can support the real-time modeling and high-frequency topology update requirement of the dynamic power distribution network. In terms of resource occupation, the memory occupation is reduced to the 0(n) level, and 85% of invalid calculation is reduced. For example, in the scenario of electric vehicles accessing charging piles, the response time is reduced from seconds to milliseconds, thereby reducing the response delay.

[0031] In addition, in an embodiment, referring to Figure 1 The subgraph partition module 10 includes a plurality of event trigger nodes 11 for determining the subgraph boundary of the local subgraph, and the incremental DFS execution module 20 includes a plurality of boundary nodes 21 connected to the event trigger nodes 11, and the boundary nodes 21 are used for performing the depth-first search and the topology splicing.

[0032] It should be noted that, through the event-driven mechanism, based on the type and location of the power distribution network abnormal event, the subgraph boundary of the local subgraph is determined by using the adjacency relationship between the boundary nodes 21 and the event trigger nodes 11, and the local search domain is generated.

[0033] It should be noted that, through the plurality of event trigger nodes 11, the subgraph boundary of the local subgraph is determined, the more the number of event trigger nodes 11, the more accurate the subgraph boundary, and the more the range of the local subgraph can be determined, that is, the minimum connected subgraph can be determined.

[0034] It should be noted that the incremental DFS execution module 20 traverses downward from the event trigger node 11 that listens to the power distribution network abnormal event, and when the DFS reaches the subgraph boundary, it is automatically spliced with the non-dynamic region topology data, thereby realizing the reuse of the historical topology data, avoiding the DFS range being too large or too small, the DFS range being too large leading to an increase in the amount of calculation and the calculation time, or the DFS range being too small leading to the inability to complete the topology update, resulting in the connectivity analysis result based on the obtained target full-network model being low in accuracy.

[0035] In addition, in an embodiment, referring to Figure 1 It also includes: The distributed storage module 30 is used for storing the initial full-network model, and the distributed storage module 30 includes at least one master node 31 and at least one slave node 32, the slave node 32 is communicatively connected to the master node 31, the boundary nodes 21 are respectively connected to the master node 31 and the slave node 32, the master node 31 is used for writing the initial full-network model and the target subgraph, and the slave node 32 is used for realizing data synchronization with the master node 31.

[0036] It should be noted that the distributed storage module 30 adopts a distributed caching technology, which is a technology for distributing cache data on multiple nodes, aiming to improve system performance, scalability and high availability. It reduces the access frequency to the backend storage by caching hot data, thereby improving the response speed of the system.

[0037] It should be noted that, by reusing the topology data through the distributed cache, the dependence on the computing power of the central server is reduced, and the calculation resource is saved.

[0038] It should be noted that the master node 31 and the slave node 32 are both edge computing nodes, and the target subgraph is stored in the edge computing node cache for subsequent incremental update calls.

[0039] It should be noted that by combining the event-driven mechanism and the distributed cache, an event-driven incremental cache mechanism is obtained, by listening to the power distribution network time, and by triggering the power distribution network abnormal event, the local subgraph is determined and the local subgraph is subjected to a depth-first search, and the target subgraph is cached, and the incremental sub-tree topology can be processed in parallel, greatly reducing the amount of calculation, wherein the power distribution network abnormal event includes voltage out-of-limit, device switching and other events that cause the initial full network model to change the topology.

[0040] In addition, in an embodiment, referring to Figure 2 , Figure 2 is a workflow diagram of a single thread provided by another embodiment of the application; the incremental DFS execution module 20 includes multiple threads, all threads are processed in parallel, and the threads are used for topological splicing of the target subgraph and the non-dynamic area topology data, wherein the local subgraphs processed by different threads are different.

[0041] It should be noted that when different power distribution network abnormal events occur at the same time, multiple threads are processed in parallel, so as to further compress the execution depth-first search time of the incremental DFS execution module 20, thereby greatly reducing the calculation delay and having a good performance on the scene of high-frequency topology change of the power distribution network.

[0042] In addition, the embodiment of the application provides a method for updating the dynamic topology of the power distribution network based on DFS, which is applied to Figures 1 to 2 The DFS-based power distribution network dynamic topology updating system shown in the embodiment, referring to Figure 3 , the method includes but is not limited to the following steps: S10, the subgraph division module listens to the power distribution network event based on the initial full network model, when the subgraph division module listens to the power distribution network abnormal event, the local subgraph is determined based on the initial full network model and the power distribution network abnormal event, and the local subgraph is sent to the incremental DFS execution module, wherein the power distribution network event includes the power distribution network abnormal event. S20, the incremental DFS execution module performs a depth-first search on the local subgraph to obtain a target subgraph, calls the distributed storage module to obtain an initial full network model, deletes the local subgraph based on the initial full network model to obtain non-dynamic area topology data, and topologically splices the non-dynamic area topology data and the target subgraph to obtain a target full network model.

[0043] It should be noted that the local subgraph is determined by the subgraph division module, the target subgraph is obtained by performing depth-first search on the local subgraph by the incremental DFS execution module, and the target subgraph is topologically spliced with the non-dynamic area topological data to obtain the target full network model. Based on the target full network model, the connectivity analysis result is output, or based on the target full network model, the power distribution network event is monitored to realize dynamic topology updating of the power distribution network.

[0044] In addition, in an embodiment, the subgraph division module includes a plurality of event trigger nodes, the event trigger nodes are used to determine the subgraph boundary of the local subgraph; the incremental DFS execution module includes a plurality of boundary nodes, the boundary nodes are connected to the event trigger nodes, and the boundary nodes are used to perform depth-first search and topological splicing; in step S10, the subgraph division module monitors the power distribution network event based on the initial full network model, and when the subgraph division module monitors the power distribution network abnormal event, the local subgraph is determined based on the initial full network model and the power distribution network abnormal event, and the steps further include but are not limited to the following steps: S11, all event trigger nodes of the subgraph division module monitor the power distribution network event of the initial full network model, wherein the power distribution network event includes the power distribution network abnormal event; S12, when any one of the event trigger nodes monitors the power distribution network abnormal event, the target boundary node is determined by extending downstream from the center of the event trigger node, the subgraph boundary is determined based on the event trigger node and the target boundary node, and the local subgraph is determined based on the subgraph boundary, wherein the target boundary node is the boundary node closest to the center point, and all boundary nodes include the target boundary node.

[0045] It should be noted that the first boundary node reached by extending downstream from the center of the event trigger node is the target boundary node, and the boundary node can be a tie-in switch. By this method, the smallest connected subgraph as possible can be taken as the local subgraph, thereby reducing the calculation amount and calculation time.

[0046] In addition, in an embodiment, the power distribution network dynamic topology updating system further includes a distributed storage module, the distributed storage module is used to store the initial full network model, the distributed storage module includes at least one master node and at least one slave node, the slave node is communicatively connected to the master node, the boundary nodes are respectively connected to the master node and the slave node, the master node is used to write the initial full network model and the target subgraph, and the slave node can realize data synchronization with the master node; after the target subgraph is obtained by performing depth-first search on the local subgraph by the incremental DFS execution module in step S20, the steps further include but are not limited to the following steps: S31, the boundary node sends the target subgraph to the master node and the slave node of the distributed storage module, and the master node writes the target subgraph; S32, the master node sends the target subgraph to the slave node, and the slave node acquires the master node; S33, the master node performs consistency check on the target subgraph and the non-dynamic area topology data, and when the target subgraph and the non-dynamic area topology data pass the consistency check, it indicates that the target subgraph and the non-dynamic area topology data can be topologically spliced.

[0047] It should be noted that after obtaining the target subgraph, consistency of the local update result of the local subgraph and the initial full network model needs to be verified, for example, consistency check is performed on the target subgraph and the initial full network model by using ring network detection rules.

[0048] In addition, in an embodiment, the incremental DFS execution module includes multiple threads, all threads are processed in parallel, the threads are used to topologically splice the target subgraph and the non-dynamic area topology data, wherein the local subgraphs processed by different threads are different; in step S12, when any one of the event trigger nodes listens to a power distribution network abnormal event, specifically including but not limited to the following steps: S121, when at least two event trigger nodes listen to different power distribution network abnormal events at the same time, multiple threads are started, wherein the number of threads is equal to the number of power distribution network abnormal events; S122, in any one thread, based on one of the event trigger nodes and the power distribution network abnormal event listened to by the event trigger node, the target boundary node of the event trigger node is determined, the subgraph boundary is determined based on the event trigger node and the target boundary node, the local subgraph is determined based on the subgraph boundary, and the target subgraph is obtained by performing depth-first search on the local subgraph; S123, all target subgraphs are sent to the distributed storage module, and the distributed storage module performs consistency check on all target subgraphs and the initial full network model; S124, when all target subgraphs pass the consistency check, the target full network model is obtained by topologically splicing all target subgraphs and the non-dynamic area topology data.

[0049] It should be noted that when multiple power distribution network abnormal events are listened to at the same time, multiple threads are started, the number of threads is equal to the number of power distribution network abnormal events, one thread determines a local subgraph based on one power distribution network abnormal event and the event trigger node listening to the power distribution network abnormal event, and performs depth-first search to obtain a target subgraph, and splices the target subgraph and the non-dynamic area topology data to obtain a target full network model. Threads are processed in parallel, that is, multiple target subgraphs can be obtained by performing depth-first search on multiple local subgraphs, thereby reducing the required calculation time, meeting the requirement of shortening the response delay, and meeting the requirement of real-time.

[0050] The DFS-based dynamic topology update system for distribution networks of this invention combines an event-driven mechanism, local updates, and parallel computing. Through the event-driven mechanism, a subgraph partitioning module monitors distribution network events. When an abnormal event is detected, the subgraph boundary and local subgraph are determined based on the initial global network model and the abnormal event through event triggering nodes. An incremental DFS execution module performs a depth-first search on the local subgraph. When the subgraph boundary is reached, the target subgraph is obtained, DFS stops, and the target subgraph is sent to a distributed storage module. The distributed storage module performs consistency verification between the target subgraph and the initial global network model. The incremental DFS execution module acquires topology data from non-dynamic regions and performs topology concatenation between the obtained target subgraph and the non-dynamic region topology data to obtain the target global network model. This completes the local update of the local subgraph affected by the abnormal distribution network event. The distributed storage module enables the reuse of the initial global network model, requiring only a depth-first search on the local subgraph, thus reducing computational load, computation time, and computational resources, and reducing response latency while meeting real-time requirements.

[0051] For example, all event-triggered nodes of the subgraph partitioning module listen to distribution network events. When an electric vehicle connects to a charging pile, a current surge event is sent. The current surge event is a distribution network anomaly event. When any event-triggered node listens to the current surge event, the target boundary node is determined by extending downstream from the event-triggered node. The part between the event-triggered node and the target boundary node is partitioned into a local subgraph and sent to the incremental DFS execution module. The incremental DFS execution module performs a depth-first search on the local subgraph to obtain the target subgraph, thereby updating the topology state of the branch where the charging pile is located. The target subgraph is cached in the distributed storage module, which performs consistency verification between the target subgraph and the initial full network model. The incremental DFS execution module performs topology concatenation between the target subgraph and the non-dynamic region topology data to obtain the target full network model. The obtained target full network model can be used for subsequent power flow calculations and setpoint adjustments after the charging pile is connected.

[0052] like Figure 4 As shown, Figure 4 This is a structural diagram of a distribution network dynamic topology update system based on DFS provided in one embodiment of the present invention. The present invention also provides a distribution network dynamic topology update system based on DFS, comprising: The processor 401 can be implemented in a manner of a general central processing unit (CPU), a microprocessor, an application specific integrated circuit (ASIC), or one or more integrated circuits, and is configured to execute related programs to implement the technical solutions provided by the embodiments of the present application. The memory 402 can be implemented in a form of a read only memory (ROM), a static storage device, a dynamic storage device, or a random access memory (RAM). The memory 402 can store an operating system and other application programs. When the technical solutions provided by the embodiments of the present application are implemented by software or firmware, the related program codes are stored in the memory 402 and are called and executed by the processor 401 to implement the method of the DFS-based dynamic topology updating system of the power distribution network according to the embodiments of the present application. The input / output interface 403 is configured to implement information input and output. The communication interface 404 is configured to implement the communication interaction between the device and other devices. The communication can be implemented in a wired manner (for example, a USB, a network cable, etc.) or in a wireless manner (for example, a mobile network, WIFI, Bluetooth, etc.). The bus 405 is configured to transmit information between various components (for example, the processor 401, the memory 402, the input / output interface 403, and the communication interface 404) of the device. The processor 401, the memory 402, the input / output interface 403, and the communication interface 404 are connected to each other in the device through the bus 405.

[0053] The embodiments of the present application further provide a storage medium, which is a computer readable storage medium. The storage medium stores a computer program. The computer program is executed by a processor to implement the method of the DFS-based dynamic topology updating system of the power distribution network.

[0054] Memory, as a non-transitory computer-readable storage medium, can be used to store non-transitory software programs and non-transitory computer-executable programs. In addition, the memory can include a high-speed random access memory, and can also include a non-transitory memory, such as at least one magnetic disk storage device, a flash memory device, or other non-transitory solid-state memory device. In some embodiments, the memory can optionally include a memory disposed remotely with respect to the processor, which can be connected to the processor through a network. Examples of the above network include, but are not limited to, the Internet, an intranet, a local area network, a mobile communication network, and a combination thereof. The above-described device embodiments are only illustrative, and units described as separate components can or can not be physically separated, implemented in one place, or distributed to multiple network units. Part or all of the modules can be selected according to actual needs to achieve the purpose of the present embodiment.

[0055] Those of ordinary skill in the art can understand that all or some steps in the above disclosed method and system can be implemented as software, firmware, hardware, and appropriate combinations thereof. Some or all physical components can be implemented as software executed by a processor, such as a central processing unit, a digital signal processor, or a microprocessor, or as hardware, or as an integrated circuit, such as an application-specific integrated circuit. Such software can be distributed on a computer-readable medium, which can include computer storage media (or non-transitory media) and communication media (or transitory media). As known to those of ordinary skill in the art, the term computer storage media includes volatile and non-volatile, removable and non-removable media implemented in any method or technology for storage of information such as computer readable instructions, data structures, program modules or other data. Computer storage media includes, but is not limited to, RAM, ROM, EEPROM, flash memory or other memory technology, CD-ROM, digital versatile disks (DVD) or other optical disk storage, magnetic cassettes, magnetic tapes, magnetic disk storage or other magnetic storage devices, or any other medium that can be used to store desired information and can be accessed by a computer. In addition, as known to those of ordinary skill in the art, communication media generally includes computer readable instructions, data structures, program modules or other data in modulated data signals such as carrier waves or other transport mechanisms, and can include any information delivery medium.

[0056] The above is a specific description of the preferred embodiment of the present application, but the present application is not limited to the above-described embodiments, and those skilled in the art can make various equivalent modifications or replacements without departing from the spirit of the present application. These equivalent modifications or replacements are all included in the scope defined by the claims of the present application.

Claims

1. A DFS-based power distribution network dynamic topology updating system, characterized in that, Comprising: a subgraph division module for determining a local subgraph based on an initial full network model and a power distribution network abnormal event, wherein the initial full network model is a topological model of a power distribution network, the power distribution network abnormal event is a power distribution network event causing changes in the initial full network model, and the local subgraph is the smallest connected subgraph affected by the power distribution network abnormal event, and the initial full network model includes the local subgraph; an incremental DFS execution module communicatively connected to the subgraph division module, for performing a depth-first search on the local subgraph to obtain a target subgraph, and for performing topological splicing based on the obtained non-dynamic region topological data and the target subgraph to obtain a target full network model, wherein the target full network model is a topological model of the power distribution network after dynamic updating of the initial full network model, and the initial full network model is composed of the local subgraph and the non-dynamic region topological data.

2. The DFS-based dynamic topology updating system for a power distribution network according to claim 1, characterized in that: the subgraph division module includes a plurality of event trigger nodes for determining the subgraph boundary of the local subgraph; the incremental DFS execution module includes a plurality of boundary nodes connected to the event trigger nodes, and the boundary nodes are used for performing depth-first search and topological splicing.

3. The DFS-based power distribution network dynamic topology updating system of claim 2, wherein, Further comprising: a distributed storage module for storing the initial full network model, the distributed storage module including at least one master node and at least one slave node, the slave node being communicatively connected to the master node, and the boundary nodes being respectively connected to the master node and the slave node, the master node being used for writing the initial full network model and the target subgraph, and the slave node being capable of synchronizing data with the master node.

4. The DFS-based dynamic topology updating system for a power distribution network according to claim 1, characterized in that: the incremental DFS execution module includes a plurality of threads, all of which are processed in parallel, and the threads are used for topological splicing of the target subgraph and the non-dynamic region topological data, wherein the local subgraphs processed by different threads are not the same.

5. A method for dynamic topology updating system of power distribution network based on DFS, characterized in that, The method is applied to the DFS-based dynamic topology updating system for a power distribution network according to any one of claims 1 to 4, and the method comprises: the subgraph division module listens to power distribution network events based on an initial full network model, and when the subgraph division module detects a power distribution network abnormal event, it determines a local subgraph based on the initial full network model and the power distribution network abnormal event, and sends the local subgraph to an incremental DFS execution module, wherein the power distribution network events include the power distribution network abnormal event; the incremental DFS execution module performs a depth-first search on the local subgraph to obtain a target subgraph, calls a distributed storage module to obtain the initial full network model, deletes the local subgraph based on the initial full network model to obtain non-dynamic region topological data, and performs topological splicing of the non-dynamic region topological data and the target subgraph to obtain a target full network model.

6. The method of claim 5, wherein the DFS-based power distribution network dynamic topology updating system is characterized by, The subgraph division module comprises a plurality of event trigger nodes, the event trigger nodes being configured to determine a subgraph boundary of the local subgraph; the incremental DFS execution module comprises a plurality of boundary nodes, the boundary nodes being connected to the event trigger nodes, and the boundary nodes being configured to perform a depth-first search and a topology splicing; The subgraph division module listens to power distribution network events based on an initial full-network model, and when the subgraph division module listens to a power distribution network abnormal event, determines a local subgraph based on the initial full-network model and the power distribution network abnormal event, comprising: All of the event trigger nodes of the subgraph division module listen to power distribution network events of the initial full-network model, wherein the power distribution network events comprise the power distribution network abnormal event; When any one of the event trigger nodes listens to the power distribution network abnormal event, determines a target boundary node by extending downstream with the event trigger node as a center, determines a subgraph boundary based on the event trigger node and the target boundary node, and determines the local subgraph based on the subgraph boundary, wherein the target boundary node is the boundary node closest to the center, and all of the boundary nodes comprise the target boundary node.

7. The method of claim 6, wherein the DFS-based power distribution network dynamic topology updating system is characterized by, The power distribution network dynamic topology updating system further comprises a distributed storage module, the distributed storage module being configured to store the initial full-network model, the distributed storage module comprising at least one master node and at least one slave node, the slave nodes being communicatively connected to the master nodes, the boundary nodes being respectively connected to the master nodes and the slave nodes, the master nodes being configured to write the initial full-network model and the target subgraph, and the slave nodes being capable of synchronizing data with the master nodes; After the incremental DFS execution module performs a depth-first search on the local subgraph to obtain a target subgraph, further comprising: The boundary nodes send the target subgraph to the master nodes and the slave nodes of the distributed storage module, and the master nodes write the target subgraph; The master nodes send the target subgraph to the slave nodes, and the slave nodes acquire the master nodes; The master nodes perform consistency checking on the target subgraph and the non-dynamic region topology data, and when the target subgraph and the non-dynamic region topology data pass the consistency checking, it indicates that the target subgraph and the non-dynamic region topology data can be spliced.

8. The method of claim 6, wherein the DFS-based power distribution network dynamic topology updating system is characterized by, The incremental DFS execution module comprises a plurality of threads, all of the threads being processed in parallel, and the threads being configured to splice the target subgraph and the non-dynamic region topology data, wherein the local subgraphs processed by different threads are different; When any one of the event trigger nodes listens to the power distribution network abnormal event, comprising: When at least two of the event trigger nodes simultaneously listen to different power distribution network abnormal events, a plurality of threads are started, wherein the number of the threads is equal to the number of the power distribution network abnormal events; In any one of the threads, based on one of the event trigger nodes and the abnormal power grid event it listens to, determine the target boundary node of the event trigger node, determine the subgraph boundary based on the event trigger node and the target boundary node, determine the local subgraph based on the subgraph boundary, and perform a depth-first search on the local subgraph to obtain the target subgraph; send all the target subgraphs to the distributed storage module, and the distributed storage module performs consistency checking on all the target subgraphs and the initial full-network model; when all the target subgraphs pass the consistency checking, perform topology splicing based on all the target subgraphs and the non-dynamic region topology data to obtain the target full-network model.

9. An apparatus for a DFS-based dynamic topology update system of a power distribution network, characterized by The system comprises at least one control processor and a memory connected in communication with the at least one control processor; the memory stores instructions executable by the at least one control processor, and the instructions are executed by the at least one control processor to enable the at least one control processor to perform the method of the DFS-based dynamic topology updating system for a power grid according to any one of claims 4 to 8.

10. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores computer-executable instructions for causing a computer to perform the method of the DFS-based dynamic topology updating system for a power grid according to any one of claims 5 to 8.

Images