CN109743252B - Switching operation path generation method and device, computer equipment and storage medium - Google Patents
Switching operation path generation method and device, computer equipment and storage medium Download PDFInfo
- Publication number
- CN109743252B CN109743252B CN201811589301.7A CN201811589301A CN109743252B CN 109743252 B CN109743252 B CN 109743252B CN 201811589301 A CN201811589301 A CN 201811589301A CN 109743252 B CN109743252 B CN 109743252B
- Authority
- CN
- China
- Prior art keywords
- node
- nodes
- initial
- target
- determining
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Landscapes
- Supply And Distribution Of Alternating Current (AREA)
- Design And Manufacture Of Integrated Circuits (AREA)
Abstract
The application relates to a method and a device for generating a switching operation path, a computer device and a storage medium. The method comprises the following steps: constructing an initial topological structure and a target topological structure of the electric network wiring, wherein the number of nodes of the target topological structure is the same as that of the nodes of the initial topological structure; determining an initial node according to the initial topological structure, and determining a target node according to the target topological structure; taking the adjacent nodes of the initial nodes as current nodes, and determining the shortest path between the initial nodes and the current nodes by a heuristic search algorithm; taking the next adjacent node of the adjacent nodes as a new current node, and determining the shortest path from the initial node to the current node by a heuristic search algorithm until the adjacent node is the target node; and outputting all nodes which are sequentially passed by the shortest path. According to the method and the device, the switching operation path can be automatically acquired, the search space is reduced, and the efficiency is improved.
Description
Technical Field
The present application relates to the technical field of power system scheduling services, and in particular, to a method and an apparatus for generating a switching operation path, a computer device, and a storage medium.
Background
With the continuous development of power systems, the scheduling services of the power systems present complexity and diversity, and the workload of the scheduling services is continuously increased.
At present, most of transformer substation switching operation ticket expert systems are systems based on typical wiring manual setting and do not have flexibility and universality. Meanwhile, in the application of the similar technologies, the purpose of improving the efficiency is mostly achieved only by designing a unique heuristic function, so that the efficiency of the searching method only depends on the heuristic function, and the efficiency is not improved much when a large space is searched.
Considering that a few operations which are basically unchanged and relatively simple are often involved in daily scheduling, if a computer can be used to complete the simple part of the work, the workload of the scheduler is reduced, and more accurate and convenient scheduling can be realized, so that a method for intelligently generating the switching operation sequence is needed to be researched.
Disclosure of Invention
In view of the above, it is desirable to provide a method, an apparatus, a computer device, and a storage medium for generating a switching operation path, which can improve the path generation efficiency.
A method of generating a switching operation path, the method comprising:
constructing an initial topological structure of the wiring of the electric network according to the current wiring condition of the electric network;
constructing a target topological structure of the wiring of the electric network according to the required wiring condition of the electric network, wherein the number of nodes of the target topological structure is the same as that of the nodes of the initial topological structure;
determining an initial node according to the initial topological structure, and determining a target node according to the target topological structure;
taking the adjacent nodes of the initial nodes as current nodes, and determining the shortest path between the initial nodes and the current nodes by a heuristic search algorithm;
taking the next adjacent node of the adjacent nodes as a new current node, and determining the shortest path from the initial node to the current node by a heuristic search algorithm until the adjacent node is the target node;
and outputting all nodes which are sequentially passed by the shortest path.
In one embodiment, the step of constructing an initial topology of the electrical network wiring comprises:
constructing an initial state matrix of the electric network wiring, wherein elements in the initial state matrix represent the connection relation between each node and each branch in the electric network wiring;
the step of constructing a target topology of the electrical network wiring comprises:
and constructing a target state matrix of the electric network wiring, wherein the row number of the target state matrix is equal to that of the initial state matrix, and the column number of the target state matrix is equal to that of the initial state matrix.
In one embodiment, the step of determining the shortest path between the initial node and the current node by a heuristic search algorithm comprises:
calculating the number of steps between the initial node and the current node through each branch according to the following formula (1)
f(n)＝g(n)+h(n) (1)；
Wherein g (n) represents the number of steps from the initial node to the current node n through a branch, and h (n) represents the number of steps still needed from the current node n to the target node;
and determining the branch with the minimum value of f (n) as the shortest path.
In one embodiment, before the step of determining the shortest path between the initial node and the current node by using a heuristic search algorithm, the method further comprises:
and deleting the nodes which do not meet the preset conditions.
In one embodiment, the method further comprises:
and determining the nodes which are sequentially passed by the optimal path as position points needing switching operation.
In one embodiment, the preset conditions include:
the potentials of the two buses connected with the branch are equal; and/or
The communication state of the load node and the power supply node is the same as the preset state.
An apparatus for generating a switching operation path, the apparatus comprising:
the first construction module is used for constructing an initial topological structure of the wiring of the electric network according to the current wiring condition of the electric network;
the second building module is used for building a target topological structure of the electric network wiring according to the required wiring condition of the electric network, and the number of nodes of the target topological structure is the same as that of the nodes of the initial topological structure;
the node determining module is used for determining an initial node according to the initial topological structure and determining a target node according to the target topological structure;
the path determining module is used for determining the shortest path between the initial node and the current node by using the adjacent node of the initial node as the current node through a heuristic search algorithm;
the iteration module is used for determining the shortest path between the initial node and the current node by taking the next adjacent node of the adjacent nodes as a new current node through a heuristic search algorithm until the adjacent node is the target node;
and the output module is used for outputting all nodes which are sequentially passed by the shortest path.
In one embodiment, the iteration module comprises:
a calculating unit, configured to calculate the number of steps between the initial node and the current node through each branch according to a formula f (n) ═ g (n) + h (n), where g (n) represents the number of steps from the initial node to the current node n through one branch, and h (n) represents the number of steps still needed to be taken from the current node n to the target node;
and the path determining unit is used for determining one branch with the minimum value of f (n) as the shortest path.
A computer device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, the processor implementing the following steps when executing the computer program:
constructing an initial topological structure of the wiring of the electric network according to the current wiring condition of the electric network;
constructing a target topological structure of the wiring of the electric network according to the required wiring condition of the electric network, wherein the number of nodes of the target topological structure is the same as that of the nodes of the initial topological structure;
determining an initial node according to the initial topological structure, and determining a target node according to the target topological structure;
taking the adjacent nodes of the initial nodes as current nodes, and determining the shortest path between the initial nodes and the current nodes by a heuristic search algorithm;
taking the next adjacent node of the adjacent nodes as a new current node, and determining the shortest path from the initial node to the current node by a heuristic search algorithm until the adjacent node is the target node;
and outputting all nodes which are sequentially passed by the shortest path.
A computer-readable storage medium, on which a computer program is stored which, when executed by a processor, carries out the steps of:
constructing an initial topological structure of the wiring of the electric network according to the current wiring condition of the electric network;
constructing a target topological structure of the wiring of the electric network according to the required wiring condition of the electric network, wherein the number of nodes of the target topological structure is the same as that of the nodes of the initial topological structure;
determining an initial node according to the initial topological structure, and determining a target node according to the target topological structure;
taking the adjacent nodes of the initial nodes as current nodes, and determining the shortest path between the initial nodes and the current nodes by a heuristic search algorithm;
taking the next adjacent node of the adjacent nodes as a new current node, and determining the shortest path from the initial node to the current node by a heuristic search algorithm until the adjacent node is the target node;
and outputting all nodes which are sequentially passed by the shortest path.
According to the method, the device, the computer equipment and the storage medium for generating the switching operation path, the initial topological structure and the target topological structure of the electric network wiring are constructed, the two topological structures are compared, the positions with different wiring states are determined, then nodes which need switching in sequence from the initial wiring state to the target wiring state are searched through a heuristic algorithm, the switching operation path is automatically acquired, the search space is reduced, and the efficiency is improved.
Drawings
FIG. 1 is a diagram of an embodiment of an application environment for a method for generating a switching operation path;
FIG. 2 is a flowchart illustrating a method for generating a switching operation path according to an embodiment;
FIG. 3 is a flowchart illustrating a method for generating a switching operation path according to another embodiment;
FIG. 4 is a block diagram showing an example of a device for generating a switching operation path;
FIG. 5 is a diagram illustrating an internal structure of a computer device according to an embodiment.
Detailed Description
In order to make the objects, technical solutions and advantages of the present application more apparent, the present application is described in further detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the present application and are not intended to limit the present application.
The method for generating the switching operation path can be applied to the application environment shown in fig. 1. Wherein the terminal 102 communicates with the server 104 via a network. The terminal 102 may be, but not limited to, various personal computers, notebook computers, smart phones, tablet computers, and portable wearable devices, and the server 104 may be implemented by an independent server or a server cluster formed by a plurality of servers.
In one embodiment, as shown in fig. 2, a method for generating a switching operation path is provided, which is described by taking the method as an example applied to the terminal in fig. 1, and includes the following steps:
step 201, constructing an initial topological structure of electric network wiring according to the current wiring condition of an electric network;
step 202, constructing a target topological structure of the electric network wiring according to the required wiring condition of the electric network, wherein the number of nodes of the target topological structure is the same as that of the nodes of the initial topological structure;
step 203, determining an initial node according to the initial topological structure, and determining a target node according to the target topological structure;
step 204, taking the adjacent node of the initial node as the current node, and determining the shortest path between the initial node and the current node through a heuristic search algorithm;
step 205, using the next adjacent node of the adjacent nodes as a new current node, and determining the shortest path from the initial node to the current node by a heuristic search algorithm until the adjacent node is the target node;
and step 206, outputting all nodes which are sequentially passed by the shortest path.
And the nodes which are sequentially passed by the optimal path are the position points which need switching operation.
The heuristic search algorithm is to use heuristic information owned by the problem to guide the search direction so as to achieve the purpose of reducing the complexity of the problem. In the biomedical field, a Chinese minority harmony search algorithm is proposed, and the algorithm guides the search of a borderless effect model by taking joint entropy as a heuristic factor so as to adapt to various disease models; in the field of unmanned aerial vehicles, a hierarchical heuristic search based on a Gaussian mixture model is proposed, and a flight path is obtained by prioritizing search areas; in the field of network security, a double-target optimization hyperheuristic algorithm is proposed, which takes precision and model complexity as two mutually conflicting targets and has a good effect on processing the security problem of a big data network.
In the method for generating the switching operation path, the initial topological structure and the target topological structure of the electric network wiring are constructed, the two topological structures are compared, the positions with different wiring states are determined, then nodes which need switching in sequence from the initial wiring state to the target wiring state are searched through a heuristic algorithm, the switching operation path is automatically acquired, the search space is reduced, and the efficiency is improved.
In one embodiment, the step of constructing an initial topology of the electrical network wiring comprises:
constructing an initial state matrix of the electric network wiring, wherein elements in the initial state matrix represent the connection relation between each node and each branch in the electric network wiring;
the step of constructing a target topology of the electrical network wiring comprises:
and constructing a target state matrix of the electric network wiring, wherein the row number of the target state matrix is equal to that of the initial state matrix, and the column number of the target state matrix is equal to that of the initial state matrix.
Wherein a row of the initial state matrix represents a number of nodes of the electrical network connection and a column of the initial state matrix represents a number of branches of the electrical network connection. The characterization of the rows and columns of the target state matrix is the same as the rows and columns of the initial state matrix, except for the wiring state of the electrical network.
In one embodiment, the step of determining the shortest path between the initial node and the current node by a heuristic search algorithm comprises:
calculating the number of steps between the initial node and the current node through each branch according to the following formula (1)
f(n)＝g(n)+h(n) (1)；
Wherein g (n) represents the number of steps from the initial node to the current node n through a branch, and h (n) represents the number of steps still needed from the current node n to the target node;
and determining the branch with the minimum value of f (n) as the shortest path.
In one embodiment, before the step of determining the shortest path between the initial node and the current node by a heuristic search algorithm, the method further comprises:
and deleting the nodes which do not meet the preset conditions.
In one embodiment, the method further comprises:
and determining the nodes which are sequentially passed by the optimal path as position points needing switching operation.
In one embodiment, the preset conditions include:
the potentials of the two buses connected with the branch are equal; and/or
The communication state of the load node and the power supply node is the same as the preset state.
The application provides an intelligent switching operation path generation method based on heuristic constraint satisfaction search, and the method can realize automatic generation of a main wiring switching operation sequence of a transformer substation. Firstly, a network topological structure of a main wiring of a transformer substation is established in a topological matrix mode, and then a scheme which does not meet constraint conditions is eliminated through the constraint conditions. And then calculating a heuristic function value in the scheme meeting the condition, and selecting the scheme with the minimum heuristic function value to continuously expand.
The flow of the implementation method of the embodiment is as follows:
topological structure for constructing electric network wiring
In the wiring state of the real-time electric network, reading the initial wiring condition, and constructing an n-row m-column matrix, which is called an initial state matrix, wherein n is the number of nodes, and m is the number of branches; the matrix elements represent the connection relation between the nodes and the branches, and the meaning of the specific elements is as follows:
(1) the element '0' represents that the node has no association relation with the branch;
(2) the element '1' represents that the node has a relationship with a branch, and the branch is connected at present;
(3) the element '-1' represents that the node has an association with a branch, and that the branch is currently open.
And determining the target wiring condition, and constructing an n-row m-column matrix, which is called a target state matrix.
Initializing a close _ path table, an open _ path table and a Voltage table, and adding an initial node representing the initial state of the network to the close _ path table.
Node B: a wiring state of the network, i.e. a wiring state matrix.
And (3) node: mainly comprises a bus, a wire outlet end and a wire inlet end.
Voltage table: for storing the real-time node potential.
close _ path table: for storing the expanded sub-nodes. Result of iteration
open _ path table: the method is used for storing the sub-nodes waiting for expansion in the next step, namely storing the nodes which can be switched back and forth in the next step.
Designing a suitable heuristic function
The heuristic function takes the classical form:
f(n)＝g(n)+h(n)
n is the sub-node expanded by the current heuristic search, and is a matrix representing the current wiring state.
f (n) is the computational cost from the starting node to the destination node.
g (n) is the actual cost from the starting node to the current node n, and in this embodiment, g (n) is the number of steps from the starting node to the current node n;
h (n) is an estimated cost from the current node n to the target node, and in the embodiment, the method for obtaining the value of h (n) is as follows:
(1) and comparing matrix elements (of the wiring state) of the current node n and the target node to obtain element positions with different element values in the two matrixes.
(2) And counting the number of different element values in the two matrixes as a value h (n) which represents the number of steps still needed from the current main connection line to the target main connection line.
Thirdly, constructing complete constraint conditions
Wherein the constraint condition comprises:
(1) the potentials of two buses connected with the branch circuits are equal;
(2) the load node cannot be powered off unless the power failure of the load node is required, and the load node is ensured to be communicated with a power supply node;
(3) and the nodes which are not connected with the power supply nodes are regarded as voltage-free nodes.
Fourthly, adopting a heuristic search algorithm, and circularly iterating until a path is found
Fig. 3 is a schematic flow chart of a method for generating a switching operation path in another embodiment, where an implementation method according to this embodiment is shown in fig. 3, and an iterative process is shown in fig. 3, where the iterative process includes:
step S301: and constructing an initial node.
Step S306: and traversing the sub-nodes which can be expanded in the search in turn.
Step S303; and (5) calling a constraint condition, and eliminating the sub-nodes which do not meet the condition.
Step S304: and calculating and updating heuristic function values of all the sub-nodes meeting the conditions.
Step S305: the open _ path table is updated. If the child node is already in the open _ path table, it jumps to step S306.
Step S306: comparing the path to the child node in the current path with the heuristic function value of the stored path to the child node in the open _ path, reserving a smaller path and updating an open _ path table; if the child node is not in the open _ path table, the child node is added into the open _ path table, the child node with the minimum heuristic function value is taken as the child node needing to be expanded in the layer search, deleted from the open _ path table and added into the close _ path table.
Step S307: if the sub-node expanded in the step S306 is the target node, searching for a solution to obtain a path scheme, and stopping searching; and if the expanded sub-node is not the target node in the step S306, returning to the step S302 to continue the loop iteration.
And finally, outputting the action path obtained by searching as a heuristic searching scheme.
It is to be understood that, although the steps in the flowcharts of fig. 2 and 3 are shown in order as indicated by the arrows, the steps are not necessarily performed in order as indicated by the arrows. The steps are not performed in the exact order shown and described, and may be performed in other orders, unless explicitly stated otherwise. Moreover, at least some of the steps in fig. 2 and 3 may include multiple sub-steps or multiple stages that are not necessarily performed at the same time, but may be performed at different times, and the order of performing the sub-steps or stages is not necessarily sequential, but may be performed alternately or alternately with other steps or at least some of the sub-steps or stages of other steps.
In one embodiment, as shown in fig. 4, there is provided a switching operation path generation apparatus 10, which includes a first building module 11, a second building module 12, a node determination module 13, a path determination module 14, an iteration module 15, and an output module 16, wherein:
the first construction module 11 is used for constructing an initial topological structure of the wiring of the electric network according to the current wiring condition of the electric network;
a second constructing module 12, configured to construct a target topology structure of the electrical network connection according to the required connection condition of the electrical network, where the number of nodes of the target topology structure is the same as the number of nodes of the initial topology structure;
a node determining module 13, configured to determine an initial node according to the initial topological structure, and determine a target node according to the target topological structure;
a path determining module 14, configured to determine, by using an heuristic search algorithm, a shortest path between an initial node and a current node, where the adjacent node of the initial node is used as the current node;
an iteration module 15, configured to determine, by using a heuristic search algorithm, a shortest path between the initial node and a current node until a next adjacent node of the adjacent nodes is the target node, where the next adjacent node of the adjacent nodes is a new current node;
and the output module 16 is used for outputting all the nodes which are sequentially passed by the shortest path.
In one embodiment, the first building module 11 is specifically configured to build an initial state matrix of the electrical network connection, where elements in the initial state matrix represent connection relationships between nodes and branches in the electrical network connection; the second building module 12 is specifically configured to build a target state matrix of the electrical network connection, where a row number of the target state matrix is equal to a row number of the initial state matrix, and a column number of the target state matrix is equal to a column number of the initial state matrix.
In one embodiment, the iteration module 14 includes:
a calculating unit, configured to calculate, according to a formula f (n) ═ g (n) + h (n), the number of steps between the initial node and the current node through each branch, where g (n) represents the number of steps from the initial node to the current node n through one branch, and h (n) represents the number of steps still needed to be taken from the current node n to the target node;
and the path determining unit is used for determining one branch with the minimum value of f (n) as the shortest path.
In one embodiment, the apparatus 10 for generating a switching operation path further includes:
and the deleting module is used for deleting the nodes which do not meet the preset conditions.
In one embodiment, the apparatus 10 for generating a switching operation path further includes:
and the position point determining module is used for determining the nodes which are sequentially passed by the optimal path as the position points which need switching operation.
In one embodiment, the preset conditions include:
the potentials of the two buses connected with the branch are equal; and/or
The communication state of the load node and the power supply node is the same as the preset state.
For specific definition of the generating device of the switching operation path, reference may be made to the above definition of the generating method of the switching operation path, and details are not described here. The modules in the device for generating the switching operation path may be implemented in whole or in part by software, hardware, or a combination thereof. The modules can be embedded in a hardware form or independent from a processor in the computer device, and can also be stored in a memory in the computer device in a software form, so that the processor can call and execute operations corresponding to the modules.
In one embodiment, a computer device is provided, which may be a terminal, and its internal structure diagram may be as shown in fig. 5. The computer device includes a processor, a memory, a network interface, a display screen, and an input device connected by a system bus. Wherein the processor of the computer device is configured to provide computing and control capabilities. The memory of the computer device comprises a nonvolatile storage medium and an internal memory. The non-volatile storage medium stores an operating system and a computer program. The internal memory provides an environment for the operation of an operating system and computer programs in the non-volatile storage medium. The network interface of the computer device is used for communicating with an external terminal through a network connection. The computer program is executed by a processor to implement a method for generating a switching operation path. The display screen of the computer equipment can be a liquid crystal display screen or an electronic ink display screen, and the input device of the computer equipment can be a touch layer covered on the display screen, a key, a track ball or a touch pad arranged on the shell of the computer equipment, an external keyboard, a touch pad or a mouse and the like.
Those skilled in the art will appreciate that the architecture shown in fig. 5 is merely a block diagram of some of the structures associated with the disclosed aspects and is not intended to limit the computing devices to which the disclosed aspects apply, as particular computing devices may include more or less components than those shown, or may combine certain components, or have a different arrangement of components.
In one embodiment, a computer device is provided, comprising a memory, a processor, and a computer program stored on the memory and executable on the processor, the processor implementing the following steps when executing the computer program:
constructing an initial topological structure of the wiring of the electric network according to the current wiring condition of the electric network;
constructing a target topological structure of the wiring of the electric network according to the required wiring condition of the electric network, wherein the number of nodes of the target topological structure is the same as that of the nodes of the initial topological structure;
determining an initial node according to the initial topological structure, and determining a target node according to the target topological structure;
taking the adjacent nodes of the initial nodes as current nodes, and determining the shortest path between the initial nodes and the current nodes by a heuristic search algorithm;
taking the next adjacent node of the adjacent nodes as a new current node, and determining the shortest path from the initial node to the current node by a heuristic search algorithm until the adjacent node is the target node;
and outputting all nodes which are sequentially passed by the shortest path.
In one embodiment, the processor, when executing the computer program, further performs the steps of:
constructing an initial state matrix of the electric network wiring, wherein elements in the initial state matrix represent the connection relation between each node and each branch in the electric network wiring;
and constructing a target state matrix of the electric network wiring, wherein the row number of the target state matrix is equal to that of the initial state matrix, and the column number of the target state matrix is equal to that of the initial state matrix.
In one embodiment, the processor, when executing the computer program, further performs the steps of:
calculating the number of steps between the initial node and the current node through each branch according to the following formula (1)
f(n)＝g(n)+h(n) (1)；
Wherein g (n) represents the number of steps from the initial node to the current node n through a branch, and h (n) represents the number of steps still needed from the current node n to the target node;
and determining the branch with the minimum value of f (n) as the shortest path.
In one embodiment, the processor, when executing the computer program, further performs the steps of:
and deleting the nodes which do not meet the preset conditions.
In one embodiment, the processor, when executing the computer program, further performs the steps of:
and determining the nodes which are sequentially passed by the optimal path as position points needing switching operation.
In one embodiment, the preset conditions include: the potentials of the two buses connected with the node by the branch are equal; and/or the connection state of the node and the power supply node is the same as the preset state.
In one embodiment, a computer-readable storage medium is provided, having a computer program stored thereon, which when executed by a processor, performs the steps of:
constructing an initial topological structure of the wiring of the electric network according to the current wiring condition of the electric network;
constructing a target topological structure of the wiring of the electric network according to the required wiring condition of the electric network, wherein the number of nodes of the target topological structure is the same as that of the nodes of the initial topological structure;
determining an initial node according to the initial topological structure, and determining a target node according to the target topological structure;
taking the adjacent nodes of the initial nodes as current nodes, and determining the shortest path between the initial nodes and the current nodes by a heuristic search algorithm;
taking the next adjacent node of the adjacent nodes as a new current node, and determining the shortest path from the initial node to the current node by a heuristic search algorithm until the adjacent node is the target node;
and outputting all nodes which are sequentially passed by the shortest path.
In one embodiment, the computer program when executed by the processor further performs the steps of:
constructing an initial state matrix of the electric network connection, wherein elements in the initial state matrix represent the connection relation between each node and each branch in the electric network connection;
and constructing a target state matrix of the electric network wiring, wherein the row number of the target state matrix is equal to that of the initial state matrix, and the column number of the target state matrix is equal to that of the initial state matrix.
In one embodiment, the computer program when executed by the processor further performs the steps of:
calculating the number of steps between the initial node and the current node through each branch according to the following formula (1)
f(n)＝g(n)+h(n) (1)；
Wherein g (n) represents the number of steps from the initial node to the current node n through a branch, and h (n) represents the number of steps still needed from the current node n to the target node;
and determining the branch with the minimum value of f (n) as the shortest path.
In one embodiment, the computer program when executed by the processor further performs the steps of:
and deleting the nodes which do not meet the preset conditions.
In one embodiment, the computer program when executed by the processor further performs the steps of:
and determining the nodes which are sequentially passed by the optimal path as position points needing switching operation.
In one embodiment, the preset conditions include: the potentials of the two buses connected with the node by the branch are equal; and/or the connection state of the node and the power supply node is the same as the preset state.
It will be understood by those skilled in the art that all or part of the processes of the methods of the embodiments described above can be implemented by hardware instructions of a computer program, which can be stored in a non-volatile computer-readable storage medium, and when executed, can include the processes of the embodiments of the methods described above. Any reference to memory, storage, database, or other medium used in the embodiments provided herein may include non-volatile and/or volatile memory, among others. Non-volatile memory can include read-only memory (ROM), Programmable ROM (PROM), Electrically Programmable ROM (EPROM), Electrically Erasable Programmable ROM (EEPROM), or flash memory. Volatile memory can include Random Access Memory (RAM) or external cache memory. By way of illustration and not limitation, RAM is available in a variety of forms such as Static RAM (SRAM), Dynamic RAM (DRAM), Synchronous DRAM (SDRAM), Double Data Rate SDRAM (DDRSDRAM), Enhanced SDRAM (ESDRAM), Synchronous Link DRAM (SLDRAM), Rambus Direct RAM (RDRAM), direct bus dynamic RAM (DRDRAM), and memory bus dynamic RAM (RDRAM).
The technical features of the above embodiments can be arbitrarily combined, and for the sake of brevity, all possible combinations of the technical features in the above embodiments are not described, but should be considered as the scope of the present specification as long as there is no contradiction between the combinations of the technical features.
The above-mentioned embodiments only express several embodiments of the present application, and the description thereof is more specific and detailed, but not construed as limiting the scope of the invention. It should be noted that, for a person skilled in the art, several variations and modifications can be made without departing from the concept of the present application, which falls within the scope of protection of the present application. Therefore, the protection scope of the present patent shall be subject to the appended claims.
Claims (10)
1. A method for generating a switching operation path, the method comprising:
constructing an initial topological structure of the wiring of the electric network according to the current wiring condition of the electric network;
constructing a target topological structure of the wiring of the electric network according to the required wiring condition of the electric network, wherein the number of nodes of the target topological structure is the same as that of the nodes of the initial topological structure;
determining an initial node according to the initial topological structure, and determining a target node according to the target topological structure;
taking the adjacent nodes of the initial nodes as current nodes, deleting the nodes which do not meet preset conditions, and determining the shortest path between the initial nodes and the current nodes by a heuristic search algorithm;
and taking the next adjacent node of the adjacent nodes as a new current node, and deleting the nodes which do not meet the preset conditions, wherein the preset conditions comprise that: the potentials of the two buses connected with the branch are equal; and/or the communication state of the load node and the power supply node is the same as the preset state; determining the shortest path between the initial node and the current node through a heuristic search algorithm until the adjacent node is the target node; the determining the shortest path between the initial node and the current node by a heuristic search algorithm specifically includes: calculating the number of steps between the initial node and the current node through each branch according to the following formula (1)
f(n)＝g(n)+h(n) (1)；
Wherein g (n) represents the number of steps from the initial node to the current node n through a branch, and h (n) represents the number of steps still needed from the current node n to the target node;
determining one branch with the minimum (n) value as the shortest path;
and outputting all nodes which are sequentially passed by the shortest path.
2. The method of claim 1, wherein the step of constructing an initial topology of electrical network wiring comprises:
constructing an initial state matrix of the electric network connection, wherein elements in the initial state matrix represent the connection relation between each node and a branch in the electric network connection;
the step of constructing a target topology of the electrical network wiring comprises:
and constructing a target state matrix of the electric network wiring, wherein the row number of the target state matrix is equal to that of the initial state matrix, and the column number of the target state matrix is equal to that of the initial state matrix.
3. The method of claim 1, wherein a node that has no connection to the power source node is treated as a no-voltage node.
4. The method of claim 2, wherein a row of the initial state matrix identifies a number of nodes of the electrical network connection and a column of the initial state matrix identifies a number of branches of the electrical network connection.
5. A method according to any one of claims 1 to 3, characterized in that the method further comprises:
and determining the nodes which are sequentially passed by the shortest path as position points needing switching operation.
6. An apparatus for generating a switching operation path, the apparatus comprising:
the first construction module is used for constructing an initial topological structure of the wiring of the electric network according to the current wiring condition of the electric network;
the second construction module is used for constructing a target topological structure of the electric network wiring according to the required wiring condition of the electric network, and the number of nodes of the target topological structure is the same as that of the nodes of the initial topological structure;
the node determining module is used for determining an initial node according to the initial topological structure and determining a target node according to the target topological structure;
the path determining module is used for deleting the nodes which do not meet the preset conditions by taking the adjacent nodes of the initial nodes as the current nodes, and determining the shortest path between the initial nodes and the current nodes through a heuristic search algorithm;
an iteration module, configured to use a next adjacent node of the adjacent nodes as a new current node, and delete a node that does not satisfy the preset condition, where the preset condition includes: the potentials of the two buses connected with the branch are equal; and/or the communication state of the load node and the power supply node is the same as the preset state; determining the shortest path between the initial node and the current node through a heuristic search algorithm until the adjacent node is the target node; the iteration module comprises a calculation unit and a path determination unit, wherein the calculation unit is used for calculating the step number between the initial node and the current node through each branch according to the following formula (1)
f(n)＝g(n)+h(n) (1)；
Wherein g (n) represents the number of steps from the initial node to the current node n through a branch, and h (n) represents the number of steps still needed from the current node n to the target node;
the path determining unit is used for determining one branch with the minimum value of f (n) as the shortest path;
and the output module is used for outputting all nodes which are sequentially passed by the shortest path.
7. The apparatus of claim 6, further comprising:
and the deleting module is used for deleting the nodes which do not meet the preset conditions.
8. The apparatus of claim 6, further comprising:
and the position point determining module is used for determining the nodes which are sequentially passed by the shortest path as the position points which need switching operation.
9. A computer device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, characterized in that the steps of the method of any of claims 1 to 5 are implemented by the processor when executing the computer program.
10. A computer-readable storage medium, on which a computer program is stored, which, when being executed by a processor, carries out the steps of the method of any one of claims 1 to 5.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811589301.7A CN109743252B (en) | 2018-12-25 | 2018-12-25 | Switching operation path generation method and device, computer equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811589301.7A CN109743252B (en) | 2018-12-25 | 2018-12-25 | Switching operation path generation method and device, computer equipment and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109743252A CN109743252A (en) | 2019-05-10 |
| CN109743252B true CN109743252B (en) | 2021-08-31 |
Family
ID=66361201
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811589301.7A Active CN109743252B (en) | 2018-12-25 | 2018-12-25 | Switching operation path generation method and device, computer equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109743252B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111309989A (en) * | 2020-02-13 | 2020-06-19 | 平安科技（深圳）有限公司 | Graph database-based shortest path query method and related equipment |
| CN116613892B (en) * | 2023-07-18 | 2024-02-27 | 南方电网数字电网研究院有限公司 | Device incremental topology analysis method, device, computer device and storage medium |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102420392A (en) * | 2011-07-30 | 2012-04-18 | 山东鲁能智能技术有限公司 | Transformer substation inspection robot global path planning method based on magnetic navigation |
| JP2012147271A (en) * | 2011-01-12 | 2012-08-02 | Nippon Telegr & Teleph Corp <Ntt> | Monitoring controller, communication route setting method, and program |
| CN103199521A (en) * | 2013-02-18 | 2013-07-10 | 天津市电力公司 | Power network planning construction method based on network reconstruction and optimized load-flow simulating calculation |
| CN105590145A (en) * | 2016-01-11 | 2016-05-18 | 北京交通大学 | Identification method and apparatus of shortest connecting distance between primary devices in substation |
| CN107437799A (en) * | 2016-05-27 | 2017-12-05 | 国家电网公司 | A kind of appraisal procedure for determining power network bulk transmission grid circuit |
| CN107516896A (en) * | 2017-08-28 | 2017-12-26 | 国网江苏省电力公司技能培训中心 | A kind of load restoration scheme generation method based on decision tree pruning algorithms |
| CN107527112A (en) * | 2017-07-31 | 2017-12-29 | 全球能源互联网研究院有限公司 | The method and apparatus of shortest path between a kind of determination power equipment |
-
2018
- 2018-12-25 CN CN201811589301.7A patent/CN109743252B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2012147271A (en) * | 2011-01-12 | 2012-08-02 | Nippon Telegr & Teleph Corp <Ntt> | Monitoring controller, communication route setting method, and program |
| CN102420392A (en) * | 2011-07-30 | 2012-04-18 | 山东鲁能智能技术有限公司 | Transformer substation inspection robot global path planning method based on magnetic navigation |
| CN103199521A (en) * | 2013-02-18 | 2013-07-10 | 天津市电力公司 | Power network planning construction method based on network reconstruction and optimized load-flow simulating calculation |
| CN105590145A (en) * | 2016-01-11 | 2016-05-18 | 北京交通大学 | Identification method and apparatus of shortest connecting distance between primary devices in substation |
| CN107437799A (en) * | 2016-05-27 | 2017-12-05 | 国家电网公司 | A kind of appraisal procedure for determining power network bulk transmission grid circuit |
| CN107527112A (en) * | 2017-07-31 | 2017-12-29 | 全球能源互联网研究院有限公司 | The method and apparatus of shortest path between a kind of determination power equipment |
| CN107516896A (en) * | 2017-08-28 | 2017-12-26 | 国网江苏省电力公司技能培训中心 | A kind of load restoration scheme generation method based on decision tree pruning algorithms |
Non-Patent Citations (1)
| Title |
|---|
| 一种大电网潮流转移路径快速搜索方法;陈晓玲，杨军，罗超，孙元章;《电网技术》;20150430;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109743252A (en) | 2019-05-10 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110390387B (en) | Assessment of resources used by deep learning applications | |
| Wang et al. | An effective estimation of distribution algorithm for the flexible job-shop scheduling problem with fuzzy processing time | |
| CN107944610B (en) | Method for predicting event popularity, server and computer-readable storage medium | |
| Wu et al. | Numerical method for reliability analysis of phased-mission system using Markov chains | |
| CA2894325C (en) | Method and system for continuous optimization using a binary sampling device | |
| CN109743252B (en) | Switching operation path generation method and device, computer equipment and storage medium | |
| Kołodziej et al. | Hierarchical genetic-based grid scheduling with energy optimization | |
| Buchholz et al. | Computation of weighted sums of rewards for concurrent MDPs | |
| CN112256886A (en) | Probability calculation method and device in map, computer equipment and storage medium | |
| Lei et al. | Hybrid heuristic search approach for deadlock-free scheduling of flexible manufacturing systems using Petri nets | |
| Wang et al. | A deterministic global optimization algorithm for generalized geometric programming | |
| Sriver et al. | Pattern search ranking and selection algorithms for mixed variable simulation-based optimization | |
| CN115204612A (en) | Method, device, equipment and storage medium for determining carbon emission of power system | |
| Grohmann et al. | Solving multifacility huff location models on networks using metaheuristic and exact approaches | |
| CN110515977A (en) | Data query method, apparatus, computer equipment and storage medium | |
| CN112765833B (en) | Reliability modeling and evaluation method for dynamic tasks of redundant multi-stage task system | |
| CN113723032A (en) | Circuit rapid resolving method and system for large-scale nodes | |
| Chen et al. | Quality optimization of adaptive applications via deep reinforcement learning in energy harvesting edge devices | |
| Alaeddini et al. | An efficient adaptive sequential methodology for expensive response surface optimization | |
| CN110969359A (en) | Power distribution network parallel topology analysis method and device, computer equipment and storage medium | |
| Zeng et al. | Fuzzy systems approach to approximation and stabilization of conventional affine nonlinear systems | |
| CN116561478A (en) | Transformer substation plane layout method based on butterfly algorithm of mixed particle swarm | |
| Csáji et al. | Pagerank optimization in polynomial time by stochastic shortest path reformulation | |
| Li et al. | A unified approach to time-aggregated Markov decision processes | |
| CN114691335A (en) | Task scheduling processing method and device, computer equipment and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| TA01 | Transfer of patent application right | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20200917 Address after: 510620 Tianhe District, Guangzhou, Tianhe South Road, No. two, No. 2, No. Applicant after: Guangzhou Power Supply Bureau of Guangdong Power Grid Co.,Ltd. Address before: 510620 Tianhe District, Guangzhou, Tianhe South Road, No. two, No. 2, No. Applicant before: GUANGZHOU POWER SUPPLY Co.,Ltd. |
|
| GR01 | Patent grant | ||
| GR01 | Patent grant |