CN115062451A - Feeder automation simulation method and system - Google Patents

Feeder automation simulation method and system Download PDF

Info

Publication number
CN115062451A
CN115062451A CN202210512828.XA CN202210512828A CN115062451A CN 115062451 A CN115062451 A CN 115062451A CN 202210512828 A CN202210512828 A CN 202210512828A CN 115062451 A CN115062451 A CN 115062451A
Authority
CN
China
Prior art keywords
boolean
fault
lamps
feeder automation
switch
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.)
Pending
Application number
CN202210512828.XA
Other languages
Chinese (zh)
Inventor
王金亮
罗欣婷
李赛
朱正堂
袁旺
张�浩
刘超男
徐家恒
甘言礼
宋娜
吕妮娜
刘晓艺
范红真
许敏敏
康保林
接怡冰
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
State Grid Corp of China SGCC
State Grid of China Technology College
Shandong Electric Power College
Original Assignee
State Grid Corp of China SGCC
State Grid of China Technology College
Shandong Electric Power College
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by State Grid Corp of China SGCC, State Grid of China Technology College, Shandong Electric Power College filed Critical State Grid Corp of China SGCC
Priority to CN202210512828.XA priority Critical patent/CN115062451A/en
Publication of CN115062451A publication Critical patent/CN115062451A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F30/00—Computer-aided design [CAD]
    • G06F30/20—Design optimisation, verification or simulation
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F2119/00—Details relating to the type or aim of the analysis or the optimisation
    • G06F2119/02—Reliability analysis or reliability optimisation; Failure analysis, e.g. worst case scenario performance, failure mode and effects analysis [FMEA]

