Storage method and device of power distribution network structure, electronic equipment and storage medium
By traversing the distribution network structure diagram and sequencing nodes, the storage table is formed, and the problem of low efficiency in storage and trend computing of complex distribution networks is solved, and efficient network structure storage and calculation is achieved.
Patent Information
- Application Number
- CN202411331957.4
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-09-24
- Publication Date
- 2025-01-14
AI Technical Summary
The prior art is difficult to quickly and accurately store complex distribution network structures, resulting in inefficient current computing.
By obtaining the structure diagram of the distribution network, traverse the nodes to determine the main node, sort and add node identifications to the table, determine the node identifications related to the main node, and form a storage table for easier flow calculation.
It realizes rapid and accurate storage of distribution network structures, improving the efficiency of trend computing.
Smart Images

Figure CN119311920A_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the field of electric power technology, and in particular to a storage method, device, electronic equipment and storage medium for a distribution network structure. Background Art
[0002] The distribution network refers to the power grid that receives electric energy from the transmission network or regional power plants and distributes it locally or step by step according to voltage to various users through distribution facilities. It is composed of overhead lines, cables, towers, distribution transformers, disconnectors, reactive power compensators and some ancillary facilities, and plays an important role in distributing electric energy in the power grid.
[0003] By performing power flow calculation on the distribution network, we can analyze the status of network electrical appliances, check the out-of-limit range, perform operation simulation and wiring change analysis, etc. At present, the power flow calculation on the distribution network requires the storage of the network structure of the distribution network. However, in actual situations, the network structure of the distribution network has the characteristics of complex structure and large amount of data. Directly storing the network structure of the distribution network requires a large amount of memory and leads to low efficiency of subsequent power flow calculation on the distribution network.
[0004] How to quickly and accurately store the network structure of the distribution network and improve the efficiency of subsequent power flow calculations on the distribution network is a key research issue in the industry. Summary of the invention
[0005] The present invention provides a method, device, electronic device and storage medium for storing a distribution network structure, so as to quickly and accurately store the network structure of the distribution network, and provide a basis for subsequently improving the efficiency of power flow calculation for the distribution network.
[0006] According to one aspect of the present invention, a method for storing a distribution network structure is provided, the method comprising:
[0007] Obtaining a target structure diagram of a target distribution network, traversing the target structure diagram, and determining at least one main node from each of the nodes in the target structure diagram; the target distribution network is a radial distribution network, and the target structure diagram includes a plurality of nodes;
[0008] Sorting the master nodes, and sequentially adding the node identifiers of the sorted master nodes to the first column of the original table;
[0009] Determine each node related to the target master node, and add the node identifier of each node to the row corresponding to the target master node in the original table;
[0010] In response to a traversal completion instruction for all nodes of the target structure graph, a target table storing the target power distribution network structure is obtained.
[0011] According to another aspect of the present invention, there is provided a storage device of a distribution network structure, the device comprising:
[0012] A master node determination module is used to obtain a target structure diagram of a target distribution network, traverse the target structure diagram, and determine at least one master node from each of the nodes in the target structure diagram; the target distribution network is a radial distribution network, and the target structure diagram contains multiple nodes;
[0013] A master node sorting module, used to sort the master nodes, and add the node identifiers of the sorted master nodes to the first column of the original table in turn;
[0014] A subnode determination module, used for determining each node related to the target main node, and adding the node identifier of each node to the row corresponding to the target main node in the original table;
[0015] The target table determination module is used to obtain a target table storing the target distribution network structure in response to a traversal completion instruction of all nodes of the target structure graph.
[0016] According to another aspect of the present invention, an electronic device is provided, the electronic device comprising:
[0017] at least one processor; and
[0018] a memory communicatively connected to the at least one processor; wherein,
[0019] The memory stores a computer program executable by the at least one processor, and the computer program is executed by the at least one processor so that the at least one processor can execute the method for storing the distribution network structure described in any embodiment of the present invention.
[0020] According to another aspect of the present invention, a computer-readable storage medium is provided, wherein the computer-readable storage medium stores computer instructions, and the computer instructions are used to enable a processor to implement the storage method of the distribution network structure described in any embodiment of the present invention when executed.
[0021] According to another aspect of the present invention, a computer program product is provided, comprising a computer program, wherein when the computer program is executed by a processor, the computer program implements the method for storing a distribution network structure according to any embodiment of the present invention.
[0022] The technical solution of the embodiment of the present invention obtains a target structure diagram of a target distribution network, and traverses the target structure diagram to determine at least one main node from each of the nodes in the target structure diagram; the target distribution network is a radial distribution network, and the target structure diagram contains multiple nodes; the main nodes are sorted, and the node identifiers of the sorted main nodes are added to the first column of the original table in turn; each node related to the target main node is determined, and the node identifier of each node is added to the row corresponding to the target main node in the original table; in response to the traversal completion instruction of all nodes in the target structure diagram, a target table storing the target distribution network structure is obtained, which can quickly and accurately store the network structure of the distribution network, and provide a basis for subsequently improving the efficiency of power flow calculation for the distribution network.
[0023] It should be understood that the contents described in this section are not intended to identify the key or important features of the embodiments of the present invention, nor are they intended to limit the scope of the present invention. Other features of the present invention will become easily understood through the following description. BRIEF DESCRIPTION OF THE DRAWINGS
[0024] In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the following briefly introduces the drawings required for use in the description of the embodiments. Obviously, the drawings described below are only some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without creative work.
[0025] Figure 1 is a flow chart of a method for storing a distribution network structure provided according to Embodiment 1 of the present invention;
[0026] Figure 2 is a target structure diagram of a target distribution network provided according to the first embodiment of the present invention;
[0027] Figure 3 is a flow chart of a method for storing a distribution network structure provided according to a second embodiment of the present invention;
[0028] Figure 4 is a target structure diagram after adjustment of a target distribution network provided by the second embodiment of the present invention;
[0029] Figure 5 is a schematic diagram of the structure of a storage device of a distribution network structure provided according to a third embodiment of the present invention;
[0030] Figure 6 It is a structural schematic diagram of an electronic device for implementing the method for storing the distribution network structure according to an embodiment of the present invention. DETAILED DESCRIPTION
[0031] In order to enable those skilled in the art to better understand the scheme of the present invention, the technical scheme in the embodiments of the present invention will be clearly and completely described below in conjunction with the drawings in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work should fall within the scope of protection of the present invention.
[0032] It should be noted that the terms "first", "second", etc. in the specification and claims of the present invention and the above-mentioned drawings are used to distinguish similar objects, and are not necessarily used to describe a specific order or sequence. It should be understood that the data used in this way can be interchanged where appropriate, so that the embodiments of the present invention described herein can be implemented in an order other than those illustrated or described herein. In addition, the terms "including" and "having" and any variations thereof are intended to cover non-exclusive inclusions, for example, a process, method, system, product or device that includes a series of steps or units is not necessarily limited to those steps or units that are clearly listed, but may include other steps or units that are not clearly listed or inherent to these processes, methods, products or devices.
[0033] Embodiment 1
[0034] Figure 1 This is a flow chart of a method for storing a distribution network structure according to the first embodiment of the present invention. This embodiment is applicable to the case where a radial distribution network is converted and stored. The method can be executed by a storage device for the distribution network structure. The storage device for the distribution network structure can be implemented in the form of hardware and / or software. The storage device for the distribution network structure can be configured in electronic devices such as computers, servers or tablet computers. Figure 1 As shown, the method includes:
[0035] Step 110: Obtain a target structure diagram of a target distribution network, traverse the target structure diagram, and determine at least one master node from each of the nodes in the target structure diagram.
[0036] Wherein, the target distribution network is a radial distribution network, and the target structure diagram includes multiple nodes. It should be noted that, in this embodiment, the target distribution network can be a radial distribution network deployed in any area, for example, a radial distribution network deployed in area A, or a radial distribution network deployed in city B, which is not limited in this embodiment.
[0037] It can be understood that in this embodiment, the target structure diagram of the target distribution network may include multiple nodes, and each node may be any power equipment in the target distribution network (for example, a pole tower, a distribution transformer or a disconnector, etc., which is not limited in this embodiment).
[0038] In an optional implementation of this embodiment, the target structure diagram of the target distribution network can be obtained from the target database, wherein the target database can be a local database or a cloud database, which is not limited in this embodiment. The target database stores specific information of each distribution network, such as the deployment area, size, or specific power equipment included, which is not limited in this embodiment.
[0039] Optionally, in this embodiment, after the target structure diagram of the target power distribution network is obtained, the obtained target structure diagram may be further traversed to determine each main node from each node of the target structure diagram.
[0040] In this embodiment, if the target node does not include a subsequent node, the target node can be determined to be a main node; in this embodiment, other nodes in the target structure graph except the main node are called child nodes.
[0041] In an optional implementation of the present embodiment, traversing the target structure graph and determining at least one main node from each of the nodes in the target structure graph may include: traversing each node in the target structure graph to determine whether each node contains a subsequent node; and when it is determined that the target node contains a subsequent node, determining the target node as a main node.
[0042] Optionally, in this embodiment, after obtaining the target structure diagram, each node in the target structure diagram can be further traversed to determine whether each node contains a subsequent node; if it is determined that the target node contains a subsequent node, the target node can be determined as a main node; if the target node does not contain a subsequent node, the target node can be determined as a child node.
[0043] Figure 2 is a target structure diagram of a target distribution network provided according to the first embodiment of the present invention, such as Figure 2 As shown, the main nodes of the target structure diagram can be node 0, node 1, node 2, node 3, node 4 and node 5; the child nodes can be node 6, node 7, node 8, node 9, node 10, node 11, node 12, node 13 and node 14.
[0044] Step 120: sort the master nodes, and add the node identifiers of the sorted master nodes to the first column of the original table in sequence.
[0045] The original table may be a blank table, and the specific style thereof is not limited in this embodiment.
[0046] In an optional implementation of this embodiment, after determining each master node, the master nodes may be further sorted, and each master node may be filled into the first column of the original table in sequence according to the sorting result.
[0047] In this embodiment, each master node may be sorted in the order of the node identifier of each master node (for example, the name or serial number of each node, which is not limited in this embodiment), for example, each master node may be sorted in the order of node 0, node 1, node 2, node 3, node 4 and node 5. Further, node 0, node 1, node 2, node 3, node 4 and node 5 may be filled into the first column of the original table in sequence.
[0048] Optionally, in this embodiment, each of the main nodes is sorted, and the node identifier of each of the sorted main nodes is added to the first column of the original table in turn, which may include: determining a starting main node from each of the main nodes; sorting each of the main nodes according to the distance between the starting main node and other main nodes to obtain a target queue; each element in the target queue is a node identifier of each of the main nodes, and the first element is the node identifier of the starting main node; each element of the target queue is added to the first column of the original table; the original table is a blank table.
[0049] Among them, sorting each of the main nodes according to the distance between the starting main node and other main nodes to obtain the target queue can include: calculating the node distance between the initial node and each main node according to the target structure diagram, and sorting each of the node distances in ascending order to obtain the sorted node distances; determining the node identifier of the target main node corresponding to the target node distance, and replacing the target node distance with the node identifier; after all node distances are replaced, the target queue is obtained.
[0050] In this embodiment, any master node can be determined as the starting master node. For example, Figure 2 Node 0 in is determined as the starting master node; further, the node distances between the starting master node and other master nodes can be calculated respectively, and the calculated node distances are sorted in ascending order to obtain the sorted node distances; further, the node identifier of the target master node corresponding to the target node distance can be determined, and the target node distance is replaced with the target node identifier. After all node distances are replaced, the target queue can be obtained.
[0051] Furthermore, each element of the target queue (node identifier of each master node) may be added to the first column of the original table.
[0052] Exemplarily, in an example of this embodiment, if the sorted node distances are 1km, 3km and 5km respectively, the node identifiers of the main nodes corresponding to the node distance of 1km (for example, node 0 and node 1); the node identifiers of the main nodes corresponding to the node distance of 3km (for example, node 0 and node 2); and the node identifiers of the main nodes corresponding to the node distance of 5km (for example, node 0 and node 3) can be determined respectively, and the sorted target queues are node 0, node 1, node 2 and node 3.
[0053] Step 130: determine each node related to the target master node, and add the node identifier of each node to the row corresponding to the target master node in the original table.
[0054] Among them, the nodes related to the target master node can be the master node and the child node connected to the target master node; for example, refer to Figure 2 If the target main node is node 1, then the child nodes related to node 1 are node 9 and node 2; if the target main node is node 3, then the child nodes related to node 3 are node 4, node 11 and node 12.
[0055] In an optional implementation of this embodiment, after determining each node related to the target node, the node identifier of each node may be further added to the row corresponding to the target main node in the original table.
[0056] For example, if the target main node is node 1, then the node identifiers of node 9 and node 2 can be added to the row corresponding to node 1 in the original table; if the target main node is node 3, then the node identifiers of node 4, node 11 and node 12 can be added to the row corresponding to node 3 in the original table.
[0057] Optionally, in this embodiment, determining each node related to the target master node and adding the node identifier of each node to the row corresponding to the target master node in the original table may include: determining the number of nodes connected to the target master node and the node identifier of each node; and adding the number and the node identifier of each node to the row corresponding to the target master node in the original table in turn.
[0058] In an optional implementation of the present embodiment, determining each node related to the target master node and adding the node identifier of each node to the row corresponding to the target master node in the original table may include: determining the number of nodes connected to the target node and the node identifier of each node, and adding the number of each node and the node identifier of each node to the row corresponding to the target master node in the original table in turn.
[0059] For example, if the target main node is node 1, then the child nodes related to node 1 are node 9 and node 2, and the number of nodes is 2; if the target main node is node 3, then the child nodes related to node 3 are node 4, node 11 and node 12, and the number of nodes is 3.
[0060] Step 140: In response to the traversal completion instruction of all nodes of the target structure graph, a target table storing the target distribution network structure is obtained.
[0061] In an optional implementation of this embodiment, after all nodes in the target structure graph are traversed, a target table storing the network structure of the target power distribution network can be obtained.
[0062] For example, Figure 2 The target table for matching the target structure graph shown in FIG. 1 can be shown in Table 1, that is, Table 1 stores the following Figure 2 The target structure diagram shown is the network structure of the target distribution network.
[0063] Table 1
[0064]
[0065] In an optional implementation of this embodiment, after obtaining the target table storing the target distribution network structure, the method may further include: responding to a power flow calculation instruction of the target distribution network, performing power flow calculation on the target distribution network based on the target table.
[0066] Optionally, in this embodiment, after the target table is obtained, if a power flow calculation instruction for the target distribution network is received, the power flow calculation for the target distribution network may be performed based on the target table.
[0067] For example, based on the target table (Table 1), the target distribution network ( Figure 2) The power flow calculation may include: when calculating the branch power, first point the pointer to the last record in Table 1, first obtain the power distribution of branches 6 and 7 from the load and voltage of nodes 6 and 7 (the first time obtained by assumption, and then obtained by the previous iteration calculation); further, the terminal power of branch 5 can be calculated from the head-end power of branches 6 and 7; further, the power distribution of branch 5 can be calculated from the voltage of node 5 and its terminal power. Move the pointer up one record, and imitate the above calculation process to obtain the power on branches 4, 8, 13, and 14; when the pointer moves the first record, all branch powers can be obtained; when calculating the node voltage, the voltage of node 1 can be calculated from the first record, and the voltage of node 1 can be calculated from the head-end voltage (given) and the head-end power of branch 1 (obtained from the previous iteration), and move the pointer to the second record, and imitate the above calculation process to obtain the voltage of nodes 2 and 9..., and further, when the pointer points to the last record, all node voltages can be obtained.
[0068] The technical solution of this embodiment is to obtain a target structure diagram of a target distribution network, traverse the target structure diagram, and determine at least one main node from each of the nodes in the target structure diagram; the target distribution network is a radial distribution network, and the target structure diagram contains multiple nodes; sort the main nodes, and add the node identifiers of the sorted main nodes to the first column of the original table in turn; determine each node related to the target main node, and add the node identifier of each node to the row corresponding to the target main node in the original table; in response to the traversal completion instruction of all nodes in the target structure diagram, obtain a target table storing the target distribution network structure, so as to quickly and accurately store the network structure of the distribution network, and provide a basis for subsequently improving the efficiency of power flow calculation for the distribution network.
[0069] Embodiment 2
[0070] Figure 3 1 is a flow chart of a method for storing a distribution network structure according to Embodiment 2 of the present invention. This embodiment is a further refinement of the above technical solution. The technical solution in this embodiment can be combined with each optional solution in one or more of the above embodiments. Figure 3 As shown, the method includes:
[0071] Step 310: Obtain a target structure diagram of a target distribution network, traverse the target structure diagram, and determine at least one master node from each node of the target structure diagram.
[0072] Step 320: sort the master nodes, and add the node identifiers of the sorted master nodes to the first column of the original table in sequence.
[0073] Step 330: determine each node related to the target master node, and add the node identifier of each node to the row corresponding to the target master node in the original table.
[0074] Step 340: In response to the traversal completion instruction of all nodes of the target structure graph, a target table storing the target distribution network structure is obtained.
[0075] Step 350: In response to the modification instruction of the target structure diagram, determine a modification instance corresponding to the target structure diagram; and adjust the target table based on the modification instance.
[0076] The modification instruction includes at least one of the following: adding, deleting and replacing.
[0077] In an optional implementation of the present embodiment, after obtaining the target table, if a modification instruction to the target structure diagram is received, for example, an instruction to add, delete or replace the target structure diagram, the modification instance corresponding to the target structure diagram can be determined; for example, adding branch 1 or deleting node 3, etc.; further, the target table can be adjusted based on the modification instance.
[0078] For example, if Figure 2 The modification instructions of the target structure diagram shown are to add a new branch and two new nodes. The corresponding modification examples are: add a new branch (indicated by a dotted line). Number the new nodes 15 and 16; delete branch 14; node 12 is powered by node 4. For example, Figure 4 It is a target structure diagram after adjustment of a target distribution network provided according to the second embodiment of the present invention; the adjusted target table is shown in Table 2.
[0079] Table 2
[0080]
[0081] From the above modification process, we can see that the node numbering can be arbitrary and does not need to follow a certain rule or order, nor does it need to be continuous. For example, when adding branch 16, node 15 is inserted between node 4 and node 8. When deleting branch 14, node 14 is also removed. There is no node 14 between node 13 and node 15, and the nodes are not continuous.
[0082] The technical solution of this embodiment can quickly and accurately store the network structure of the distribution network, and can also respond quickly when the distribution network structure changes, providing a basis for subsequently improving the efficiency of power flow calculation for the distribution network.
[0083] Embodiment 3
[0084] Figure 5 1 is a schematic diagram of a storage device for a distribution network structure according to Embodiment 3 of the present invention. Figure 5 As shown, the device includes: a main node determination module 510, a main node sorting module 520, a child node determination module 530 and a target table determination module 540.
[0085] The master node determination module 510 is used to obtain a target structure diagram of a target distribution network, traverse the target structure diagram, and determine at least one master node from each of the nodes in the target structure diagram; the target distribution network is a radial distribution network, and the target structure diagram contains multiple nodes;
[0086] A master node sorting module 520 is used to sort the master nodes and add the node identifiers of the sorted master nodes to the first column of the original table in sequence;
[0087] The child node determination module 530 is used to determine each node related to the target main node, and add the node identifier of each node to the row corresponding to the target main node in the original table;
[0088] The target table determination module 540 is used to obtain a target table storing the target power distribution network structure in response to a traversal completion instruction of all nodes of the target structure graph.
[0089] The scheme of this embodiment obtains the target structure diagram of the target distribution network through the main node determination module, and traverses the target structure diagram to determine at least one main node from each of the nodes in the target structure diagram; the target distribution network is a radial distribution network, and the target structure diagram contains multiple nodes; the main nodes are sorted through the main node sorting module, and the node identifiers of the sorted main nodes are added to the first column of the original table in turn; the nodes related to the target main node are determined through the child node determination module, and the node identifiers of the nodes are added to the rows corresponding to the target main nodes in the original table; the target table determination module responds to the traversal completion instruction of all nodes in the target structure diagram to obtain a target table storing the target distribution network structure, which can quickly and accurately store the network structure of the distribution network, and provide a basis for subsequently improving the efficiency of power flow calculation for the distribution network.
[0090] In an optional implementation of this embodiment, the main node determination module 510 is specifically used to traverse each node of the target structure graph to determine whether each node contains a subsequent node;
[0091] In the case where it is determined that the target node includes a subsequent node, the target node is determined as a master node.
[0092] In an optional implementation of this embodiment, the master node sorting module 520 is specifically configured to determine a starting master node from the master nodes;
[0093] The master nodes are sorted according to the distance between the starting master node and other master nodes to obtain a target queue; each element in the target queue is a node identifier of each master node, and the first element is the node identifier of the starting master node;
[0094] Each element of the target queue is added to the first column of the original table; the original table is a blank table.
[0095] In an optional implementation of this embodiment, the main node sorting module 520 is further specifically used to calculate the node distances between the initial node and each main node according to the target structure graph, and sort the node distances in ascending order to obtain sorted node distances;
[0096] Determine a node identifier of a target master node corresponding to a target node distance, and replace the target node distance with the node identifier;
[0097] After all node distances are replaced, the target queue is obtained.
[0098] In an optional implementation of this embodiment, the child node determination module 530 is specifically used to determine the number of nodes connected to the target master node and the node identifier of each of the nodes;
[0099] The number and the node identifier of each node are sequentially added to the row corresponding to the target master node in the original table.
[0100] In an optional implementation of this embodiment, the storage device of the distribution network structure further includes: a power flow calculation module, which is used to respond to the power flow calculation instruction of the target distribution network and perform power flow calculation on the target distribution network based on the target table.
[0101] In an optional implementation of this embodiment, the storage device of the distribution network structure further includes: a structure diagram modification module, which is used to determine a modification instance corresponding to the target structure diagram in response to a modification instruction of the target structure diagram;
[0102] adjusting the target table based on the modification instance;
[0103] The modification instruction includes at least one of the following: adding, deleting and replacing.
[0104] The storage device of the distribution network structure provided in the embodiment of the present invention can execute the storage method of the distribution network structure provided in any embodiment of the present invention, and has the functional modules and beneficial effects corresponding to the execution method.
[0105] Embodiment 4
[0106] Figure 6 A schematic diagram of the structure of an electronic device 10 that can be used to implement an embodiment of the present invention is shown. The electronic device is intended to represent various forms of digital computers, such as laptop computers, desktop computers, workstations, personal digital assistants, servers, blade servers, mainframe computers, and other suitable computers. The electronic device can also represent various forms of mobile devices, such as personal digital processing, cellular phones, smart phones, wearable devices (such as helmets, glasses, watches, etc.) and other similar computing devices. The components shown herein, their connections and relationships, and their functions are merely examples and are not intended to limit the implementation of the present invention described and / or required herein.
[0107] like Figure 6 As shown, the electronic device 10 includes at least one processor 11, and a memory connected to the at least one processor 11, such as a read-only memory (ROM) 12, a random access memory (RAM) 13, etc., wherein the memory stores a computer program that can be executed by at least one processor, and the processor 11 can perform various appropriate actions and processes according to the computer program stored in the read-only memory (ROM) 12 or the computer program loaded from the storage unit 18 to the random access memory (RAM) 13. In the RAM 13, various programs and data required for the operation of the electronic device 10 can also be stored. The processor 11, the ROM 12, and the RAM 13 are connected to each other through a bus 14. An input / output (I / O) interface 15 is also connected to the bus 14.
[0108] A number of components in the electronic device 10 are connected to the I / O interface 15, including: an input unit 16, such as a keyboard, a mouse, etc.; an output unit 17, such as various types of displays, speakers, etc.; a storage unit 18, such as a disk, an optical disk, etc.; and a communication unit 19, such as a network card, a modem, a wireless communication transceiver, etc. The communication unit 19 allows the electronic device 10 to exchange information / data with other devices through a computer network such as the Internet and / or various telecommunication networks.
[0109] The processor 11 may be a variety of general and / or special processing components with processing and computing capabilities. Some examples of the processor 11 include, but are not limited to, a central processing unit (CPU), a graphics processing unit (GPU), various dedicated artificial intelligence (AI) computing chips, various processors running machine learning model algorithms, digital signal processors (DSPs), and any appropriate processors, controllers, microcontrollers, etc. The processor 11 executes the various methods and processes described above, such as a storage method for a distribution network structure.
[0110] In some embodiments, the storage method of the distribution network structure may be implemented as a computer program, which is tangibly contained in a computer-readable storage medium, such as a storage unit 18. In some embodiments, part or all of the computer program may be loaded and / or installed on the electronic device 10 via the ROM 12 and / or the communication unit 19. When the computer program is loaded into the RAM 13 and executed by the processor 11, one or more steps of the storage method of the distribution network structure described above may be performed. Alternatively, in other embodiments, the processor 11 may be configured to execute the storage method of the distribution network structure in any other appropriate manner (e.g., by means of firmware).
[0111] Various implementations of the systems and techniques described above herein can be implemented in digital electronic circuit systems, integrated circuit systems, field programmable gate arrays (FPGAs), application specific integrated circuits (ASICs), application specific standard products (ASSPs), systems on chips (SOCs), load programmable logic devices (CPLDs), computer hardware, firmware, software, and / or combinations thereof. These various implementations can include: being implemented in one or more computer programs that can be executed and / or interpreted on a programmable system including at least one programmable processor, which can be a special purpose or general purpose programmable processor that can receive data and instructions from a storage system, at least one input device, and at least one output device, and transmit data and instructions to the storage system, the at least one input device, and the at least one output device.
[0112] Computer programs for implementing the methods of the present invention may be written in any combination of one or more programming languages. These computer programs may be provided to a processor of a general-purpose computer, a special-purpose computer, or other programmable data processing device, so that when the computer program is executed by the processor, the functions / operations specified in the flow chart and / or block diagram are implemented. The computer program may be executed entirely on the machine, partially on the machine, partially on the machine and partially on a remote machine as a stand-alone software package, or entirely on a remote machine or server.
[0113] In the context of the present invention, a computer-readable storage medium may be a tangible medium that may contain or store a computer program for use by or in combination with an instruction execution system, device or equipment. A computer-readable storage medium may include, but is not limited to, electronic, magnetic, optical, electromagnetic, infrared, or semiconductor systems, devices or equipment, or any suitable combination of the foregoing. Alternatively, a computer-readable storage medium may be a machine-readable signal medium. A more specific example of a machine-readable storage medium may include an electrical connection based on one or more lines, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.
[0114] To provide interaction with a user, the systems and techniques described herein may be implemented on an electronic device having: a display device (e.g., a CRT (cathode ray tube) or LCD (liquid crystal display) monitor) for displaying information to the user; and a keyboard and a pointing device (e.g., a mouse or trackball) through which the user can provide input to the electronic device. Other types of devices may also be used to provide interaction with the user; for example, the feedback provided to the user may be any form of sensory feedback (e.g., visual feedback, auditory feedback, or tactile feedback); and input from the user may be received in any form (including acoustic input, voice input, or tactile input).
[0115] The systems and techniques described herein may be implemented in a computing system that includes backend components (e.g., as a data server), or a computing system that includes middleware components (e.g., an application server), or a computing system that includes frontend components (e.g., a user computer with a graphical user interface or a web browser through which a user can interact with implementations of the systems and techniques described herein), or a computing system that includes any combination of such backend components, middleware components, or frontend components. The components of the system may be interconnected by any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include: a local area network (LAN), a wide area network (WAN), a blockchain network, and the Internet.
[0116] A computing system may include a client and a server. The client and the server are generally remote from each other and usually interact through a communication network. The client and server relationship is generated by computer programs running on the corresponding computers and having a client-server relationship with each other. The server may be a cloud server, also known as a cloud computing server or cloud host, which is a host product in the cloud computing service system to solve the defects of difficult management and weak business scalability in traditional physical hosts and VPS services.
[0117] It should be understood that the various forms of processes shown above can be used to reorder, add or delete steps. For example, the steps described in the present invention can be executed in parallel, sequentially or in different orders, as long as the desired results of the technical solution of the present invention can be achieved, and this document does not limit this.
[0118] The above specific implementations do not constitute a limitation on the protection scope of the present invention. It should be understood by those skilled in the art that various modifications, combinations, sub-combinations and substitutions can be made according to design requirements and other factors. Any modification, equivalent substitution and improvement made within the spirit and principle of the present invention should be included in the protection scope of the present invention.
Claims
1. A storage method for a distribution network structure, characterized in that: include: Obtaining a target structure diagram of a target distribution network, traversing the target structure diagram, and determining at least one main node from each node of the target structure diagram; The target distribution network is a radial distribution network, and the target structure diagram includes a plurality of nodes; Sorting the master nodes, and sequentially adding the node identifiers of the sorted master nodes to the first column of the original table; Determine each node related to the target master node, and add the node identifier of each node to the row corresponding to the target master node in the original table; In response to a traversal completion instruction for all nodes of the target structure graph, a target table storing the target power distribution network structure is obtained.
2. The method for storing the distribution network structure according to claim 1, characterized in that: The traversing the target structure graph and determining at least one main node from each of the nodes in the target structure graph includes: Traversing each node of the target structure graph to determine whether each node contains a subsequent node; In the case where it is determined that the target node includes a subsequent node, the target node is determined as a master node.
3. The method for storing the distribution network structure according to claim 1, characterized in that: Sorting the master nodes, and sequentially adding the node identifiers of the sorted master nodes to the first column of the original table, including: Determine a starting master node from among the master nodes; The master nodes are sorted according to the distance between the starting master node and other master nodes to obtain a target queue; each element in the target queue is a node identifier of each master node, and the first element is the node identifier of the starting master node; Each element of the target queue is added to the first column of the original table; the original table is a blank table.
4. The method for storing the distribution network structure according to claim 3, characterized in that: The master nodes are sorted according to the distances between the starting master node and other master nodes to obtain a target queue, including: Calculate the node distances between the initial node and each main node according to the target structure graph, and sort the node distances from small to large to obtain sorted node distances; Determine a node identifier of a target master node corresponding to a target node distance, and replace the target node distance with the node identifier; After all node distances are replaced, the target queue is obtained.
5. The method for storing the distribution network structure according to claim 1, characterized in that: The determining of each node related to the target master node and adding the node identifier of each node to the row corresponding to the target master node in the original table includes: Determining the number of nodes connected to the target master node and the node identifier of each of the nodes; The number and the node identifier of each node are sequentially added to the row corresponding to the target master node in the original table.
6. The method for storing the distribution network structure according to any one of claims 1 to 5, characterized in that: After obtaining the target table storing the target distribution network structure, the method further includes: In response to the power flow calculation instruction of the target power distribution network, power flow calculation is performed on the target power distribution network based on the target table.
7. The method for storing the distribution network structure according to any one of claims 1 to 5, characterized in that: After obtaining the target table storing the target distribution network structure, the method further includes: In response to a modification instruction of the target structure diagram, determining a modification instance corresponding to the target structure diagram; adjusting the target table based on the modification instance; The modification instruction includes at least one of the following: adding, deleting and replacing.
8. A storage device for a distribution network structure, characterized in that: include: A master node determination module is used to obtain a target structure diagram of a target distribution network, traverse the target structure diagram, and determine at least one master node from each of the nodes in the target structure diagram; The target distribution network is a radial distribution network, and the target structure diagram includes a plurality of nodes; A master node sorting module, used for sorting the master nodes, and adding the node identification of each sorted master node to the first column of the original table in turn; A subnode determination module, used for determining each node related to the target main node, and adding the node identifier of each node to the row corresponding to the target main node in the original table; The target table determination module is used to obtain a target table storing the target distribution network structure in response to a traversal completion instruction of all nodes of the target structure graph.
9. An electronic device, characterized in that: The electronic device comprises: at least one processor; and a memory communicatively connected to the at least one processor; wherein, The memory stores a computer program executable by the at least one processor, and the computer program is executed by the at least one processor so that the at least one processor can execute the method for storing a distribution network structure according to any one of claims 1 to 7.
10. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores computer instructions, and the computer instructions are used to enable a processor to implement the storage method of the distribution network structure according to any one of claims 1 to 7 when executed.