WO2018086199A1 - 最后断路器的边界搜索方法 - Google Patents

最后断路器的边界搜索方法 Download PDF

Info

Publication number
WO2018086199A1
WO2018086199A1 PCT/CN2016/111523 CN2016111523W WO2018086199A1 WO 2018086199 A1 WO2018086199 A1 WO 2018086199A1 CN 2016111523 W CN2016111523 W CN 2016111523W WO 2018086199 A1 WO2018086199 A1 WO 2018086199A1
Authority
WO
WIPO (PCT)
Prior art keywords
circuit breaker
condition
expression
critical
conditions
Prior art date
Application number
PCT/CN2016/111523
Other languages
English (en)
French (fr)
Inventor
何竞松
Original Assignee
中国南方电网有限责任公司超高压输电公司检修试验中心
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 中国南方电网有限责任公司超高压输电公司检修试验中心 filed Critical 中国南方电网有限责任公司超高压输电公司检修试验中心
Publication of WO2018086199A1 publication Critical patent/WO2018086199A1/zh

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F30/00—Computer-aided design [CAD]
    • G06F30/30—Circuit design
    • G06F30/36—Circuit design at the analogue level
    • G06F30/367—Design verification, e.g. using simulation, simulation program with integrated circuit emphasis [SPICE], direct methods or relaxation methods