Landscapes

  • Engineering & Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Computer Hardware Design (AREA)
  • Evolutionary Computation (AREA)
  • Geometry (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Supply And Distribution Of Alternating Current (AREA)

Abstract

The invention provides a feeder automation simulation method and a system, comprising the following steps: acquiring the selected feeder automation mode and the states of all fault Boolean lamps in the corresponding mode; inputting the states of all the fault Boolean lamps into a composite operation control for addition and summation, judging whether the states of all the fault Boolean lamps meet the requirements or not according to the summation result, and if not, returning prompt information; and if the requirements are met, on the basis of the states of all the fault Boolean lamps, performing on-off state control in a corresponding mode to obtain the states of all the switch Boolean lamps and a feeder automation simulation flow so as to display a feeder automation simulation result. The feeder automation process is truly simulated, interaction with a user is realized, and power distribution automation teaching popularization is facilitated.

Description

Feeder automation simulation method and system
Technical Field
The invention belongs to the technical field of feeder automation, and particularly relates to a feeder automation simulation method and system.
Background
The statements in this section merely provide background information related to the present disclosure and may not constitute prior art.
With the development of distribution automation, power supply and distribution systems are continuously developed and perfected with the progress of various power technologies. There is a need for power supply and distribution systems that continually increase the level of automation services. Feeder automation is used as a foundation and the most important component, understanding of functions and functions of the feeder automation is critical to innovation of functions of the feeder automation, and teaching of power distribution automation teaching knowledge is a developing cornerstone.
At present, the power distribution automation course of schools is mainly based on theoretical teaching and PPT watching. When feeder automation teaching in distribution automation is carried out, the form of the question of the fault handling process is described by adopting the explanation principle and when permanent faults occur in three types of feeder automation lines, so that a user can understand the difference of the three types of feeder automation and the fault handling process. This traditional approach is difficult to understand, tedious and unintelligible, and lacks interest.
Disclosure of Invention
In order to solve the technical problems in the background art, the invention provides a feeder automation simulation method and system, which not only truly simulate a feeder automation process, but also realize interaction with a user and are beneficial to power distribution automation teaching popularization.
In order to achieve the purpose, the invention adopts the following technical scheme:
a first aspect of the invention provides a feeder automation simulation method, comprising:
acquiring the selected feeder automation mode and the states of all fault Boolean lamps in the corresponding mode;
inputting the states of all the fault Boolean lamps into a composite operation control for addition and summation, judging whether the states of all the fault Boolean lamps meet the requirements or not according to the summation result, and if not, returning prompt information;
and if the requirements are met, on the basis of the states of all the failed Boolean lamps, performing on-off state control in a corresponding mode to obtain the states of all the switched Boolean lamps and a feeder automation simulation process so as to display a feeder automation simulation result.
Further, the acquiring steps of the states of all the failed boolean lamps are as follows:
responding to the selected feeder automation mode, and returning to a graphical interactive interface which corresponds to the mode and has a connection relation between the switching Boolean lamp and the fault Boolean lamp;
and responding to the click command of each fault Boolean lamp in the graphical interactive interface to obtain the states of all fault Boolean lamps.
Further, if the selected feeder automation mode is a voltage time type, the switching-on time limits of all switching-on and switching-off boolean lamps need to be acquired, time limit judgment is performed, whether all the switching-on time limits meet the requirements is judged, and the switching-on and switching-off state control can be performed only if all the switching-on time limits meet the requirements.
Further, the specific method for judging whether all the closing time limits meet the requirements includes:
inputting the closing time limits of all the switching Boolean lamps representing the non-interconnected switches into the composite operation control to carry out numerical value addition operation;
and inputting the sum result and the closing time limit of the Boolean lamp representing the interconnection switch into a control, and comparing the numerical values to obtain the result of whether all the closing time limits meet the requirements.
Further, the obtaining step of the feeder automation simulation process is as follows:
and storing the states of the Boolean lamps, the closing time of the Boolean lamps and the closing time limit of the Boolean lamps in the switch state control in a While circulating manner, and combining the numerical constant, the character string constant, the numerical conversion character string control, the enter key constant control and the connection character string control to obtain the automatic feeder simulation process.
Further, still include: and acquiring a path where the sound file is positioned, and based on the states of all the switching Boolean lamps in the switching state control, combining with Whlie circulation, sound file playing, sound output information, binding removal according to names, a non-comparison control, a composite operation control and a sound output zero clearing control to obtain a sound output result.
A second aspect of the invention provides a feeder automation simulation system, comprising:
a Boolean lamp status acquisition module configured to: acquiring the selected feeder automation mode and the states of all fault Boolean lamps in the corresponding mode;
a fault setting determination module configured to: inputting the states of all the fault Boolean lamps into a composite operation control for addition and summation, judging whether the states of all the fault Boolean lamps meet the requirements or not according to the summation result, and if not, returning prompt information;
a simulation module configured to: and if the requirements are met, on the basis of the states of all the fault Boolean lamps, performing on-off state control in a corresponding mode to obtain the states of all the switch Boolean lamps and a feeder automation simulation flow so as to display a feeder automation simulation result.
Further, a sound output module is included that is configured to: and acquiring a path where the sound file is positioned, and based on the states of all the switching Boolean lamps in the switching state control, combining with Whlie circulation, sound file playing, sound output information, binding removal according to names, a non-comparison control, a composite operation control and a sound output zero clearing control to obtain a sound output result.
A third aspect of the invention provides a computer readable storage medium having stored thereon a computer program which, when executed by a processor, performs the steps in a method of feeder automation simulation as described above.
A fourth aspect of the invention provides 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 steps in a method of feeder automation simulation as described above when executing the program.
Compared with the prior art, the invention has the beneficial effects that:
the invention provides a feeder automation simulation method, which truly simulates a feeder automation process, realizes interaction with a user and is beneficial to power distribution automation teaching popularization.
The invention provides a feeder automation simulation method which simply and clearly shows the processes of fault location, fault isolation and power restoration in a circuit accident state; the software is easy to operate, the user can quickly get on the hand, and the real operation capability of the user is enhanced. The process is presented in a concise and clear manner, so that teachers can conveniently teach and users can conveniently learn about the feeder automation system.
The invention provides a feeder automation simulation method, which is vivid and correct in process, comprises qualitative and quantitative result display and enhances the comprehension of students on feeder automation.
The invention provides a feeder automation simulation method, which truly simulates a feeder automation process, enriches the teaching forms of distribution automation courses, enables the teaching contents to be vivid and vivid, can stimulate the interest of users in feeder automation learning, carries out distribution automation teaching popularization, innovatively cultures talents for a distribution automation system, and is beneficial to promoting the development of distribution automation.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this specification, are included to provide a further understanding of the invention, and are incorporated in and constitute a part of this specification, illustrate exemplary embodiments of the invention and together with the description serve to explain the invention and not to limit the invention.
FIG. 1 is a schematic diagram of a main interface according to a first embodiment of the present invention;
FIG. 2 is a schematic view of a voltage-time interface according to a first embodiment of the present invention;
FIG. 3 is a schematic diagram of a voltage-time interface when two faulty Boolean lamps are on according to a first embodiment of the present invention;
FIG. 4 is a schematic diagram of a time limit determination process and a result according to a first embodiment of the present invention;
fig. 5 is a schematic diagram of a failure setting determination process and a result according to a first embodiment of the present invention;
FIG. 6 is a flow chart of the switch state control according to the first embodiment of the present invention;
FIG. 7 is a flowchart illustrating a process flow of the first embodiment of the present invention;
FIG. 8 is a flow chart of data purging according to a first embodiment of the present invention;
FIG. 9 is a flow chart of sound output according to a first embodiment of the present invention;
FIG. 10 is a schematic view of a current concentrating interface according to a first embodiment of the present invention;
fig. 11 is a flowchart of a current-concentrating feeder automation process according to an embodiment of the present invention;
FIG. 12 is a diagram illustrating an intelligent distributed interface according to a first embodiment of the present invention;
fig. 13 is a flowchart of an intelligent distributed feeder automation process according to an embodiment of the present invention.
Detailed Description
The invention is further described with reference to the following figures and examples.
It is to be understood that the following detailed description is exemplary and is intended to provide further explanation of the invention as claimed. Unless defined otherwise, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this invention belongs.
It is noted that the terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of exemplary embodiments according to the invention. As used herein, the singular forms "a", "an" and "the" are intended to include the plural forms as well, and it should be understood that when the terms "comprises" and/or "comprising" are used in this specification, they specify the presence of stated features, steps, operations, devices, components, and/or combinations thereof, unless the context clearly indicates otherwise.
Example one
The embodiment provides a feeder automation simulation method, which comprises the following steps:
step 1, responding to a main interface selection instruction of a user, responding to a mode click instruction of the user after entering a main interface, and acquiring and displaying a stored running state schematic diagram of a corresponding mode. Fig. 1 shows a main interface corresponding to a main module of the feeder automation simulation training system of the present invention, where the right side of the main interface is composed of three determination buttons, which are "voltage time type", "current concentration type", and "intelligent distribution type", respectively, and a user clicks the corresponding determination button to obtain a mode selection instruction, where the mode includes a schematic operating state diagram corresponding to each mode stored in the system, as shown in the left side of fig. 1.
Step 2, responding to the selected feeder automation mode (voltage time type, current centralized type or intelligent distributed type), and returning to a graphical interactive interface (intelligent distributed type interface, voltage time type interface or current centralized type interface) which corresponds to the selected feeder automation mode and has the connection relation between the switching Boolean lamp and the fault Boolean lamp; and acquiring a click instruction of each fault Boolean lamp in the graphical interactive interface from a user and returning to the interactive interface for displaying to obtain the states (fault information) of all fault Boolean lamps.
Step 3, inputting the states of all the fault Boolean lamps into a composite operation control for addition and summation, judging whether the states of all the fault Boolean lamps meet the requirements or not according to the summation result, and if not, returning prompt information; and if the requirements are met, on the basis of the states of all the fault Boolean lamps, performing on-off state control in a corresponding mode to obtain the states of all the switch Boolean lamps and a feeder automation simulation flow so as to display a feeder automation simulation result.
(1) If the selected feeder automation mode is voltage time type, namely after entering a voltage time type interface, acquiring voltage time type simulation parameters input by a user or set voltage time type fault information, responding to a starting instruction, calling a voltage time type feeder automation program, and acquiring a voltage time type simulation result (the state of each switching Boolean lamp) and a simulation flow.
The voltage time type simulation parameters comprise the closing time limit of a first switch Boolean lamp (reclosing switch), a second switch Boolean lamp (switch station or load switch), a third switch Boolean lamp (switch station or load switch), a fourth switch Boolean lamp (switch station or load switch), a fifth switch Boolean lamp (switch station or load switch) and a sixth switch Boolean lamp (interconnection switch) which are connected in sequence.
As shown in fig. 2, the interface is a voltage time type interface, and the interface is composed of a switching boolean light, a character string display control, a numerical value input control and a determination button. The numerical value input control is the X/XL time limit (the closing time of a tie switch is the XL time limit, the closing time of other switches is the X time limit, and the XL time limit is longer than the X time limit because the XL time limit of the tie switch must be longer than the fault isolation time at two sides) of a voltage time type feeder automation system, namely, a user inputs voltage time type simulation parameters through the numerical value input control; the character string display control displays voltage time type operation steps, namely a simulation flow, so that the principle of voltage time type can be conveniently learned and understood. The determination button is a clearing button of the process, and the purpose is to ensure that the process is blank when switching faults so as to avoid confusion of learning. The system simplifies the components of the field feeder automation system in a popular and easily understood mode, and has attractive interface and easy operation. The green switch Boolean lamp is in a switching-on state, and the white switch Boolean lamp and the red switch Boolean lamp are in a switching-off state. The rectangular switch boolean lamp represents a reclosing switch, the circular switch boolean lamp represents a switch, and XL represents an interconnection switch.
The voltage time type feeder automation program comprises time limit judgment, fault setting judgment, switch state control, process output, data clearing and sound output.
Judging time limit: as shown in the left diagram of fig. 4, the set closing time limits of all the switch boolean lamps (the first switch boolean lamp, the second switch boolean lamp, the third switch boolean lamp, the fourth switch boolean lamp and the fifth switch boolean lamp) representing the non-interconnection switch are input into the composite operation control of the numerical value in the programming, the numerical value addition operation is carried out to obtain the result after the addition, the result and the set closing time limit of the switch boolean lamp (the sixth switch boolean lamp) representing the interconnection switch are input into the smaller control in the programming, the numerical value comparison operation is carried out to judge whether the voltage time type simulation parameter input by the user meets the requirement or not, if so, the step (c) is executed, otherwise, the prompt information is returned.
The time limit determination is unique to the voltage time type, and aims to meet the condition that the time limit of the tie switch XL is greater than the fault isolation time on both sides, and the operation can be performed only when the time limit of the tie switch XL is greater than the added value of the time limits of all the X, otherwise, a prompt message is popped up, for example, a dialog box that the time limit of the tie switch XL must be greater than the fault isolation time on both sides, and the correct X time limit and XL time limit are input is popped up, as shown in the right diagram of FIG. 4.
Fault setting and judging: as shown in fig. 3, five switching boolean lamps, i.e., a first switching boolean lamp, a second switching boolean lamp, a third switching boolean lamp, a fourth switching boolean lamp and a fifth switching boolean lamp, are provided with a fault boolean lamp between two switching boolean lamps, and the fault boolean lamps are represented by "lines" or "line crosses", where the "line cross" indicates that the fault boolean lamp is on and the "lines" indicate that the fault boolean lamp is not on, as shown in fig. 3, there are five fault boolean lamps, and two fault boolean lamps are on. And the user controls the on and off of the fault Boolean lamp by clicking the fault Boolean lamp, so as to set the fault.
As shown in the left diagram of fig. 5, the on-off states of five faulty boolean lamps are input into a condition structure, on-off judgment is performed, operation is performed, the on-off states are assigned in the form of on 1 and off 0, after the result that the on-off result of each faulty boolean lamp is 1 or 0 is obtained, the result is input into a composite operation control of numerical values in programming for addition and summation, the summation is combined with a control which is compared in programming to perform the judgment of 0 or 1, the result is obtained, whether the voltage time type fault information set by a user meets the requirement is judged, if so, the step (3) is executed, and if not, prompt information is returned.
As shown in the left diagram of fig. 5, the leftmost is the local variation of the failed boolean lamp. The fault Boolean lamp is used for fault setting, and is in a fault state when being on, and is in a normal operation state when not being on. The failure setting judgment is to prevent two or more failure settings, and is made up of a condition structure, a complex operation, and or boolean. If two or more faults are set, the composite operation addition is not equal to 1, nor is it equal to 0, and a prompt message is popped up, for example, a dialog box "the program does not support setting two or more faults" is popped up, as shown in the right diagram of fig. 5.
And (3) fault setting: the system sets the fault condition through the on-off state of the fault Boolean lamp. In the program block diagram, While cycle, condition structure, sequence structure and the like are used for showing the fault location of feeder automation and the isolation of fault sections during fault.
Controlling the switch state: as shown in fig. 6, based on the time limit and the set voltage time type fault information of the first switch boolean lamp, the second switch boolean lamp, the third switch boolean lamp, the fourth switch boolean lamp, the fifth switch boolean lamp and the sixth switch boolean lamp, the on-off control operation of the switch boolean lamps is performed in combination with the distribution automation voltage time type switch control method, and the process exhibition of the operation of each switch of the distribution automation voltage time type when encountering a permanent fault is obtained.
And the switch is controlled in a selector, and the Boolean lamp of the switch is controlled to be on or off by continuously assigning value True/False, which represents the on-off state of the switch in the feeder automation system.
Fourthly, outputting the flow: as shown in fig. 7, based on each branch of the condition structure, the states of the respective switch boolean lamps (step storage), branch jump, closing time of the respective switch boolean lamps (1s +1s + … storage) and closing time limit (X time limit) of the respective switch boolean lamps in the switch state control are stored in a While loop and added (second number storage), and the numeric constant, the character string constant, the numeric conversion character string control, the enter key constant and the connection character string control are combined to connect characters in series into a segment, so as to obtain a feeder automation simulation flow, and then the flow automation simulation flow is output to the flow character string control display.
Wherein a branch is a branch of a conditional structure. Taking the branch 123456 shown in fig. 11 as an example, the conditional structure branch in the Labview system is by default true or false. To achieve the purpose of branch jump, the implementation method comprises the following steps: performing enumeration, wherein the enumeration comprises addition items, 6 items are added in total, and each item is named by 1, 2, 3, 4, 5 and 6 respectively; connecting the prepared enumeration to a branch selector of a condition structure, changing a default branch of the condition structure into 1, adding branches until the total number of the conditional structure branches is six, and ensuring that the names of the six branches are 123456 in sequence; sleeving a While loop outside a condition structure, deleting the condition structure to be connected with a branch selector, adding a shift register (the left and the right are a pair), connecting enumeration to the shift register (the left) and then connecting the shift register to the branch selector of the condition structure, wherein an enumerated item is ensured to be 1 at the moment, so that the program is ensured to enter the branch structure which is 1 at first when starting; in order to achieve the effect of branch jump, copying the same enumeration, and connecting the enumerated item 2 to the shift register (right); in the branch structure named 2, the enumerated entry connected to the shift register (right) is 3, and so on, to arrive at the result of each branch jump.
And converting the character strings and the numerical values which are circularly stored by the While into character strings by the process output, and connecting the character strings by a connecting character string. The While cycle is a storage function and has four functions: the first is that each branch needs to go through the While loop control condition structure; secondly, after the line fault is recorded, the total time of the process from the beginning of the fault to the end of the fault is recorded; thirdly, storing the reaction time of each switch; the fourth is to store the whole flow, for example:
for a total of 13 s;
when an accident occurs, CB trips, a line loses voltage, and a contact switch XL starts timing;
1s (1s) CB closing;
2s (1s +1s) switch A is closed;
3s (1s +1s +1s) switch B is closed;
when power is supplied to a fault section, the transformer substation is caused to jump again, the line is subjected to voltage loss, and the switch B and the switch C are locked;
4s (1s +1s +1s +1s) is a switch CB;
5s (1s +1s +1s +1s +1s) is the switch A is switched on;
6s (1s +1s +1s +1s) is the closing of the gang switch;
7s (1s +1s +1s +1s +1s +1s +1s +1s) is the switch D is closed.
Data clearing: as shown in fig. 8, based on the selection control in the comparison, the operation of clicking the boolean control of the determination button is performed, and the empty string constant is output to the process display control to obtain a result of the blank process display control, whereas if the operation is not performed, the result of the original process display control is obtained.
The data clearing is composed of a flow display control and a determination button. And if the confirming button is clicked, clearing the data, and if the confirming button is not clicked, keeping the data in the flow.
Output of sound: as shown in fig. 9, the program block diagram of the sound sub VI is opened, and copy-paste operation is performed in combination with the path where the sound WAV file is located, so as to obtain the result of pasting the path into the path constant of the file constant, and then the result of sound output is obtained in combination with the white loop, the playing of the sound file, the sound output information, the unbundling by name, the non-comparison control, the compound operation control, and the sound output clear control, based on the states of the respective boolean lamps in the switch state control.
The sound output is a sub Virtual Instrument (VI) which is composed of two parts, one is a path and the other is a program written and output; for the variable sound path, the left diagram in fig. 9 is a schematic diagram of the sound path of a computer, after the computer login procedure is changed, the sound sub VI is opened first, the path where the sound is located is written in the path character string, then the main program is opened, and the operation is started. The output sound is the sound of isolating switch closing, the sound is emitted before the switch is closed or separated, so that the circuit opening and closing can be better simulated, the output sound is reflected in VI, the sound is placed in a file, the sound is different in the path of each computer, so that the sound VI is removed when the program is run, the path text is input into the path (path), and then the program is run.
The voltage time type feeder automation is characterized in that incoming calls are switched on and released in a non-voltage mode, the judgment fault is judged by X time limit, and the setting principle of the voltage time type feeder automation needs to meet the condition that the time limit of an interconnection switch XL is greater than the time of fault isolation on two sides. Therefore, correct time limit needs to be set firstly, and the program can be operated by ensuring that the time limit of the interconnection switch XL is larger than the fault isolation time of two sides.
(2) If the selected feeder automation mode is current concentration type, namely after entering a current concentration type interface, acquiring current concentration type fault information set by a user, responding to a starting instruction, calling a current concentration type feeder automation program, and obtaining a current concentration type simulation result (the state of each switching Boolean lamp) and a simulation flow.
The current concentration type fault information is a line fault between one or more switch boolean lamps and an adjacent switch boolean lamp or a node, that is, a line fault between a seventh switch boolean lamp and an eighth switch boolean lamp, a line fault between the eighth switch boolean lamp and a first node, a line fault between a ninth switch boolean lamp and a first node, a line fault between a second node and a ninth switch boolean lamp, a line fault between a tenth switch boolean lamp and a second node, a line fault between a tenth switch boolean lamp and an eleventh switch boolean lamp, a line fault between an eleventh switch boolean lamp and a twelfth switch boolean lamp, a line fault between a first node and a thirteenth switch boolean lamp, a line fault between a thirteenth switch boolean lamp and a fourteenth switch boolean lamp, a line fault between a second node and a fifteenth switch boolean, a line fault between a seventh node and a fifteenth switch boolean, And one or more of line faults between the fifteenth switched boolean lamp and the sixteenth switched boolean lamp, the faults being indicated by the on and off of the faulty boolean lamp.
Wherein, a seventh switch Boolean lamp (a transformer substation outgoing line breaker), an eighth switch Boolean lamp (a switch station), a ninth switch Boolean lamp (a switch station), the tenth switch boolean lamp (switchyard), the eleventh switch boolean lamp (switchyard) and the twelfth switch boolean lamp (substation breaker) are connected in sequence, a first node exists between the eighth switch boolean lamp and the ninth switch boolean lamp, a second node exists between the ninth switch boolean lamp and the tenth switch boolean lamp, the first node is connected with the thirteenth switch boolean lamp (switchyard), the thirteenth switch boolean lamp is further connected with the fourteenth switch boolean lamp (substation breaker), a second node exists between the ninth switch boolean lamp and the tenth switch boolean lamp, the second node is connected with the fifteenth switch boolean lamp (switchyard), and the fifteenth switch boolean lamp is further connected with the sixteenth switch boolean lamp (substation breaker).
As shown in fig. 10, the interface is a current concentration type interface, and the interface is composed of a switching boolean lamp, a fault boolean lamp, a character string display control and a determination button.
As shown in fig. 11, the current concentration type feeder automation program includes a fault setting judgment, a switch state control, a flow output, a data clearing, and a sound output.
The functions and methods of fault setting judgment, process output, data clearing and sound output are the same as the voltage time type feeder automation principle, and the difference lies in switch state control.
Controlling the switch state: as shown in FIG. 11, the module outputs the character string storing the flow to the flow display control through Whlie loop storage. In the re-flow, after the circuit encounters a permanent fault, the switches are not closed one by one like voltage time type feeder automation, the switches are closed one by one to determine a fault point, and then the other switches are closed to complete load transfer and power restoration. The current concentration type feeder line is automatic, after a permanent fault is met, after the fault side transformer outgoing line breaker is disconnected, fault current flows through two sides of a fault area and only one end point, the fault area is determined according to the judgment condition that the fault area is judged to be the fault area, a switch near the fault area is disconnected, the transformer substation outgoing line breaker and a tie switch are switched on, and fault positioning, isolation and power supply to a non-fault section are completed.
The current concentration type feeder automation principle is that an automation device or system is utilized to monitor the operation condition of a power distribution network, find faults of the power distribution network in time and carry out fault location, isolation and recovery on power supply of non-fault intervals. The fault processing method mainly judges the accident interval according to the fault alarm signal of the switch, depends on the reliability of communication and the analysis and calculation of the main station, and has quick processing time. Therefore, the judgment is carried out by FA, and is shown in the form of a flow character string display control and the on-off state of a switch Boolean lamp.
(3) If the selected feeder automation mode is intelligent distributed, the intelligent distributed fault information set by the user is acquired after the selected feeder automation mode enters an intelligent distributed interface, and an intelligent distributed simulation result (the state of each switching Boolean lamp) and a simulation process are obtained by calling an intelligent distributed feeder automation program in response to a starting instruction.
The intelligent distributed fault information is a line fault between one or more switch boolean lamps and an adjacent switch boolean lamp or node, i.e. a line fault between a seventeenth switch boolean lamp and an eighteenth switch boolean lamp, a line fault between an eighteenth switch boolean lamp and a nineteenth switch boolean lamp, a line fault between a nineteenth switch boolean lamp and a twentieth switch boolean lamp, a line fault between a twentieth switch boolean lamp and a third node, a line fault between a third node and a twenty-first switch boolean lamp, a line fault between a twenty-first switch boolean lamp and a twenty-second switch boolean lamp, a line fault between a twenty-second switch boolean lamp and a twenty-third switch boolean lamp, a line fault between a twenty-third switch boolean lamp and a twenty-fourth switch boolean lamp, a line fault between a twenty-fourth switch boolean lamp and a twenty-fifth switch boolean lamp, a line fault between a seventeenth switch boolean lamp and a twenty-fifth switch boolean lamp, One or more of a line fault between the third node and the twenty-sixth switching boolean lamp and a line fault between the seventeenth switching boolean lamp and the eighteenth switching boolean lamp, the faults being indicated by the on and off of the faulty boolean lamp.
The seventeenth switch boolean lamp (substation outgoing line breaker), the eighteenth switch boolean lamp (load switch), the nineteenth switch boolean lamp (load switch), the twentieth switch boolean lamp (load switch), the twenty-first switch boolean lamp (load switch), the twenty-second switch boolean lamp (tie switch), the twenty-third switch boolean lamp (load switch), the twenty-fourth switch boolean lamp (load switch) and the twenty-fifth switch boolean lamp (substation outgoing line breaker) are connected in sequence, a third node exists between the twenty-third switch boolean lamp and the twenty-first switch boolean lamp, and the third node is connected with the eighteenth switch boolean lamp (load switch).
As shown in fig. 12, the intelligent distributed interface is composed of a switching boolean light, a failure boolean light, a character string display control and a determination button.
As shown in fig. 13, the intelligent distributed feeder automation program includes a fault setting judgment, a switch state control, a process output, a data purge, and a sound output.
The fault setting judgment, process output, data clearing and sound output functions and methods are the same as the voltage time type feeder automation and the current concentration type feeder automation principle, and the difference lies in the switch state control.
And (3) controlling the switch state: as shown in FIG. 13, the module outputs the character string of the stored flow to the flow display control through Whlie loop storage. The intelligent distributed feeder automation system has the advantages that after a permanent fault is met, after a fault side transformer outgoing line breaker is disconnected, the fault area is determined by a judging method of 'if only one of adjacent switches in a power distribution area detects fault current and is closed, the fault occurs in the power distribution area', namely 'N', and then the switches near the fault area are disconnected, the transformer substation outgoing line breaker and a tie switch are closed, so that the fault location, isolation and recovery of power supply to a non-fault area are completed.
The basis of the intelligent distributed fault area judgment is that if only one of adjacent switches in one power distribution area detects fault current and is in a closed position, the fault occurs in the power distribution area. The system is characterized by not depending on a power distribution automation master station system but depending on communication. The mutual matching mode of the automatic switches can realize the feeder automation function through the application of the recloser and the closing switch, and the feeder automation function is realized through data communication processing among the intelligent electronic equipment. Therefore, the display is shown in the form of a flow character string display control and the on-off state of a switch Boolean lamp.
The feeder automation simulation method can be realized by LabVIEW.
Example two
The embodiment provides a feeder automation simulation system, which specifically comprises the following modules:
a Boolean lamp status acquisition module configured to: acquiring the selected feeder automation mode and the states of all fault Boolean lamps in the corresponding mode;
a fault setting determination module configured to: inputting the states of all the fault Boolean lamps into a composite operation control for addition and summation, judging whether the states of all the fault Boolean lamps meet the requirements or not according to the summation result, and if not, returning prompt information;
a simulation module configured to: and if the requirements are met, on the basis of the states of all the fault Boolean lamps, performing on-off state control in a corresponding mode to obtain the states of all the switch Boolean lamps and a feeder automation simulation flow so as to display a feeder automation simulation result.
A sound output module configured to: and acquiring a path where the sound file is positioned, and based on the states of all the switching Boolean lamps in the switching state control, combining with Whlie circulation, sound file playing, sound output information, binding removal according to names, a non-comparison control, a composite operation control and a sound output zero clearing control to obtain a sound output result.
It should be noted that, each module in the present embodiment corresponds to each step in the first embodiment one to one, and the specific implementation process is the same, which is not described herein again.
EXAMPLE III
The present embodiment provides a computer-readable storage medium, on which a computer program is stored, which when executed by a processor implements the steps in a method for feeder automation simulation as described in the first embodiment above.
Example four
The present embodiment provides a computer device, which includes a memory, a processor, and a computer program stored in the memory and executable on the processor, and when the processor executes the computer program, the processor implements the steps in the feeder automation simulation method according to the first embodiment.
As will be appreciated by one skilled in the art, embodiments of the present invention may be provided as a method, system, or computer program product. Accordingly, the present invention may take the form of a hardware embodiment, a software embodiment, or an embodiment combining software and hardware aspects. Furthermore, the present invention may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, optical storage, and the like) having computer-usable program code embodied therein.
The present invention is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
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 a computer program, which can be stored in a computer-readable storage medium, and when executed, can include the processes of the embodiments of the methods described above. The storage medium may be a magnetic disk, an optical disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), or the like.
The above description is only a preferred embodiment of the present invention and is not intended to limit the present invention, and various modifications and changes may be made by those skilled in the art. Any modification, equivalent replacement, or improvement made within the spirit and principle of the present invention should be included in the protection scope of the present invention.

