Distribution network one-key sequential control command verification method

Abstract

The invention discloses a one-key sequence control command verification method for a distribution network, and the method comprises the following steps: A, building a space coordinate system, and building a distribution network topological structure in the space coordinate system according to a distribution network structure; b, marking action nodes and state nodes involved in a to-be-verified command in the distribution network topological structure, judging whether isolated nodes exist in the action nodes and the state nodes or not, if the isolated nodes exist, judging that the command is illegal, terminating verification, and if the isolated nodes do not exist, turning to the step C; and C, inputting a to-be-verified command into a corresponding action node in the distribution network topological structure, and then judging whether the command is legal or not according to the action vector set of the action node and the state vector set of the state node. According to the invention, defects in the prior art can be improved, and verification efficiency is improved.

Description

Technical Field

[0001] The invention relates to the technical field of operation ticket verification, in particular to a distribution network one-key sequential control command verification method. Background Art

[0002] As the distribution network structure becomes increasingly complex, manual switching operations alone not only require a large workload, but also involve significant risks. One-button sequential control is based on electrical system automation control technology, which enables the system to automatically execute a series of preset operations when the user clicks a case, reducing human operational errors and improving operational safety. It is also necessary to verify the sequential control command before it is issued to avoid command errors.

[0003] The existing verification methods basically follow the verification method of traditional operation tickets, that is, simulating the operation process in the simulation system to verify the correctness of the operation process. Although this method can accurately simulate the operation results, it requires the establishment of an accurate simulation model, which requires a lot of hardware and time costs for complex power grid structures. Another method is to extract the characteristic data of the operation process through the neural network model and verify it by comparing the characteristic data. Although this method does not require the establishment of an accurate simulation model, it requires the use of a large amount of accurate historical data to train the neural network model before it can be used. Moreover, after the power grid structure changes, it needs to be re-trained, which also has the problem of high time cost. Summary of the invention

[0004] The technical problem to be solved by the present invention is to provide a distribution network one-key sequential control command verification method, which can solve the deficiencies of the prior art and improve the verification efficiency.

[0005] In order to solve the above technical problems, the technical solutions adopted by the present invention are as follows.

[0006] A method for verifying a one-key sequential control command of a distribution network comprises the following steps:

[0007] A. Establish a spatial coordinate system and establish a distribution network topology structure in the spatial coordinate system according to the distribution network structure;

[0008] B. Mark the action nodes and status nodes involved in the command to be verified in the distribution network topology structure, and determine whether there are isolated nodes in the above action nodes and status nodes. If there are isolated nodes, the command is determined to be illegal and the verification is terminated. If there are no isolated nodes, go to step C;

[0009] C. Input the command to be verified into the corresponding action node in the distribution network topology structure, and then determine whether the command is legal based on the action vector set of the action node and the state vector set of the state node.

[0010] Preferably, the spatial coordinate system consists of an action information dimension and a state information dimension, the action information includes the adjustment actions of all adjustable mechanisms in the distribution network structure, and the state information includes the collected data of all sensors in the distribution network structure.

[0011] Preferably, the distribution network topology structure includes action nodes and status nodes, each adjustable mechanism corresponds to an action node, the action node includes all adjustment dimensions of the corresponding adjustable mechanism, each sensor corresponds to a status node, the status node includes all data collection dimensions of the corresponding sensor, physical links are set between nodes with actual circuit direct connection, and logical links are set between nodes with logical associations but no actual circuit direct connection.

[0012] Preferably, a bidirectional decision node is provided on the logical link.

[0013] Preferably, after the command to be verified is input into the corresponding action node in the distribution network topology structure, the action node updates the action information, and then performs a first round of status update. The first round of status update is to sequentially update the status nodes that have actual circuit connection relationships with the action node that updates the action information through physical links, and then perform a second round of status update. The second round of status update is to sequentially update the status nodes that have logical connection relationships with the action node that updates the action information and the status node that updates the status information through logical links; an action vector set is obtained based on the action node updating the action information, and a state vector set is obtained based on the results of the two rounds of state updates.

[0014] Preferably, the command input node is used as a reference node, and the action vector is composed of the topological distance between the action node and the reference node, the current adjustment amount of the action node, and the previous adjustment amount of the action node, and then the action vector is normalized.

