CN110323722B - Cross iteration method for relay protection information identification - Google Patents

Cross iteration method for relay protection information identification Download PDF

Info

Publication number
CN110323722B
CN110323722B CN201910505575.1A CN201910505575A CN110323722B CN 110323722 B CN110323722 B CN 110323722B CN 201910505575 A CN201910505575 A CN 201910505575A CN 110323722 B CN110323722 B CN 110323722B
Authority
CN
China
Prior art keywords
codes
cross
stage
relay protection
feature
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
Application number
CN201910505575.1A
Other languages
Chinese (zh)
Other versions
CN110323722A (en
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 Hebei Electric Power Co Ltd
NR Electric Co Ltd
NR Engineering Co Ltd
Original Assignee
State Grid Hebei Electric Power Co Ltd
NR Electric Co Ltd
NR Engineering Co Ltd
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 Hebei Electric Power Co Ltd, NR Electric Co Ltd, NR Engineering Co Ltd filed Critical State Grid Hebei Electric Power Co Ltd
Priority to CN201910505575.1A priority Critical patent/CN110323722B/en
Publication of CN110323722A publication Critical patent/CN110323722A/en
Application granted granted Critical
Publication of CN110323722B publication Critical patent/CN110323722B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • HELECTRICITY
    • H02GENERATION; CONVERSION OR DISTRIBUTION OF ELECTRIC POWER
    • H02HEMERGENCY PROTECTIVE CIRCUIT ARRANGEMENTS
    • H02H7/00Emergency protective circuit arrangements specially adapted for specific types of electric machines or apparatus or for sectionalised protection of cable or line systems, and effecting automatic switching in the event of an undesired change from normal working conditions
    • H02H7/26Sectionalised protection of cable or line systems, e.g. for disconnecting a section on which a short-circuit, earth fault, or arc discharge has occured
    • H02H7/261Sectionalised protection of cable or line systems, e.g. for disconnecting a section on which a short-circuit, earth fault, or arc discharge has occured involving signal transmission between at least two stations

Abstract

The invention discloses a cross iteration method for identifying relay protection information, which is characterized in that the cross iteration of characteristic codes of information samples sent by a relay protection device is divided into two stages, and the characteristic codes for cross iteration in the second stage are formed by deleting on the basis of the characteristic codes of the cross iteration in the first stage; when the completely matched feature codes appear in the feature code cross iteration process of the first stage, according to the strong association relation between the completely matched feature codes and other feature codes, the data bits of binary numbers of other feature codes are shortened to form new feature codes, and the second stage adopts the new feature codes formed in the first stage to carry out cross iteration. The cross iteration method can improve the convergence speed of cross iteration during relay protection information identification.

Description

Cross iteration method for relay protection information identification
Technical Field
The invention belongs to the field of relay protection of a power system, relates to a physical meaning identification method of relay protection uploading information, and particularly relates to a cross iteration method of relay protection information identification.
Background
At present, relay protection information of most transformer substations in China is transmitted to a main station from a substation, and communication is appointed by adopting a communication point table mode. The point table includes the specific content of the message, the group number and the entry number. The point table only appoints the content of the message and the corresponding point number entry number, does not reflect the specific physical meaning of the message, and does not reflect the specific use and the correlation relationship between the message, so that the physical meaning of the relay protection information of the main station needs to be identified.
When the genetic algorithm is applied to cross iteration, if the diversity degree of a sample to be identified is high, the characteristic code data bit is long, the convergence rate of iteration is reduced, and particularly when a large number of messages need to identify physical meanings, the overall identification speed is reduced.
Disclosure of Invention
The invention aims to provide a cross iteration method for identifying relay protection information, which can improve the convergence speed of cross iteration during identification of the relay protection information.
In order to achieve the above purpose, the solution of the invention is:
a cross iteration method for identifying relay protection information divides the feature code cross iteration of an information sample sent by a relay protection device into two stages, and the feature code for cross iteration in the second stage is formed by deleting on the basis of the feature code of cross iteration in the first stage.
When the feature codes which are completely matched appear in the cross iteration process of the feature codes in the first stage, new feature codes are formed according to the feature codes.
The method for forming the new feature code comprises the following steps: and shortening the data bits of the binary number of the other feature codes according to the strong association relationship between the completely matched feature codes and the other feature codes to form new feature codes.
The second stage performs cross iteration by using the new feature codes formed in the first stage.
The signature code is represented by a binary number, the number of bits of which corresponds to the number of bits of the signature code binary number.
After the scheme is adopted, the data bits of the binary numbers of other feature codes are adjusted according to the strong association relationship between the completely matched feature codes and other feature codes, and when the feature codes are completely matched, the data bit length of other feature codes can be shortened, so that the data bit length of new feature codes is shortened, the feature code data bit length is shortened, and the iteration speed is increased.
Drawings
FIG. 1 is a diagram of primary characteristic codes of a code 1 for meaning identification of protection setting values of a transformer;
fig. 2 is a diagram of a new signature code after the adjustment of the code 1 identified by the meaning of the protection fixed value of the transformer.
Detailed Description
The technical solution and the advantages of the present invention will be described in detail with reference to the accompanying drawings.
The invention provides a cross iteration method for identifying relay protection information, which divides the feature code cross iteration of an information sample sent by a relay protection device into two stages, wherein the feature code of the stage 2 for cross iteration is formed by deleting the feature code of the stage 1 cross iteration on the basis of the feature code, and concretely, when a completely matched feature code appears in the feature code cross iteration process of the stage 1, which is a necessary condition for entering the stage 2, the data bit of binary numbers of other feature codes is shortened according to the strong association relationship between the completely matched feature code and the other feature codes to form a new feature code, and the stage 2 adopts the new feature code formed in the stage 1 for cross iteration.
The feature code is represented by a binary number, the number of bits of the binary number being identical to the number of bits of the feature code binary number.
Taking the identification of the over-current fixed value of the transformer protection as an example, the following steps are carried out: and (5) medium-complex voltage overflowing the III section to be constant.
The information obtained from the master station includes a fixed value name: "medium-complex voltage overcurrent III section constant value", constant value range: [0,150], setting step length by fixed value: 1, constant value unit: A.
the feature code 1 is set to identify fixed value information, and enumerates side descriptions that may appear in the relay protection device of each generation of each manufacturer, for example: the high-voltage side 1, the high-voltage side 1 branch, the side I, the high-voltage side 1 branch, the side 1, the high-voltage side 1, the side I, the high-voltage side I branch, 13 keywords are totally 13, the binary number of 13 is 1101, namely 4 data bits are occupied when the feature code 1 is set;
the feature code 2 is set to identify a protection constant value type, and a constant value description of a protection type that may occur in each generation of relay protection device of each manufacturer for transformer protection is listed, for example: longitudinal difference, longitudinal differential, split phase, cell, split side, zero difference, overexcitation, impedance, complex voltage overcurrent, complex current, overcurrent, zero current, zero sequence overcurrent, overload, air cooling starting, cooler starting, locking and pressure regulating, variation, power frequency variation, simple bus difference, gap, zero sequence overvoltage, zero pressure, constant value, matrix, control word, input, direction, self-produced zero current, pointing bus, complex voltage locking and other side, 34 key words in total, 34 binary numbers are 100010, namely, setting a feature code 2 needs to occupy 6 data bits;
the feature code 3 is set to identify the number of segments and the number of time limits, and a fixed value description of protection types possibly occurring in relay protection devices of each generation of each manufacturer for transformer protection is listed, for example: 1-section 1 time limit, 1-section 2 time limit, 1-section 3 time limit, 1-section 4 time limit, 2-section 1 time limit, 2-section 2 time limit, 2-section 3 time limit, 2-section 4 time limit, 3-section 1 time limit, 3-section 2 time limit, 3-section 4 time limit, 4-section 1 time limit, 4-section 2 time limit, 4-section 3 time limit, 4-section 4 time limit, 1 time limit, 2 time limit, 3 time limit, 4 time limit, I-section 1 time limit, I-section 2 time limit, I-section 3 time limit, I-section 4 time limit, II-section 1 time limit, II-section 2 time limit, II-section 3 time limit, II-section 4 time limit, III-section 1 time limit, III-section 2 time limit, III-section 3 time limit, III-section 4 time limit, IV-section 1 time limit, IV-section 2 time limit, IV-section 3 time limit, IV-section 4 time limit, 36 keywords, 36 binary number of 100100, that is set up to characteristic code 3, and occupies 6 data bits.
The characteristic code 4 is set for identifying a fixed value range, and the fixed value ranges which are possibly generated by the relay protection devices of various generations of manufacturers under the protection of the transformer are listed as follows: the binary numbers of 6 kinds of binary numbers of 6 kinds are 110, namely 3 data bits are needed to set the feature code 4, wherein the binary numbers of 6 kinds are [0, 1], [0,20 ], [0, 65535], [0,20000], [0,150], [0,200 ].
Setting a characteristic code 5 for identifying a fixed value setting step length, wherein the step lengths possibly occurring in each generation of relay protection device of each manufacturer for transformer protection are listed as follows: 1. 0.1, 0.01, 0.001, 4 binary numbers are 100, i.e. the feature code 5 needs to occupy 3 data bits.
The characteristic code 6 is set for identifying units, and the units which may appear in the relay protection devices of each generation of each manufacturer for transformer protection are listed as follows: ms, s, min, h, Ω, a, Ie, V, sec, msec, min, hr, ohm, amp, volt, unitless, 16 total, 4 binary numbers are 10000, i.e. the feature code 5 needs to occupy 5 data bits.
Combining feature code 1, feature code 2, feature code 3, feature code 4, feature code 5, and feature code 6, a feature code occupying 27 data bits in total as shown in fig. 1 can be obtained:
randomly generating 20 groups of binary numbers with the length of 27 bits in the coding data pool, for example:
and (3) coding 1: 110100011000100110100100110, respectively;
and (3) encoding 2: 000110010110101010101110101, respectively;
……
and (3) encoding 20: 110011011111101000101111100, respectively;
in code 1, the value of feature code 1 is 1101, and is expressed as a decimal number of 13, meaning: "high I Branch", feature code 2 has a value of 000110, expressed as a decimal number of 6, meaning: "homodyne", the value of feature code 3 is 001001, expressed as a decimal number of 9, meaning: "3 segment 1 time limit", the feature code 4 has a value of 101, expressed as a decimal number of 5, meaning: the range is (0,150), the feature code 5 has a value of 001, expressed as a decimal number of 1, meaning: the step size is 1, the feature code 6 has a value of 00110, expressed as a decimal number of 6, meaning: the unit information is a.
Calculating the matching degree of the characteristic codes of the code 1, finding that the characteristic codes 6 of the code 1 are completely matched, and identifying that the unit of the constant value of the signal to be identified is A, namely ampere, in relay protection, only the unit of the overcurrent protection constant value is ampere, such as overcurrent, zero sequence overcurrent and simple bus, so that the signal to be identified can be judged to be impossible for differential protection, impedance protection and overexcitation protection, and meanwhile, because the control word and the trip matrix constant value have no unit, the signal to be identified can be judged to be not the control word or the trip matrix constant value.
After the information of the feature code 6 is inferred, the content of the feature code 2 may be simplified, and only the strongly related keywords are left, for example: the method comprises the following steps of repressing overcurrent, repressing current, overflowing, zero current, zero sequence overcurrent, overloading, starting air cooling, starting a cooler, locking and regulating voltage, a simple bus difference, a gap and a fixed value, wherein 13 keywords are total, the binary number of 13 is 1101, namely a new feature code 2 only needs to occupy 4 data bits, as shown in fig. 2, two-bit data bits are reduced compared with the initially set 2 data bits of the feature code, the shorter the data bits are, the fewer the combinations are, the faster the cross iterative operation can be successfully matched, and the matching time is shortened.
The above embodiments are only for illustrating the technical idea of the present invention, and the protection scope of the present invention is not limited thereby, and any modifications made on the basis of the technical scheme according to the technical idea of the present invention fall within the protection scope of the present invention.

Claims (5)

1. A cross iteration method for relay protection information identification is characterized by comprising the following steps: the characteristic coding cross iteration of the information sample sent by the relay protection device is divided into two stages, when completely matched characteristic codes appear in the characteristic coding cross iteration process of the first stage, the second stage is entered, and the characteristic codes for cross iteration of the second stage are formed by deleting on the basis of the characteristic codes of the first stage.
2. The cross-iteration method for relay protection information identification as claimed in claim 1, wherein: when the feature codes which are completely matched appear in the cross iteration process of the feature codes in the first stage, new feature codes are formed according to the feature codes.
3. The cross-iteration method for relay protection information identification as claimed in claim 2, wherein: the method for forming the new feature code comprises the following steps: and shortening the data bits of the binary number of the other feature codes according to the strong association relationship between the completely matched feature codes and the other feature codes to form new feature codes.
4. The cross-iteration method for relay protection information identification as claimed in claim 3, wherein: the second stage performs cross iteration by using the new feature codes formed in the first stage.
5. The cross-iteration method for relay protection information identification as claimed in claim 1, wherein: the feature code is represented by a binary number, the number of bits of the binary number being identical to the number of bits of the feature code binary number.
CN201910505575.1A 2019-06-12 2019-06-12 Cross iteration method for relay protection information identification Active CN110323722B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201910505575.1A CN110323722B (en) 2019-06-12 2019-06-12 Cross iteration method for relay protection information identification

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201910505575.1A CN110323722B (en) 2019-06-12 2019-06-12 Cross iteration method for relay protection information identification

Publications (2)

Publication Number Publication Date
CN110323722A CN110323722A (en) 2019-10-11
CN110323722B true CN110323722B (en) 2021-07-27

Family

ID=68119534

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201910505575.1A Active CN110323722B (en) 2019-06-12 2019-06-12 Cross iteration method for relay protection information identification

Country Status (1)

Country Link
CN (1) CN110323722B (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112165354A (en) * 2020-09-29 2021-01-01 青岛网信信息科技有限公司 Method for simplifying Beidou positioning satellite short message communication by utilizing big data

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103268568A (en) * 2013-04-19 2013-08-28 山东电力集团公司 Method for determining relay protection device definite value by utilizing formula editor self-defined template
CN103426128A (en) * 2013-08-29 2013-12-04 国家电网公司 Self-adaptation relay protection constant value switching method based on power distribution network dispatching system

Family Cites Families (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104933478B (en) * 2015-06-04 2018-03-30 国网山东省电力公司电力科学研究院 A kind of relay protection multiple-objection optimization setting method
CN104915777B (en) * 2015-06-12 2018-11-02 北京交通大学 Relay protection criterion method based on the analysis of dynamic trend degree
CN105606931A (en) * 2015-12-30 2016-05-25 国网天津市电力公司 Quantum-genetic-algorithm-based fault diagnosis method for medium-voltage distribution network
CN108053032A (en) * 2017-11-20 2018-05-18 华北电力大学 A kind of choosing method of the data model training sample based on genetic algorithm
CN108156018B (en) * 2017-11-27 2021-06-04 上海观安信息技术股份有限公司 Power network device topology identification method, electronic device and computer storage medium
CN109583371A (en) * 2018-11-29 2019-04-05 北京航天自动控制研究所 Landmark information based on deep learning extracts and matching process

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103268568A (en) * 2013-04-19 2013-08-28 山东电力集团公司 Method for determining relay protection device definite value by utilizing formula editor self-defined template
CN103426128A (en) * 2013-08-29 2013-12-04 国家电网公司 Self-adaptation relay protection constant value switching method based on power distribution network dispatching system

Also Published As

Publication number Publication date
CN110323722A (en) 2019-10-11

Similar Documents

Publication Publication Date Title
EP0914718B1 (en) Data compression and decompression system with immediate dictionary updating interleaved with string search
US5602764A (en) Comparing prioritizing memory for string searching in a data compression system
US5467087A (en) High speed lossless data compression system
CA2324608C (en) Adaptive packet compression apparatus and method
US20030102989A1 (en) Coding apparatus and decoding apparatus
CN110323722B (en) Cross iteration method for relay protection information identification
Rice Practical universal noiseless coding
CN112134568A (en) Lossy data compression and decompression method and system
CN110265981B (en) Incremental cross iteration method for relay protection information identification
Mahdavifar Fast polarization for non-stationary channels
GB2060226A (en) Data compression-decompression
JP3080149B2 (en) Pattern encoding method and decoding method, and encoding apparatus and decoding apparatus using the method
CN112667633A (en) Data compression method and system based on statistical probability
CN110323723B (en) Relay protection information identification method based on feature codes
Gavish et al. Match-length functions for data compression
CN109581999B (en) Method for processing state data of power distribution channel of aircraft electromechanical system
US10528641B2 (en) Encoder and decoder for transmission of coefficients to a neural network
CN112887132A (en) Transformer substation integral process layer configuration-free GOOSE self-adaptive probe method
Chakrapani et al. Hybrid genetic-simulated annealing approach for fractal image compression
CN112751567A (en) Compression method of transient wave recording interactive data of power system
Tsai et al. An Improved LZW Algorithm for Large Data Size and Low Bitwidth per Code
Teneketzis et al. Control of weakly-coupled Markov chains
CN103078706B (en) A kind of dictionary query compression method and device utilizing redundant digit
CN113569103B (en) Technical scheme self-matching method, electronic equipment and storage medium in coal chemical industry
EP1555840B1 (en) Converting binary data into SMS characters

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
GR01 Patent grant
GR01 Patent grant