Definitions

  • the present invention relates to the field of power system technologies, and in particular, to a boundary search method for a final circuit breaker.
  • the AC field of the existing DC project is generally two-thirds of the wiring of the double mother with multiple AC strings.
  • the inverter can be connected by three circuit breakers per string (including one circuit breaker and one isolation switch on each side). AC lines, AC filters, busbars, etc. When the number of connected devices increases, the number of AC strings will also increase, and the resulting switching conditions will increase exponentially. If there are N circuit breaker intervals, there will be 2 N kinds of switching conditions.
  • the current practice of setting up interlocks is to artificially find all critical switching conditions and the last circuit breakers in them, and then write a program for each critical switching condition (tens or even hundreds of programs); The critical switching condition occurs in the field, and the final circuit breaker is locked in the program condition.
  • a boundary search method for a final circuit breaker includes the steps of:
  • D2 At least one AC line is connected to the busbar 2;
  • M2 The two busbars are connected
  • ⁇ B ( ⁇ M1 )&( ⁇ C1 & ⁇ D1 + ⁇ C2 & ⁇ D2 )+ ⁇ M2 &( ⁇ C1 + ⁇ C2 )&( ⁇ D1 + ⁇ D2 )
  • the invention considers the operating condition of the converter as a large set from the perspective of mathematical set, and decomposes the large set into six small sets, first writes the expression of each small set, and then combines to obtain the operable Conditional expression. Clearly and easily divide the operational and non-operational conditions with expressions that satisfy the operational conditions. If a working condition satisfies the expression of the operating condition, but the original closed circuit breaker is separated and the running condition expression is no longer satisfied, the current working condition is determined as the critical working condition, and the current circuit breaker is the last open circuit. Device. The above process can be completely completed by a set of programs, without manual intervention, which improves the efficiency and reliability of the last circuit breaker search.
  • Figure 1 is a schematic diagram showing the separation of two circuit breakers in an AC field of two strings of two-thirds wiring
  • FIG. 2 is a schematic diagram of a set A of incompressible operating conditions of the converter, a set B of operating conditions of the converter, and a distribution of operating point points;
  • Figure 3 is a schematic diagram showing the closed state of all circuit breakers in the AC field of two strings of two-thirds wiring
  • Figure 4 is a schematic diagram of the conversion wiring of the operating point when searching for the last circuit breaker
  • Figure 5 is a schematic diagram showing the conversion set of the operating point when searching for the last circuit breaker
  • FIG. 6 is a flow chart of an automatic generation method of the last circuit breaker interlock table based on the boundary search.
  • circuit breaker If there are N circuit breaker intervals in the two-thirds of the DC system AC field, each circuit breaker interval (referred to as circuit breaker) can produce two working conditions, then N intervals can be combined to 2 N Switching conditions.
  • the last circuit breaker is a circuit breaker that causes DC blocking in critical switching conditions (critical switching conditions generally contain multiple circuit breakers, where there may be non-final circuit breakers that do not cause a trip after separation, or both There are multiple final circuit breakers, or both, but at least one last circuit breaker exists.
  • S is the complete set and contains 2 N different switching conditions.
  • These 2 N kinds of working conditions can be divided into two categories, one is the "inverter can not operate (no current path)" operating conditions, set to set A, the other is "inverter can run (with current)
  • the condition of the path) is set to set B.
  • A contain i operating conditions
  • B contains (2 N -i) operating conditions.
  • j critical conditions containing the last circuit breaker must be included, leaving k are ordinary operable conditions without the last circuit breaker.
  • the set S, A, and B are expressed as follows, and the relationship is as shown in Figure 2:
  • a critical condition b 1x is initial, converted to another critical condition b 1y (separate is not the last circuit breaker), or converted to inoperable condition a y (separate is the last circuit breaker):
  • a normal operating condition b 2x is initial, converted to another normal operating condition b 2y , or converted to a critical operating condition b 1y :
  • the 5012, 5022, 5013, 5011, 5021 switches are separated in order, and the conversion relationship of each separate switch is:
  • the underlined switch number is the last circuit breaker under this condition. When the last circuit breaker 5011 in b 12 is separated, the inverter and the AC line have no path and are blocked and stopped.
  • the last circuit breakers (underlined switch numbers) in the above examples b 22 and b 11 are manually found according to the working conditions of the AC field, and are not automatically determined by the program and found out.
  • the method of boundary search begins by establishing the expression of set B (to cover all the points in the set) and then starting the search.
  • Collection B is a collection of runnable conditions, so to find an expression that covers all runnable conditions, you can first break the set B into multiple small sets, and then just write the expression of each small set, then An expression covering all runnable conditions is available.
  • the operating condition is characterized by a current path between the converter and the AC line, which is equivalent to having an electrical connection between the converter and the AC line.
  • the busbar is used as the connection carrier to ensure that the two electrical connections can be divided into two cases: when the two busbars are not connected, the inverter and the at least one AC line are connected to the same busbar; when the two busbars are connected, The inverter is connected to the bus and at least one AC line is connected to the bus.
  • set B can be decomposed into:
  • ⁇ B ⁇ M1 &( ⁇ C1 & ⁇ D1 + ⁇ C2 & ⁇ D2 )+ ⁇ M2 &( ⁇ C1 + ⁇ C2 )&( ⁇ D1 + ⁇ D2 )
  • ⁇ B denotes the expression of set B, and the rest are similar, “&” means “and”, or “+” means “or”, wherein the expression of each small set can be arranged according to the equipment arrangement of different exchange fields. Write it easily.
  • ⁇ D1 (5011 closed) or (5021, 5022 are closed)
  • ⁇ M1 (5011, 5012, 5013 at least one separate) and (5021, 5022, 5023 at least one separate)
  • ⁇ B ⁇ M1 &( ⁇ C1 & ⁇ D1 + ⁇ C2 & ⁇ D2 )+ ⁇ M2 &( ⁇ C1 + ⁇ C2 )&( ⁇ D1 + ⁇ D2 )
  • set A and set B are mutually antagonistic. From the perspective of event occurrence, event A and event B must have one and only one. For a certain condition z, there must be The z ⁇ A, and vice versa (a condition not to run is not operating conditions, no exceptions), and therefore does not satisfy the expression ⁇ B will meet the expression ⁇ A, namely:
  • ⁇ A As long as ⁇ A is written, it can be judged whether each operating point belongs to an operable condition or an inoperable condition, and the last circuit breaker in the operable condition can be searched.
  • the overall search process is divided into two steps:
  • each of the closed circuit breakers in the operational condition may be the last circuit breaker, when it is judged that a certain working condition is an operable condition, the program starts to search for the last circuit breaker. , that is, the circuit breakers that were originally closed are separately divided one by one, and it is judged whether the new working condition satisfies ⁇ B when separated, and if ⁇ B is not satisfied, then ⁇ A is satisfied (ie ⁇ B becomes ), the separate circuit breaker is the last circuit breaker.
  • b 11 is separated by 5011 or 5021, and the new working condition is satisfied.
  • 5011, 5021 is the last circuit breaker, which can gradually outline the boundary of the set A and the set B (the cross-set transition line is perpendicular to the boundary), as shown in FIG.
  • Interlocking is the locking of a target device to make it inoperable when certain conditions occur.
  • Simple interlocking such as the interlocking of the main knife of a knife gate and its grounding knife, when the grounding knife is closed, the main knife is clamped by the mechanical structure so that it cannot be closed.
  • interlocking is provided between all circuit breakers in the AC field. The logic is very complicated and the distance between them is very long. It cannot be interlocked by mechanical structure.
  • the practice of setting interlocks is to artificially find out all critical switching conditions and the last circuit breakers therein, and then write a program for each critical switching condition; when the critical field is closed, the critical conditions are met.
  • the program condition locks the last circuit breaker in it.
  • This method is based on human finding so that it cannot traverse all operating conditions, so the last circuit breaker interlocking table covering all operating conditions cannot be automatically generated.
  • the program can automatically search for all the last circuit breakers and all critical conditions, so that an interlock table can be formed.
  • the system can be imported into the converter station on-site control and protection system, which can replace the existing tens or even hundreds of programs, so that the system can check the current AC field conditions without complicated and complicated judgment logic.
  • the interlocking table can be easily used by the on-site operators to provide the basis and guarantee for manual switching.
  • the content of the switching condition is the separation information of N circuit breakers. If the control and protection system checks the current switching conditions of the current AC field to check the separation information of the N circuit breakers, the system operation efficiency is very low. Similarly, the operation personnel are not convenient to use. Establishing an index number for each case can solve this problem.
  • the N circuit breaker split information for each operating point can be considered as a binary number. As long as the binary number is converted to a decimal number, this can represent the condition point. Originally, it is necessary to check N pieces of information and only need to check one number. Therefore, the efficiency of the system for checking the table will be relatively high, and it is also convenient for the operating personnel to use.
  • Such a decimal number is the index number of the case.
  • the above processes a to g are the automatic generation process of the last circuit breaker interlock table, as shown in FIG. 6.
  • the first analysis is from the perspective of mathematical set, and the turning condition is divided by the angle of the collecting point, which can clearly divide the non-operating working condition and the operable working condition ( Including the critical closing condition and the normal operable condition), the process transformation process is visually represented in the set graph by the transformation line, thereby revealing the relationship between the critical condition and the final circuit breaker and the set AB boundary. This gives a way to determine the final circuit breaker.
  • the boundary of set A and set B is searched for the change of ⁇ B.
  • the steps of the search are specifically described, including methods and steps for traversing all of the operating points and searching for the last circuit breaker.
  • the invention adopts the boundary search method, first determines the last circuit breaker, and then generates an interlocking table, and has the following advantages:
  • the program based on this method can automatically generate a simple runnable expression, without the need to manually write tens or even hundreds of programs, greatly reducing the complexity of the program and the probability of writing errors.
  • the program has high versatility. For different structures of the AC field, it is only necessary to change the code of the “AC field structure initialization” in the algorithm flow. It is only necessary to change the external interface signal, and there is no need to change the algorithm core. Therefore, for the AC field expansion, After the transformation, it is necessary to upgrade the work of controlling the protection program, which is very efficient.
  • the interlock table of the circuit breaker makes the control protection program look up the table with the index number of the current working condition, and quickly interlocks the last circuit breaker, which is faster and more effective than the current method of setting the interlock.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Hardware Design (AREA)
  • Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Microelectronics & Electronic Packaging (AREA)
  • Evolutionary Computation (AREA)
  • Geometry (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Supply And Distribution Of Alternating Current (AREA)
  • Train Traffic Observation, Control, And Security (AREA)

Abstract

公开了一种最后断路器的边界搜索方法，从数学集合的角度出发，将换流器可运行工况当做一个大集合，并将大集合分解为六个小集合，先写出每个小集合的表达式，再组合得到可运行工况的表达式。以是否满足可运行工况的表达式，清楚简单地划分可运行工况和不可运行工况。若某工况满足可运行工况的表达式，但将一个原来闭合的断路器分开后不再满足可运行工况表达式，则将当前工况判定为临界工况，当前断路器为最后断路器。以上过程可以全部交给一套程序自动完成，无需人工参与，提高了最后断路器搜索的效率和可靠性。

Description

最后断路器的边界搜索方法 技术领域
本发明涉及电力系统技术领域，具体涉及一种最后断路器的边界搜索方法。
背景技术
现有直流工程的交流场一般为含有多个交流串的双母二分之三接线，可通过每串三个断路器间隔(含一个断路器及其两边各一个隔离开关)连接换流器、交流线路、交流滤波器、母线等设备。当所连的设备增多，交流串的数量也会增多，所构成的倒闸工况将成指数增长，若有N个断路器间隔，则有2N种倒闸工况。
在某种倒闸工况下，若其中一个断路器分开，会导致换流器失去所有电流通路而停运，则该断路器为最后断路器，该工况为直流运行与停运间的临界倒闸工况。
为了避免在临界倒闸工况中，错误地分开最后断路器而导致直流闭锁，需要对交流场的各断路器间隔设置联锁逻辑。
目前设置联锁的做法是：人为找出所有临界倒闸工况，以及其中的最后断路器，然后把每种临界倒闸工况都编写一段程序(几十甚至几百段程序)；当交流场出现临界倒闸工况，满足程序条件，则锁定其中的最后断路器。
这种方法需要大量的人为主观判断，效率极其低下，而且判断结果非常不可靠；需要对每个临界工况编程，编写几十甚至几百段程序，导致程序庞大繁琐易错；无法自动搜索出所有最后断路器，无法形成联锁表，没有可用性。
发明内容
针对现有技术的不足，本发明的目的在于提供一种最后断路器的边界搜索方法，以提高最后断路器和临界工况的搜索效率和准确性。
为了实现上述目的，本发明采取的技术方案是：
一种最后断路器的边界搜索方法，包括步骤：
建立待搜索交流场的模型，该模型包括各个双母二分之三接线的交流串；
根据所建立的交流场模型，用各个断路器的分合状态表达C1、C2、D1、D2、 M1和M2六个事件，对六个事件的表达式ГC1、ГC2、ГD1、ГD2、ГM1和ГM2进行组合，得到换流器可运行工况集合B的表达式ГB：
C1＝换流器连到母线1；
C2＝换流器连到母线2；
D1＝至少一条交流线路连到母线1；
D2＝至少一条交流线路连到母线2；
M1＝两条母线没有连接；
M2＝两条母线有连接；
B＝M1∩(C1∩D1∪C2∩D2)∪M2∩(C1∪C1)∩(D1∪D2)
ΓB＝(ΓM1)&(ΓC1&ΓD1+ΓC2&ΓD2)+ΓM2&(ΓC1+ΓC2)&(ΓD1+ΓD2)
遍历所述交流场模型所有的工况，判断当前工况是否满足表达式ГB，若满足则将该工况下闭合的断路器逐个分合一次，并判断分开后是否不再满足表达式ГB，若不再满足，则当前工况为临界工况，该分开的断路器为最后断路器。
与现有技术相比，本发明的有益效果在于：
本发明从数学集合的角度出发，将换流器可运行工况当做一个大集合，并将大集合分解为六个小集合，先写出每个小集合的表达式，再组合得到可运行工况的表达式。以是否满足可运行工况的表达式，清楚简单地划分可运行工况和不可运行工况。若某工况满足可运行工况的表达式，但将一个原来闭合的断路器分开后不再满足可运行工况表达式，则将当前工况判定为临界工况，当前断路器为最后断路器。以上过程可以全部交给一套程序自动完成，无需人工参与，提高了最后断路器搜索的效率和可靠性，不必再编写几十甚至几百段程序，大大降低了程序复杂程度以及编写错误的概率。对于不同结构的交流场，只需更改交流场模型即可，相当于只需更改外部接口信号，无须变更算法核心，因此对于交流场扩建、改造后需要升级控制保护程序的工作，效率很高。
附图说明
图1为两串二分之三接线的交流场两个断路器分开工况的示意图；
图2为换流器不可运行工况集合A和换流器可运行工况集合B及工况点分布转化示意图；
图3为两串二分之三接线的交流场所有断路器均闭合工况的示意图；
图4为搜索最后断路器时工况点的转化接线示意图；
图5为搜索最后断路器时工况点的转化集合示意图；
图6为基于边界搜索的最后断路器联锁表的自动生成方法流程图。
具体实施方式
下面结合具体实施方式对本发明作进一步的说明。
若在直流系统交流场双母二分之三接线中有N个断路器间隔，每个断路器间隔(简称断路器)的分合可产生两种工况，则N个间隔可组合出2N种倒闸工况。
1、最后断路器
在某种倒闸工况(简称工况)下，若其中一个断路器分开，会导致换流器失去所有电流通路而停运，则该断路器为最后断路器，该工况为直流运行与停运间的临界倒闸工况。可见，最后断路器就是临界倒闸工况中会导致直流闭锁的断路器(临界倒闸工况一般含有多个断路器，其中可能存在分开后不会导致跳闸的非最后断路器，也可能同时存在多个最后断路器，或者两者都有，但是至少存在一个最后断路器)。
以两串二分之三接线的交流场作为例子，如图1所示，该工况的断路器5012、5022均分开，其余均合上，此时若断开5021或5011，都会导致换流器与交流线路1断开电气连接，失去所有电流通路而停运，因此5011和5021均为最后断路器；但断开5013或5023都不会影响运行，因此5013和5023都不是最后断路器。
2、临界倒闸工况数学集合分析
假设所有倒闸工况的集合为S，则S为全集，包含2N种不同的倒闸工况。这2N种工况可分为两大类，一类是“换流器不可运行(无电流通路)”的工况，设为集合A，另一类是“换流器可运行(有电流通路)”的工况，设为集合B。设A包含i个工况，则B包含(2N-i)个工况，在这(2N-i)个工况中，必然包括了含有最后断路器的j个临界工况，剩下k个为不含最后断路器的普通可运行工况。集合S、A、B如下表达式，关系如图2所示：
A＝{a1,a2,…,ai}1≤1
B＝{b11,b12,…,b1j,b21,b22,…,b2k}1≤j,1≤k
Figure PCTCN2016111523-appb-000001
(即
Figure PCTCN2016111523-appb-000002
)
Figure PCTCN2016111523-appb-000003
因为分开一个最后断路器，可导致直流闭锁，即从可运行工况转为不可运行工况，因此可以考虑仅分开一个断路器的情况，分析以上倒闸工况间的转化关系(初态→末态)，找出集合A与集合B之间的边界：
当某个不可运行工况ax分开一个断路器，必转化为另一个不可运行工况ay；
Figure PCTCN2016111523-appb-000004
当某个可运行工况(b1xor b2x)分开一个断路器，可分为两种情况：
①某个临界工况b1x为初态，转化为另一个临界工况b1y(分开的是非最后断路器)，或者转化为不可运行工况ay(分开的是最后断路器)：
Figure PCTCN2016111523-appb-000005
②某个普通可运行工况b2x为初态，转化为另一个普通可运行工况b2y，或者转化为某个临界工况b1y：
Figure PCTCN2016111523-appb-000006
由以上转化关系可知，只有临界工况分开所含的最后断路器才会转化为不可运行工况(b1x→ay)，其转化线跨越集合A和集合B的边界，其余点的转化线均只能在各自集合内部，与两集合的边界无关。每条转化线可追溯一个断路器，那么找到每条跨A-B集合的转化线(b1x→b1y)，就可找到所有最后断路器。
下面以图3的二分之三接线的交流场作为例子，以所有开关均合上b21为初态：
b21＝(5023合、5022合、5021合、5013合、5012合、5011合)
按顺序分开5012、5022、5013、5011、5021开关，每分开一个开关的转化关系为：
Figure PCTCN2016111523-appb-000007
Figure PCTCN2016111523-appb-000008
其中带下划线的开关编号就是该工况下的最后断路器，当分开b12中的最后断路器5011，则导致换流器与交流线路没有通路而闭锁停运。
3、边界搜索的原理
以上例子b22、b11中的最后断路器(带下划线的开关编号)是根据交流场的工况人为找出来的，非程序自动判断并找出来的。
要从2N种工况中自动找到所有最后断路器，根据以上的集合分析，等价于要找到所有临界工况点及其跨A-B集合转化线(能追溯到某个最后断路器)，可以利用集合A和集合B的边界搜索过程进行自动查找。
边界搜索的方法，首先要确立集合B的表达式(需涵盖该集合中的所有点)，然后开始搜索。
3.1可运行工况的表达式
集合B是可运行工况的集合，因此要找到涵盖所有可运行工况的表达式，可以先将集合B分解多个小集合的组合，然后只要写出每个小集合的表达式，那么就可得到涵盖所有可运行工况的表达式。
分解的依据如下：可运行工况的特征为换流器与交流线路有电流通路，等价于换流器与交流线路必须有电气连接。以母线为连接载体，确保两者有电气连接的工况可分成两种情况：当两母线没有连接时，换流器与至少一条交流线路连到同一条母线上；当两母线有连接时，换流器连到母线上，且至少一条交流线路与母线有连接。
根据以上分解的情况，设定以下事件(即集合)：
C1＝换流器连到母线1
C2＝换流器连到母线2
D1＝至少一条交流线路连到母线1
D2＝至少一条交流线路连到母线2
M1＝两条母线没有连接
M2＝M1'(M1的反集)＝两条母线有连接
则集合B可分解为：
B＝M1∩(C1∩D1∪C2∩D2)∪M2∩(C1∪C1)∩(D1∪D2)
其对应的表达式为
ΓB＝ΓM1&(ΓC1&ΓD1+ΓC2&ΓD2)+ΓM2&(ΓC1+ΓC2)&(ΓD1+ΓD2)
式中ΓB表示集合B的表达式，其余类似，“&”表示“且”，或“+”表示“或”，其中每个小集合的表达式都可根据不同交流场的设备布置情况较为容易地写出。
按图3的交流场结构为例子，
可写出每个小集合的表达式：
ΓC1＝5021合上
ΓC2＝5022、5023均合上
ΓD1＝(5011合上)或(5021、5022均合上)
ΓD2＝(5012、5013均合上)或(5023合上)
ΓM1＝(5011、5012、5013至少一个分开)且(5021、5022、5023至少一个分开)
Figure PCTCN2016111523-appb-000009
(ΓM1表达式取反)
ΓB＝ΓM1&(ΓC1&ΓD1+ΓC2&ΓD2)+ΓM2&(ΓC1+ΓC2)&(ΓD1+ΓD2)
3.2表达式与边界
由于
Figure PCTCN2016111523-appb-000010
因此在数学集合的概念中，集合A与集合B为互为对立关系，以事件发生的角度来看，事件A和事件B必有一个且仅有一个发生。对于某个工况z，必有若
Figure PCTCN2016111523-appb-000011
则z∈A，反之亦然(某个工况不是可运行就是不可运行工况，没有例外)，因此不满足表达式ΓB就会满足表达式ΓA，即：
Figure PCTCN2016111523-appb-000012
(ΓB表达式取反)
利用这一点，当集合B的某工况点bx中分开某一个断路器时，导致ΓB变成
Figure PCTCN2016111523-appb-000013
即ΓB变成ΓA，那么该工况点为临界工况，该断路器为最后断路器。
这是因为bx一定满足ΓB，当分开某个断路器后，如果bx转化为by，那么by也满足ΓB；只有bx转化为ay，那么ay才会不满足ΓB。使bx转化为ay的转化线就是最后断路器。
由此可见，只有可以使ΓB变成
Figure PCTCN2016111523-appb-000014
的工况才处于集合A和集合B的边界，如果找到所有这样的临界工况，就可通过其跨A-B集合转化线勾勒出边界的形状。
3.3搜索的步骤
只要写出了ΓA，就能判断每个工况点是属于可运行工况，还是属于不可运行工况，同时可以搜索可运行工况中的最后断路器。
总体搜索过程分为两个步骤：
①遍历所有工况点：让程序自动把所有的开关组合(2N个)工况都罗列一遍，每个工况点都判断是否满足表达式ΓB，满足则为可运行工况，不满足则为不可运行工况。
②搜索最后断路器：因为在可运行工况中每个合上的断路器都有可能是最后断路器，所以当判断出某工况是可运行工况时，程序开始搜索其中的最后断路器，即将其中原本合上的断路器分别逐个分合一次，在分开时判断新工况是否满足ΓB，如果不满足ΓB，则满足ΓA(即ΓB变成
Figure PCTCN2016111523-appb-000015
)，该分开的断路器为最后断路器。
引用图1的例子，以b11为初态工况，开始搜索其中最后断路器，逐个分合5011、5021、5013、5023，使用b11分别转化为a3、a4、b12、b13，如图4所示：
Figure PCTCN2016111523-appb-000016
可知b11分开5011或5021，新工况满足
Figure PCTCN2016111523-appb-000017
则5011、5021为最后断路器，以此可逐步勾勒出集合A和集合B的边界(设跨集合转化线与边界垂直)，如图5所示。
4、自动生成联锁表的算法流程
4.1联锁表
联锁就是当出现某种工况时，锁定目标设备使之不能操作。简单的联锁如一个刀闸的主刀与其接地刀的联锁，当接地刀合上时，则通过机械结构卡住主刀，使之不能合上。然而，交流场所有断路器之间设置联锁，逻辑很复杂，之间距离也很远，无法通过机械结构进行联锁。
目前设置联锁的做法是：人为找出所有临界倒闸工况，以及其中的最后断路器，然后把每种临界倒闸工况都编写一段程序；当交流场出现临界倒闸工况，满足程序条件，则锁定其中的最后断路器。
该方法基于人为查找以致无法遍历所有工况，所以无法自动生成涵盖所有工况的最后断路器联锁表。通过以上边界搜索的方法，遍历所有工况，可让程序自动搜索出所有最后断路器以及所有临界工况，从而可以形成联锁表。
只要有了联锁表，就可表格导入换流站现场控制保护的系统，可替代现有的几十甚至几百段程序，使系统查表判断当前交流场工况，无须复杂庞大的判断逻辑。另一方面，联锁表可便于现场运行人员查阅使用，为手动倒闸提供依据和保障。
4.2建立工况的索引号
倒闸工况的内容为N个断路器的分合信息。如果控制保护系统每次查表判断当前交流场的倒闸工况都要核对N个断路器的分合信息，则系统运行效率很低，同理，运行人员使用也不便利。建立每个工况的索引号，可解决这个问题。
假设断路器合上为1，分开为0，那么每个工况点的N个断路器分合信息可看作一个二进制数。只要将二进制数转化为十进制数，就可以此代表该工况点。本来要核对N个信息变为只需核对一个数字，那么系统进行查表的效率会比较高，也便于运行人员使用。
这样的十进制数为工况的索引号。例如：
b12＝(5023合、5022分、5021合、5013分、5012分、5011合)＝101001＝41
4.3算法流程
初始化过程：
(a)交流场结构初始化：在程序中设置二分之三接线的串数，以及各个节点所连接的设备(换流器、交流线路、交流滤波器、母线等设备)，从而生成待搜索交流场的模型。
(b)自动生成表达式：根据以上(2.1节)小集合的内容(要求)，程序自动生成各小集合的表达式ΓC1、ΓC2、ΓD1、ΓD2、ΓM1、ΓM2，然后组合得到可运行工况的表达式ΓB。
边界搜索过程：
(c)工况判断(第一阶段)：程序自动判断某种工况是否满足ΓB。
(d)最后断路器判断(第二阶段)：若该工况满足ΓB，则需进一步将其中原本合上的断路器分别逐个分合一次，且在分开时调用“工况判断”代码，如果变为不满足ΓB(即ΓB变成
Figure PCTCN2016111523-appb-000018
)，则该工况为临界工况，该分开的断路器为最后断路器。
(e)边界搜索：跳转到“工况判断(第一阶段)”的代码开始位置，对另一个工况进行判断，并循环遍历所有工况(2N个)。
联锁表生成过程：
(f)建立索引号：对找到的所有临界工况建立索引号。
(g)表格化处理：建立表格，每个索引号为表格的一行，每个断路器为表格的一列。每个临界工况所含的最后断路器就在相应的行列交叉处标志。
以上流程a至g就是最后断路器联锁表的自动生成流程，如图6所示。
本发明的关键技术特征及其带来的有益效果如下：
(1)描述了临界倒闸工况的数学集合分析：首创从数学集合的角度进行分析，将倒闸工况以集合点的角度进行划分，可清楚划分不可运行工况、可运行工况(含临界倒闸工况、普通可运行工况)，同时将工况转化过程在集合图中以转化线形象地表示出来，从而揭示了临界工况、最后断路器与集合A-B边界的关系，以此得到判断出最后断路器的方法。
(2)描述了边界搜索的原理：提出将可运行工况集合B分解成小集合的想法，并写出各小集合的内容。各小集合通过集合运算，组合出集合B，以此为依据，推算出可运行工况表达式ΓB。
根据集合A与集合B为互为对立关系，推算出
Figure PCTCN2016111523-appb-000019
结合工况点的转化 (分开一个断路器)，以ΓB的变化搜索集合A和集合B的边界。同时具体描述了搜索的步骤，包含遍历所有工况点和搜索最后断路器的方法和步骤。
(3)描述了自动生成联锁表的算法流程：提出建立工况的索引号的想法和方法，以此为基础，描述自动生成最后断路器联锁表的流程，包括初始化过程、边界搜索过程、联锁表生产过程。
本发明采用边界搜索的方法，先确定最后断路器，再生成联锁表，所具有的优点如下：
(1)程序搜索边界过程中，自动判断出最后断路器，全程无须人为判断，大大提高控制保护系统的可靠性。
(2)基于本方法的程序可自动生成一个简单的可运行工况表达式，无须人为编写几十甚至几百段程序，大大降低程序复杂程度以及编写错误的概率。
(3)程序通用性高，对于不同结构的交流场，只需更改算法流程中的“交流场结构初始化”的代码，相当只需更改外部接口信号，无须变更算法核心，因此对于交流场扩建、改造后需要升级控制保护程序的工作，效率很高。
(4)最后断路器的联锁表，使控制保护程序以当前工况的索引号进行查表，快速联锁最后断路器，比目前设置联锁的方法更快速、更有效。
上列详细说明是针对本发明可行实施例的具体说明，该实施例并非用以限制本发明的专利范围，凡未脱离本发明所为的等效实施或变更，均应包含于本案的专利范围中。

Claims (4)

  1. 一种最后断路器的边界搜索方法，其特征在于，包括步骤：
    建立待搜索交流场的模型，该模型包括各个双母二分之三接线的交流串；
    根据所建立的交流场模型，用各个断路器的分合状态表达C1、C2、D1、D2、M1和M2六个事件，对六个事件的表达式ГC1、ГC2、ГD1、ГD2、ГM1和ГM2进行组合，得到换流器可运行工况集合B的表达式ГB：
    C1＝换流器连到母线1；
    C2＝换流器连到母线2；
    D1＝至少一条交流线路连到母线1；
    D2＝至少一条交流线路连到母线2；
    M1＝两条母线没有连接；
    M2＝两条母线有连接；
    B＝M1∩(C1∩D1∪C2∩D2)∪M2∩(C1∪C1)∩(D1∪D2)
    ΓB＝(ΓM1)&(ΓC1&ΓD1+ΓC2&ΓD2)+ΓM2&(ΓC1+ΓC2)&(ΓD1+ΓD2)
    遍历所述交流场模型所有的工况，判断当前工况是否满足表达式ГB，若满足则将该工况下闭合的断路器逐个分合一次，并判断分开后是否不再满足表达式ГB，若不再满足，则当前工况为临界工况，该分开的断路器为最后断路器。
  2. 根据权利要求1所述的最后断路器的边界搜索方法，其特征在于，还包括步骤：
    对所得各个临界工况设置索引号，建立表格，每个索引号为表格的一行，每个断路器为表格的一列，对每个临界工况所含的最后断路器，在相应的行列交叉处进行标记，得到最后断路器的联锁表。
  3. 根据权利要求2所述的最后断路器的边界搜索方法，其特征在于，
    将断路器的闭合状态表示为1，分开状态表示为0，则每个临界工况对应一个二进制数，将二进制数转换为十进制数，得到所述索引号。
  4. 根据权利要求3所述的最后断路器的边界搜索方法，其特征在于，还包括步骤：
    将所述联锁表导入换流站的控制保护系统，当控制保护系统查找判定当前工 况为临界工况时，锁定所述联锁表中标记的对应的最后断路器。
PCT/CN2016/111523 2016-11-09 2016-12-22 最后断路器的边界搜索方法 WO2018086199A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201610985416.2 2016-11-09
CN201610985416.2A CN106529030B (zh) 2016-11-09 2016-11-09 最后断路器的边界搜索方法

Publications (1)

Publication Number Publication Date
WO2018086199A1 true WO2018086199A1 (zh) 2018-05-17

Family

ID=58350345

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2016/111523 WO2018086199A1 (zh) 2016-11-09 2016-12-22 最后断路器的边界搜索方法

Country Status (2)

Country Link
CN (1) CN106529030B (zh)
WO (1) WO2018086199A1 (zh)

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109659913B (zh) * 2018-12-28 2020-03-10 中国南方电网有限责任公司超高压输电公司检修试验中心 一种基于虚拟电路网络的最后断路器识别方法
CN110137911B (zh) * 2019-06-03 2021-01-29 西南交通大学 一种基于Dijkstra算法的阀组最后断路器识别方法
CN115268937B (zh) * 2022-09-27 2023-02-17 中国空气动力研究与发展中心计算空气动力研究所 一种多相流流场初始化方法、装置、设备及介质

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5737166A (en) * 1995-04-07 1998-04-07 Asea Brown Boveri Ab Protective equipment in a bipolar HVDC station
CN102185278A (zh) * 2011-05-03 2011-09-14 中国电力工程顾问集团中南电力设计院 特高压直流输电换流站保护方法
CN104377648A (zh) * 2014-09-30 2015-02-25 南方电网科学研究院有限责任公司 一种基于证据理论的最后断路器后备保护方法
CN105117509A (zh) * 2015-07-15 2015-12-02 中国南方电网有限责任公司超高压输电公司检修试验中心 一种矩阵化自动判断最后断路器逻辑的方法
CN105514940A (zh) * 2015-11-24 2016-04-20 许继电气股份有限公司 特高压换流站阀组最后断路器自适应判别方法与装置
CN106022956A (zh) * 2016-05-17 2016-10-12 许继集团有限公司 一种区域保护差动环边界断路器动态搜索方法

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103647280B (zh) * 2013-12-31 2016-03-23 淄博金龙电力设备股份有限公司 双路供电智能联络控制器对供电系统进行控制的方法

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5737166A (en) * 1995-04-07 1998-04-07 Asea Brown Boveri Ab Protective equipment in a bipolar HVDC station
CN102185278A (zh) * 2011-05-03 2011-09-14 中国电力工程顾问集团中南电力设计院 特高压直流输电换流站保护方法
CN104377648A (zh) * 2014-09-30 2015-02-25 南方电网科学研究院有限责任公司 一种基于证据理论的最后断路器后备保护方法
CN105117509A (zh) * 2015-07-15 2015-12-02 中国南方电网有限责任公司超高压输电公司检修试验中心 一种矩阵化自动判断最后断路器逻辑的方法
CN105514940A (zh) * 2015-11-24 2016-04-20 许继电气股份有限公司 特高压换流站阀组最后断路器自适应判别方法与装置
CN106022956A (zh) * 2016-05-17 2016-10-12 许继集团有限公司 一种区域保护差动环边界断路器动态搜索方法

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
WANG, LEI ET AL.: "Proceedings of the CSEE", POWER GRID FAILURE DIAGNOSIS OF INFORMATION LOSS OF POWER FAILURE AREA BOUNDARY CIRCUIT BREAKER, vol. 33, no. 22, 5 August 2013 (2013-08-05), pages 127 - 134 *

Also Published As

Publication number Publication date
CN106529030A (zh) 2017-03-22
CN106529030B (zh) 2019-06-28

Similar Documents

Publication Publication Date Title
CN102508059B (zh) 基于智能识别设备状态的拓扑防误校核方法
WO2018086199A1 (zh) 最后断路器的边界搜索方法
CN107992382A (zh) 一种计算机联锁系统及其冗余切换方法
CN106300299B (zh) 一种涉及母联开关的交流场最后断路器判断方法及装置
CN106383958B (zh) 一种变电站防误闭锁逻辑智能验收系统
WO2017008619A1 (zh) 一种矩阵化自动判断最后断路器逻辑的方法
CN103278746A (zh) 考虑不确定信息的电网故障诊断系统的实现方法
CN103077448A (zh) 一种钣金计算机辅助工艺规划系统
CN103761413A (zh) 一种基于拓扑分析的变电站防误逻辑智能生成方法
CN110350522A (zh) 一种基于加权h指数的电力系统脆弱线路辨识方法
CN110908758B (zh) 一种防误闭锁逻辑表达式图形化配置方法及系统
CN105956245A (zh) 一种智能变电站scd模型间隔解耦方法
CN110571802B (zh) 基于粗糙集动态规划模型的配电网自愈控制方法及装置
CN106684862A (zh) 一种基于贪心算法的配电网负荷转供路径搜索方法
CN112421607A (zh) 一种基于拓扑分析的变电站防误操作系统及方法
CN113376549B (zh) 一种柔性直流配电网的纵联保护方法及系统
CN109932617B (zh) 一种基于深度学习的自适应电网故障诊断方法
CN103001318A (zh) 一种基于61850的智能化变电站拓扑五防实现方法
Liao et al. Computing preferred labellings by exploiting sccs and most sceptically rejected arguments
CN108229863B (zh) 一种配电网供电可靠率计算方法
CN107818414B (zh) 一种大规模交直流混联电网n-2预想事故集的生成方法
CN113472003A (zh) 一种基于网络拓扑有权定向的孤岛快速恢复供电方法
Parise et al. A syntax and semantics of a language for operational procedures
CN111914375A (zh) 一种基于贝叶斯推理的电网薄弱环节辨识方法
CN111969638A (zh) 基于整数线性规划的多直流馈入电网恢复分区方法及系统

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 16921111

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 16921111

Country of ref document: EP

Kind code of ref document: A1

32PN Ep: public notification in the ep bulletin as address of the adressee cannot be established

Free format text: NOTING OF LOSS OF RIGHTS PURSUANT TO RULE 112(1) EPC (EPO FORM 1205A DATED 18/09/2019)

122 Ep: pct application non-entry in european phase

Ref document number: 16921111

Country of ref document: EP

Kind code of ref document: A1