[0015] Preferably, a corresponding state vector is set for each state node. After the first round of state update is completed, the state data of the first round of update is placed in the state vector. After the second round of state update is completed, the state data of the second round of update is placed in the state vector. When performing the second round of update, the updated action information or state information is sent to the state node to be updated through the logical link. The bidirectional determination node temporarily stores the sent action information or state information. If the bidirectional determination node currently has action information and / or state information stored, the bidirectional determination node stores the action information or state information according to the currently stored action information and / or state information and the information transmission method. The currently sent action information or state information is weighted, the size of the weight is positively correlated with the correlation between the currently stored action information and / or state information and the currently sent action information or state information, and is negatively correlated with the topological distance between the sending node of the currently sent action information or state information and the bidirectional determination node. The positive or negative value of the weight is related to the information sending direction. If the current information sending direction is the same as the sending direction of the information stored in the bidirectional determination node, the weight corresponding to the information stored in the above-mentioned bidirectional determination node is positive weighting, otherwise it is negative weighting, and then the state vector is normalized.

[0016] As a preference, the action vector set is mapped to the complex frequency domain to obtain F a (ω) is the action complex frequency domain function set, N a is the total number of action vectors, f a (n) is the modulus of the nth action vector, and the state vector set is mapped to the complex frequency domain to obtain F s (ω) is the state complex frequency domain function set, Ns is the total number of state vectors, f s (n) is the modulus of the nth state vector; traverse the action complex frequency domain function set and the state complex frequency domain function set, if there are at least two functions in the resonant frequency interval, the command is judged to be illegal, otherwise the name is judged to be legal; the function that produces resonance in the resonant frequency interval has one and only one maximum value or one and only one minimum value, and the periods of the functions that produce resonance are integer multiples of each other.

[0017] The beneficial effect brought by adopting the above technical solution is that: the present invention establishes a simple distribution network topology structure, and uses the topology structure to perform preliminary verification of the operation command. After the verification is passed, an action vector set and a state vector set are generated on the distribution network topology structure, and the action vector set and the state vector set are used to perform secondary verification in the complex frequency domain, thereby simplifying the verification operation process and achieving the purpose of improving the verification efficiency. DETAILED DESCRIPTION

[0018] In the description of the following embodiments, specific details such as specific system structures, technologies, etc. are provided for illustration rather than limitation, so as to provide a thorough understanding of the embodiments of the present application. However, it should be clear to those skilled in the art that the present application may also be implemented in other embodiments without these specific details. In other cases, detailed descriptions of well-known systems, devices, circuits, and methods are omitted to prevent unnecessary details from obstructing the description of the present application.

[0019] Our verification method mainly includes the following three steps:

[0020] A. Establish a spatial coordinate system and establish a distribution network topology structure in the spatial coordinate system according to the distribution network structure;

[0021] B. Mark the action nodes and status nodes involved in the command to be verified in the distribution network topology structure, and determine whether there are isolated nodes in the above action nodes and status nodes. If there are isolated nodes, the command is determined to be illegal and the verification is terminated. If there are no isolated nodes, go to step C;

[0022] C. Input the command to be verified into the corresponding action node in the distribution network topology structure, and then determine whether the command is legal based on the action vector set of the action node and the state vector set of the state node.

[0023] In order to verify the one-key sequential control command of the distribution network, we established a simple distribution network topology. The spatial coordinate system consists of action information dimension and state information dimension. The action information includes the adjustment action of all adjustable mechanisms in the distribution network structure, and the state information includes the collected data of all sensors in the distribution network structure. The distribution network topology includes action nodes and state nodes. Each adjustable mechanism corresponds to an action node, and the action node includes all the adjustment dimensions of its corresponding adjustable mechanism. Each sensor corresponds to a state node, and the state node includes all the data collection dimensions of its corresponding sensor. Physical links are set between nodes with actual circuit direct connection, and logical links are set between nodes with logical association and no actual circuit direct connection. Bidirectional judgment nodes are set on the logical link. The entire topology structure only includes links between nodes. There is no need to set specific parameters of nodes like the simulation model, nor is it necessary to jointly determine whether the system responds normally based on different node state parameters, which greatly reduces the amount of verification calculations and improves the verification efficiency.

[0024] We use a two-level verification method. First, we verify the operation command through the topology structure, because the correct operation command is a set of related operation processes. Therefore, if an isolated node appears (that is, a node that has no physical link or logical link directly connected to other nodes related to the operation command), it means that there must be an error in the operation command, which leads to the appearance of the isolated node. After the topology structure is verified, the second verification of information logic begins.

[0025] Since the parameter information in the system topology is simplified, in order to ensure the accuracy of the secondary verification, we adopt a new node information update process. Node information is divided into action vector and state vector.

[0026] Specifically, after the command to be verified is input into the corresponding action node in the distribution network topology structure, the action node updates the action information. The command input node is used as the reference node, and the topological distance between the action node and the reference node, the current adjustment amount of the action node (the adjustment amount specifically includes data on the size and positive and negative directions) and the previous adjustment amount of the action node are used to form an action vector, and then the action vector is normalized.