Claims (10)

1. A method for feeder automation simulation, comprising:
acquiring the selected feeder automation mode and the states of all fault Boolean lamps in the corresponding mode;
inputting the states of all the fault Boolean lamps into a composite operation control for addition and summation, judging whether the states of all the fault Boolean lamps meet the requirements or not according to the summation result, and if not, returning prompt information;
and if the requirements are met, on the basis of the states of all the failed Boolean lamps, performing on-off state control in a corresponding mode to obtain the states of all the switched Boolean lamps and a feeder automation simulation process so as to display a feeder automation simulation result.
2. The feeder automation simulation method of claim 1, wherein the obtaining of the status of all faulty boolean lamps comprises:
responding to the selected feeder automation mode, and returning to a graphical interactive interface which corresponds to the mode and has a connection relation between the switching Boolean lamp and the fault Boolean lamp;
and responding to a click command of each fault Boolean lamp in the graphical interactive interface to obtain the states of all fault Boolean lamps.
3. The method of claim 1, wherein if the selected feeder automation mode is a voltage-time type, the closing time limits of all switching boolean lamps are further acquired, a time limit determination is performed, whether all the closing time limits meet the requirements is determined, and the switching state control can be performed only if all the closing time limits meet the requirements.
4. The feeder automation simulation method of claim 3, wherein the specific method for judging whether all closing time limits meet the requirements is as follows:
inputting the closing time limits of all the switching Boolean lamps representing the non-interconnected switches into the composite operation control to carry out numerical value addition operation;
and inputting the sum result and the closing time limit of the Boolean lamp representing the interconnection switch into a control, and comparing the numerical values to obtain the result of whether all the closing time limits meet the requirements.
5. The feeder automation simulation method of claim 1, wherein the obtaining step of the feeder automation simulation process is:
and storing the states of the Boolean lamps, the closing time of the Boolean lamps and the closing time limit of the Boolean lamps in the switch state control in a While circulating manner, and combining the numerical constant, the character string constant, the numerical conversion character string control, the enter key constant control and the connection character string control to obtain the automatic feeder simulation process.
6. The feeder automation simulation method of claim 1, further comprising: and acquiring a path where the sound file is positioned, and based on the states of all the switching Boolean lamps in the switching state control, combining with Whlie circulation, sound file playing, sound output information, binding removal according to names, a non-comparison control, a composite operation control and a sound output zero clearing control to obtain a sound output result.
7. A feeder automation simulation system, comprising:
a Boolean lamp status acquisition module configured to: acquiring the selected feeder automation mode and the states of all fault Boolean lamps in the corresponding mode;
a fault setting determination module configured to: inputting the states of all the fault Boolean lamps into a composite operation control for addition and summation, judging whether the states of all the fault Boolean lamps meet the requirements or not according to the summation result, and if not, returning prompt information;
a simulation module configured to: and if the requirements are met, on the basis of the states of all the fault Boolean lamps, performing on-off state control in a corresponding mode to obtain the states of all the switch Boolean lamps and a feeder automation simulation flow so as to display a feeder automation simulation result.
8. The feeder automation simulation system of claim 7, further comprising a sound output module configured to: and acquiring a path of the sound file, and combining Whlie circulation, sound file playing, sound output information, unbundling according to name, non-comparison control, composite operation control and sound output zero clearing control to obtain a sound output result based on the state of each switch Boolean lamp in the switch state control.
9. A computer-readable storage medium, on which a computer program is stored, which program, when being executed by a processor, carries out the steps of a method for feeder automation simulation as claimed in any one of the claims 1 to 6.
10. A computer device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, wherein the processor when executing the program implements the steps in a feeder automation simulation method according to any one of claims 1-6.
CN202210512828.XA 2022-05-12 2022-05-12 Feeder automation simulation method and system Pending CN115062451A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202210512828.XA CN115062451A (en) 2022-05-12 2022-05-12 Feeder automation simulation method and system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202210512828.XA CN115062451A (en) 2022-05-12 2022-05-12 Feeder automation simulation method and system