[0027] Then, a first round of status update is performed, in which the status nodes that have actual circuit connection relationships with the action nodes that update action information are sequentially updated through physical links. Then, a second round of status update is performed, in which the status nodes that have logical connection relationships with the action nodes that update action information and the status nodes that update status information are sequentially updated through logical links. An action vector set is obtained based on the action node updating action information, and a state vector set is obtained based on the results of the two rounds of status updates. A corresponding state vector is set for each state node. After the first round of state update is completed, the state data updated in the first round is placed in the state vector. After the second round of state update is completed, the state data updated in the second round is placed in the state vector. When the second round of update is performed, the updated action information or state information is sent to the state node to be updated through the logical link. The bidirectional decision node temporarily stores the sent action information or state information. If the bidirectional decision node currently has action information and / or state information stored, the bidirectional decision node performs weighted processing on the currently sent action information or state information according to the currently stored action information and / or state information and the information transmission direction. The magnitude of the weighted amount is positively correlated with the correlation between the currently stored action information and / or state information and the currently sent action information or state information, and negatively correlated with the topological distance between the sending node of the currently sent action information or state information and the bidirectional decision node. The positive or negative of the weighted amount is related to the information sending direction. If the current information sending direction is the same as the sending direction of the information stored in the bidirectional decision node, the weighted amount corresponding to the information stored in the above-mentioned bidirectional decision node is positive weighted, otherwise it is negative weighted, and then the state vector is normalized.

[0028] The action vector and state vector we designed have a strong topological logical correlation, which lays the foundation for the final verification and judgment process.

[0029] Mapping the motion vector set to the complex frequency domain yields F a (ω) is the action complex frequency domain function set, N a is the total number of action vectors, f a (n) is the modulus of the nth action vector, and the state vector set is mapped to the complex frequency domain to obtain F s (ω) is the state complex frequency domain function set, N s is the total number of state vectors, f s (n) is the modulus of the nth state vector; traverse the action complex frequency domain function set and the state complex frequency domain function set, if there are at least two functions in the resonant frequency interval, the command is judged to be illegal, otherwise the name is judged to be legal; the function that produces resonance in the resonant frequency interval has one and only one maximum value or one and only one minimum value, and the periods of the functions that produce resonance are integer multiples of each other.

[0030] Because in the time domain, the relationship between the action vector and the state vector has different expression functions in different dimensions, which makes it impossible to directly compare and judge. We map the action vector and the state vector to the complex frequency domain to realize the linearization of the relationship, and then measure the stability of the system state by whether there are extreme points with high similarity between different complex frequency domain functions (that is, the "resonance" mentioned above), and then determine the legitimacy of the command. In the complex frequency domain, there is a "resonance frequency interval" between functions, which means that the system has high energy in this frequency interval and is in an unstable state. Through the inverse Fourier transform in the frequency domain, it corresponds to a state fluctuation close to the step response, which is not allowed in the distribution network. Therefore, we can perform targeted fitting of the state of the distribution network after the input operation command through simple calculations in the complex frequency domain, and realize the judgment of the legitimacy of the operation command.

[0031] The technicians in the relevant field can clearly understand that for the convenience and simplicity of description, only the division of the above-mentioned functional units and modules is used as an example for illustration. In practical applications, the above-mentioned function allocation can be completed by different functional units and modules as needed, that is, the internal structure of the device can be divided into different functional units or modules to complete all or part of the functions described above. The functional units and modules in the embodiment can be integrated in a processing unit, or each unit can exist physically separately, or two or more units can be integrated in one unit. The above-mentioned integrated unit can be implemented in the form of hardware or in the form of software functional units. In addition, the specific names of the functional units and modules are only for the convenience of distinguishing each other, and are not used to limit the scope of protection of this application. The specific working process of the units and modules in the above-mentioned system can refer to the corresponding process in the aforementioned method embodiment, which will not be repeated here.

[0032] The present invention implements all or part of the processes in the above-mentioned embodiment method, and can also be completed by instructing the relevant hardware through a computer program. The computer program can be stored in a computer-readable storage medium. When the computer program is executed by the processor, the steps of each of the above-mentioned method embodiments can be implemented. Among them, the computer program includes computer program code, and the computer program code can be in source code form, object code form, executable file or some intermediate form. The computer-readable medium may include: any entity or device capable of carrying computer program code, recording medium, USB flash drive, mobile hard disk, magnetic disk, optical disk, computer memory, read-only memory (ROM), random access memory (RAM), electric carrier signal, telecommunication signal and software distribution medium. It should be noted that the content contained in the computer-readable medium can be appropriately increased or decreased according to the requirements of legislation and patent practice in the jurisdiction. For example, in some jurisdictions, according to legislation and patent practice, the computer-readable medium does not include electric carrier signals and telecommunication signals.

[0033] The above shows and describes the basic principles and main features of the present invention and the advantages of the present invention. It should be understood by those skilled in the art that the present invention is not limited to the above embodiments. The above embodiments and descriptions are only for explaining the principles of the present invention. Without departing from the spirit and scope of the present invention, the present invention may have various changes and improvements, which fall within the scope of the present invention to be protected. The scope of protection of the present invention is defined by the attached claims and their equivalents.

Claims

1. A one-key sequence control command verification method for a distribution network, characterized in that The following steps are involved: A. Establish a spatial coordinate system and establish a distribution network topology structure in the spatial coordinate system according to the distribution network structure; B. Mark the action nodes and status nodes involved in the command to be verified in the distribution network topology structure, and determine whether there are isolated nodes in the above action nodes and status nodes. If there are isolated nodes, the command is determined to be illegal and the verification is terminated. If there are no isolated nodes, go to step C; C. Input the command to be verified into the corresponding action node in the distribution network topology structure, and then determine whether the command is legal based on the action vector set of the action node and the state vector set of the state node.

2. The one-key sequential control command verification method for distribution network according to claim 1 is characterized in that: The spatial coordinate system consists of action information dimension and state information dimension. The action information includes the adjustment actions of all adjustable mechanisms in the distribution network structure, and the state information includes the collected data of all sensors in the distribution network structure.

3. The one-key sequential control command verification method for distribution network according to claim 2 is characterized in that: The distribution network topology structure includes action nodes and status nodes. Each adjustable mechanism corresponds to an action node, and the action node includes all adjustment dimensions of the corresponding adjustable mechanism. Each sensor corresponds to a status node, and the status node includes all data collection dimensions of the corresponding sensor. Physical links are set between nodes with actual circuit direct connection, and logical links are set between nodes with logical associations but no actual circuit direct connection.

4. The one-key sequential control command verification method for distribution network according to claim 3 is characterized in that: A bidirectional decision node is set on the logical link.

5. The one-key sequence control command verification method for distribution network according to claim 4 is characterized in that: After the command to be verified is input into the corresponding action node in the distribution network topology structure, the action node updates the action information, and then performs the first round of status update. The first round of status update is to sequentially update the status nodes that have actual circuit connection relationships with the action node that updates the action information through physical links, and then performs the second round of status update. The second round of status update is to sequentially update the status nodes that have logical connection relationships with the action node that updates the action information and the status node that updates the status information through logical links; the action vector set is obtained according to the action node updating the action information, and the state vector set is obtained according to the results of the two rounds of status updates.

6. The one-key sequential control command verification method for distribution network according to claim 5 is characterized in that: The command input node is used as the reference node, and the action vector is composed of the topological distance between the action node and the reference node, the current adjustment amount of the action node, and the previous adjustment amount of the action node. Then the action vector is normalized.

7. The one-key sequential control command verification method for distribution network according to claim 6 is characterized in that: A corresponding state vector is set for each state node. After the first round of state update is completed, the state data updated in the first round is placed in the state vector. After the second round of state update is completed, the state data updated in the second round is placed in the state vector. When the second round of update is performed, the updated action information or state information is sent to the state node to be updated through the logical link. The bidirectional decision node temporarily stores the sent action information or state information. If the bidirectional decision node currently has action information and / or state information stored, the bidirectional decision node performs weighted processing on the currently sent action information or state information according to the currently stored action information and / or state information and the information transmission direction. The magnitude of the weighted amount is positively correlated with the correlation between the currently stored action information and / or state information and the currently sent action information or state information, and negatively correlated with the topological distance between the sending node of the currently sent action information or state information and the bidirectional decision node. The positive or negative of the weighted amount is related to the information sending direction. If the current information sending direction is the same as the sending direction of the information stored in the bidirectional decision node, the weighted amount corresponding to the information stored in the above-mentioned bidirectional decision node is positive weighted, otherwise it is negative weighted, and then the state vector is normalized.

8. The one-key sequence control command verification method for distribution network according to claim 7 is characterized in that: Mapping the motion vector set to the complex frequency domain yields F a (ω) is the action complex frequency domain function set, N a is the total number of action vectors, f a (n) is the modulus of the nth action vector, and the state vector set is mapped to the complex frequency domain to obtain F s (ω) is the state complex frequency domain function set, N s is the total number of state vectors, f s (n) is the modulus of the nth state vector; traverse the action complex frequency domain function set and the state complex frequency domain function set, if there are at least two functions in the resonant frequency interval, the command is judged to be illegal, otherwise the name is judged to be legal; the function that produces resonance in the resonant frequency interval has one and only one maximum value or one and only one minimum value, and the periods of the functions that produce resonance are integer multiples of each other.

Images