Publications (1)

Publication Number Publication Date
CN115062451A true CN115062451A (en) 2022-09-16

Family

ID=83198952

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202210512828.XA Pending CN115062451A (en) 2022-05-12 2022-05-12 Feeder automation simulation method and system

Country Status (1)

Country Link
CN (1) CN115062451A (en)

Similar Documents

Publication Publication Date Title
Wu et al. A Petri net algorithm for scheduling of generic restoration actions
WO2010080490A1 (en) Feeder automation for an electric power distribution system
CN110211445B (en) Power distribution network load transfer control application training system
CN104700686A (en) Real-object simulated maintenance training system for domestic electronic products
CN104142451A (en) Method and system for achieving checking simulation of secondary circuit simulated failure in electric system
CN109859588B (en) Man-machine confrontation scheduling training simulation system and method for extra-high voltage power grid
CN115062451A (en) Feeder automation simulation method and system
CN110189575A (en) A kind of distribution O&M simulation training system based on big data
Sachdev et al. A computer-aided technique for generating substation interlocking schemes
Bertoletti et al. Hardware-in-the-loop simulation for testing low voltage circuit breakers selectivity
KR20220022643A (en) System and method for simulating virtual fault of distribution network
Irisarri et al. Heuristic Scenario Builder for power system operator training
Trofimov et al. Interactive Educational Complex on the Basics of" Digital Substation" Technology
CN207133635U (en) Sewage disposal experimental system based on DDC and configuration software
KR100528832B1 (en) Method for circuit simulation using real image circuit diagram
JP3083502B2 (en) Planning method for power system switchgear operation
Rafian et al. Evaluating a restoration tool using consolidated Edison's training simulator
Mouratis et al. Remote access laboratory setup for physical computing courses
CN115526746A (en) Self-adaptive power transformation operation and maintenance knowledge learning and skill drilling method and system
Middlebrook et al. A case study on blackout restoration as an educational tool
CN113327471A (en) Relay protection tripping circuit troubleshooting training device and method
Sun et al. A novel smart substation secondary circuit simulation training system
JP2002244722A (en) Plant control system
KR20230052063A (en) Operator Training Method and Simulator Performing the Same for HVDC
CN115331506A (en) Simulation training method and device for power grid equipment of hydraulic power plant, medium and electronic equipment

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