CN110137911A - A kind of last breaker recognition methods of valve group based on dijkstra's algorithm - Google Patents
A kind of last breaker recognition methods of valve group based on dijkstra's algorithm Download PDFInfo
- Publication number
- CN110137911A CN110137911A CN201910474535.5A CN201910474535A CN110137911A CN 110137911 A CN110137911 A CN 110137911A CN 201910474535 A CN201910474535 A CN 201910474535A CN 110137911 A CN110137911 A CN 110137911A
- Authority
- CN
- China
- Prior art keywords
- vertex
- breaker
- alternating
- valve group
- current field
- 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.)
- Granted
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/10—Complex mathematical operations
- G06F17/16—Matrix or vector computation, e.g. matrix-matrix or matrix-vector multiplication, matrix factorization
-
- H—ELECTRICITY
- H02—GENERATION; CONVERSION OR DISTRIBUTION OF ELECTRIC POWER
- H02H—EMERGENCY PROTECTIVE CIRCUIT ARRANGEMENTS
- H02H1/00—Details of emergency protective circuit arrangements
- H02H1/0092—Details of emergency protective circuit arrangements concerning the data processing means, e.g. expert systems, neural networks
-
- H—ELECTRICITY
- H02—GENERATION; CONVERSION OR DISTRIBUTION OF ELECTRIC POWER
- H02H—EMERGENCY PROTECTIVE CIRCUIT ARRANGEMENTS
- H02H7/00—Emergency 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/10—Emergency 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 for converters; for rectifiers
Landscapes
- Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Mathematical Physics (AREA)
- Mathematical Optimization (AREA)
- Pure & Applied Mathematics (AREA)
- Computational Mathematics (AREA)
- Mathematical Analysis (AREA)
- Theoretical Computer Science (AREA)
- Data Mining & Analysis (AREA)
- Algebra (AREA)
- Computing Systems (AREA)
- Artificial Intelligence (AREA)
- Databases & Information Systems (AREA)
- Software Systems (AREA)
- General Engineering & Computer Science (AREA)
- Evolutionary Computation (AREA)
- Power Engineering (AREA)
- Supply And Distribution Of Alternating Current (AREA)
Abstract
The present invention discloses a kind of last breaker recognition methods of the valve group based on dijkstra's algorithm, according to the topological structure of alternating-current field, is abstracted as Connected undigraph, constructs adjacency matrix；By the exchange field circuit breaker division state acquired in real time, adjacency matrix is updated, dijkstra's algorithm is converted by last breaker decision problem and solves the shortest route problem that vertex is collected to alternating current circuit on valve group vertex；When certain breaker vertex is in an open state on the path, valve group vertex being continued searching to alternating current circuit and collects vertex, if valve group vertex is collected to alternating current circuit there are path between vertex, which is last breaker；Otherwise, which is not last breaker.The present invention is simple and effective, can be in alternating-current field changes of operating modes, the last breaker of real-time judge valve group, the last breaker retrieval table under all operating statuses woth no need to prepare alternating-current field in advance, has considerable flexibility and versatility.
Description
Technical field
The present invention relates to technical field, the last breaker identification side of specially a kind of valve group based on dijkstra's algorithm
Method.
Background technique
The last breaker of DC transmission system converter station is the key that connect direct current valve group and transmission line of alternation current breaker,
Mainly prevent the unexpected removal of load of converter station from causing converter station overvoltage.Insulation Coordination problem caused by overvoltage is alternating current-direct current mixed connection
System safety operation one of must consider the problems of emphatically.Last breaker is the key that connection direct current system and AC system are disconnected
Road device, last circuit breaker trip will lead to direct current system and disconnect with AC system.Due to a large amount of idle on change of current bus
Compensation equipment can not be cut off immediately, and direct current system will continue to converter station busbar charging.If the direct current system is stopped transport not in time, change
Stream will form higher overvoltage in station, seriously affect AC and DC equipment safety.
Last breaker protection mainly includes that the last breaker protection of lightning-arrest type and the last breaker of switch state type are protected
Protect two ways.Arrester energy consumption characteristics after the lightning-arrest last breaker Sustainable use failure of type occurs identify fault condition.
Therefore, which is a kind of protected mode of passive type.Arrester energy integral is more than that definite value needs take a certain time, this is just
Still the impact of high power overvoltage is born in meaning change of current station equipment in the meantime, and the lightning-arrest last breaker of type is protected
The action delay of shield is longer, and the impact that system equipment bears high power overvoltage is bigger.The last breaker of switch state type is protected
A kind of active protected mode using information anticipation fault condition before failure, change of current station equipment are not necessarily to bear the failure of certain time
It threatens.The last breaker protection of switch state type is sentenced in advance according to the switching-state information for the alternating-current field for uploading to pole control host
Which breaker that breaks is last breaker of the valve group to alternating current circuit.When protection system sends trip command to last breaker
When, it needs first to start the emergency outage order of DC converter station, corresponding valve group is stopped transport, then execute trip signal.
The alternating-current field of existing DC engineering is generally the exchanges of multiple 2/3 wiring in series and parallel between bus, in order to prevent
Overvoltage problem caused by last breaker mistrip, needs the switch state according to alternating-current field, judges last breaker.It is external
Electrical equipment manufacturer is studied in the early stage to be thought to exchange the switch state gone here and there where the last breaker of valve group only needs to consider valve group,
Unrelated with other strings, this mode has been found the incompleteness of decision logic, exists and fails to judge.There are mainly two types of technical sides at present
Method, the last breaker judgement for respectively judging automatically the method for last breaker logic based on matrixing and being overlapped based on path
Method.Wherein, the method that matrixing judges automatically last breaker logic searches for the last breaker of valve group by matrixing operation
Method it is complex, and low efficiency.Lead to the risk of last breaker actuation tripping, the prior art to avoid the occurrence of maloperation
Last breaker concordance list is devised, operations staff determines alternating-current field in the operation side by the call number of each operating condition of retrieval
Last breaker under formula.It is this by enumerating or the method flexibility of data statistics is poor, have exchange string enlarging or out of service
When whole table needs rewrite, heavy workload, and concordance list is filled in manually and is also easy to produce careless omission.
In addition, based on the last breaker judgment method that path is overlapped, this method is searched for by Depth Priority Algorithm
All paths between valve group and alternating current circuit, the breaker that frequency of occurrence is equal to number of passes are judged as last breaker.
This method to solve the problems, such as last breaker intelligent decision have certain reference value.But when valve group and alternating current circuit it
Between number of passes it is more when, based on path be overlapped last breaker judgment method calculation amount it is larger.Indeed, it is possible to search for
One shortest path, and the breaker on the shortest path is successively disconnected, then whether there is or not most short with valve group to alternating current circuit Rendezvous Point
Path is judgment basis, and the last breaker of real-time judge valve group improves operation judgement effect to reduce route searching item number
Rate.
Summary of the invention
In view of the above-mentioned problems, the purpose of the present invention is to provide a kind of last breakers of the valve group based on dijkstra's algorithm
Recognition methods can avoid enumerating the complicated cumbersome deterministic process of recognition methods, to improve last breaker recognition efficiency and accurate
Property.Technical solution is as follows:
A kind of last breaker recognition methods of valve group based on dijkstra's algorithm, comprising the following steps:
Step 1: alternating-current field is abstracted into Connected undigraph, by alternating-current field configuration determine the Connected undigraph vertex and
Side constructs alternating-current field adjacency matrix C；According to the real-time status of breaker in alternating-current field, alternating-current field adjacency matrix C is corrected；
Step 2: setting the route in alternating-current field and collect vertex as source point, some valve group vertex in alternating-current field is terminal, is led to
It crosses dijkstra's algorithm and obtains route and collect shortest path vertex set P between vertex and the valve group vertex；
Step 3: deleting the non-breaker vertex in step 2 in shortest path vertex set P；By shortest path vertex set
P and breaker vertex set U take intersection, obtain shortest path breaker vertex set V only comprising breaker vertexCB, i.e. VCB
=P ∩ U；
Step 4: judging shortest path breaker vertex set VCBIt whether is empty set；If the collection is combined into empty set, the valve
Group is without last breaker；Otherwise, 5 are entered step；
Step 5: successively by shortest path breaker vertex set VCBIn each vertex be set as opening state, according to breaker
Real-time status updates the adjacency matrix C of alternating-current field, continues searching route according still further to step 2 execution dijkstra's algorithm and collects vertex
To the shortest path of valve group；
Step 6: judgement is set as whether the vertex of opening state is last breaker: if route collects vertex to valve group vertex
Between there are shortest path, which is last breaker；Otherwise, this is set as the vertex of opening state not
It is last breaker；As shortest path breaker vertex set VCBWhen for sky, then judgement terminates；Otherwise, return step 5.
Further, the step 1 specifically:
Step 11: the main wiring diagram of alternating-current field is abstracted into Connected undigraph G=(V, E)；Wherein, V={ v1,v2,…,
vNIndicate alternating-current field Connected undigraph vertex set, N is number of vertices, which includes the route of alternating-current field, valve
Group, bus, interface point and breaker；E={ e1,e2,…,eEIndicate alternating-current field Connected undigraph line set, E be side item
It counts, is connected directly between two vertex in the element representation Connected undigraph in the line set；
Step 12: if having between two vertex in Connected undigraph connection and two vertex be closed state, while depositing
?；Otherwise, while being not present；Alternating current circuits all in alternating-current field are collected for a vertex, the connection relationship between each vertex is used
Adjacency matrix C is indicated:
Wherein, cijIndicate vertex viWith vertex vjBetween connection relationship, specific value are as follows:
Step 13: when side is closed state in Connected undigraph, i.e., the breaker connecting with the side is closed state, then
The value on the side remains unchanged in adjacency matrix；When side is in an open state in Connected undigraph, i.e., the breaker being connect with the side
It is in an open state, then the value on the side is revised as ∞ in adjacency matrix；
Wherein, cij' for according to the modified alternating-current field adjacency matrix element value of real-time status of breaker in alternating-current field.
Further, include: using the specific steps of dijkstra's algorithm search shortest path
Step 21: being the vertex set S and not yet determining shortest path for having acquired shortest path by vertex set V points
{ route collects vertex v by vertex set T, S=s, { route collects vertex v to T=t}；With apart from array D storage from source point to other
The current path length in vertex, D=C (vs)；Shortest path is recorded with array P；
Step 22: from apart from array D [vt] the middle lookup vertex v nearest apart from source pointk, set S is added from set T in it；
Step 23: with vertex vkFor intermediate point, if vertex v is passed through on source point vertex into set TkAfterwards than originally without top
Point vkIt is short, then modify distance, i.e. D [vt]=min { D [vt],D[k]+C(vk,vt), and modify P [vt] in path；
Step 24: repeating step 22,23, when searching vertex is valve group vertex, terminate search process；Otherwise, it searches
The remaining vertex being continued until in set T is all added in set S by rope process.
The beneficial effects of the present invention are: the present invention uses graph-theory techniques, by determining alternating-current field in DC transmission system
Alternating-current field is converted to Connected undigraph by vertex and side, provides a kind of alternating-current field, alternating-current field for being suitble to have the characteristics that different structure
Universal modeling method when changes of operating modes and DC engineering are extended；Last breaker recognition methods letter in the present invention
It is single, collect vertex to all paths between valve group vertex without traversing route, improves last breaker adaptive judgement
Operational efficiency.In conclusion the method for the present invention is simple and easy, the valve group adapted under different alternating-current field operating conditions is finally breaking
Device adaptive judgement, method are reliable effective, practical.
Detailed description of the invention
Fig. 1 is that the present invention is based on the flow charts of the last breaker recognition methods of the valve group of dijkstra's algorithm.
Fig. 2 is the electric main wiring diagram of alternating-current field of the present invention.
Specific embodiment
The present invention is described in further details in the following with reference to the drawings and specific embodiments.If Fig. 1 is shown institute of the present invention
The flow chart of the last breaker recognition methods of the valve group based on dijkstra's algorithm provided, includes the following steps:
Step 1: alternating-current field is abstracted into Connected undigraph, the vertex of the Connected undigraph is determined by the configuration of alternating-current field
And side, alternating-current field adjacency matrix is corrected according to the real-time status of breaker in alternating-current field, specific as follows:
S1, the main wiring diagram of alternating-current field is abstracted into Connected undigraph G=(V, E), wherein V={ v1,v2,…,vNTable
Show that the vertex set of alternating-current field Connected undigraph, N are number of vertices, which includes the route of alternating-current field, valve group, mother
Line, interface point and breaker；E={ e1,e2,…,eEIndicate alternating-current field Connected undigraph line set, E be side item number, should
It is connected directly between two vertex in element representation Connected undigraph in line set.
If having connection in s2, Connected undigraph between two vertex and the two vertex being closed state, side exists.
Otherwise, while being not present.It particularly points out, in addition to the state on the equivalent vertex of breaker is divided into closed state and off-state,
Remaining vertex is accordingly to be regarded as closed state.In order to simplify search process, alternating current circuits all in alternating-current field are collected for a vertex, respectively
Connection relationship between vertex can be indicated with adjacency matrix C:
Wherein, cijIndicate vertex viWith vertex vjBetween connection relationship, specific value are as follows:
Wherein, work as vertex viWith vertex vjWhen being connected directly, then element cij=1.Vertex viWith vertex vjFor the same vertex
When, i.e. i=j, then cij=0.Work as vertex viWith vertex vjWhen not being connected directly, element cij=∞.
S3, when in Connected undigraph side be closed state, i.e., the breaker connecting with the side is closed state, then abuts
The value on the side remains unchanged in matrix.When side is in an open state in Connected undigraph, i.e., the breaker connecting with the side is to beat
Open state, then the value on the side is revised as ∞ in adjacency matrix.
Wherein, cij' for according to the modified alternating-current field adjacency matrix element value of real-time status of breaker in alternating-current field.
Step 2: the route set in alternating-current field collects vertex as source point, some valve group vertex in alternating-current field is terminal, is led to
It crosses dijkstra's algorithm and obtains route and collect shortest path vertex set P between vertex and the valve group vertex, it is specific to search for
Process is as follows:
S1, vertex set V is divided to have acquired the vertex of the vertex set S of shortest path and not yet determining shortest path
Set T, with the path length current to other vertex from source point is stored apart from array D, P array records shortest path, and Matrix C is
The adjacency matrix for the real-time alternating-current field operation conditions of reflection that step 1 obtains.
S2, initialization, { route collects vertex v to S=s, { route collects vertex v to T=t, D=C (vs:), P array record
Shortest path.
S3, from apart from array D [vt] the middle lookup vertex v nearest apart from source pointk, set S is added from set T in it.
S4, with vertex vkFor intermediate point, if vertex v is passed through on source point vertex into TkAfterwards than originally without vertex vkIt is short, then
Modify distance, i.e. D [vt]=min { D [vt],D[k]+C(vk,vt), and modify P [vt] in path.
S5, step s3, s4 is repeated, when searching vertex is valve group vertex, terminates search process；Otherwise, it searched for
The remaining vertex being continued until in set T is all added in set S by journey.
Step 3: deleting the non-breaker vertex in step 2 in shortest path vertex set P.By shortest path vertex set
It closes P and breaker vertex set U takes intersection, obtain shortest path breaker vertex set V only comprising breaker vertexCB, i.e.,
VCB=P ∩ U.
Step 4: judging shortest path breaker vertex set VCBIt whether is empty set；If the collection is combined into empty set, the valve
Group is without last breaker；Otherwise, five are entered step.
Step 5: if shortest path breaker vertex set VCBVertex each in set is successively set as open shape by non-empty
State updates the adjacency matrix C of alternating-current field according to step 1 according to the real-time status of breaker, executes according still further to step 2
Dijkstra's algorithm continue searching route collect vertex to valve group shortest path；Step 6 is subsequently entered, judgement is set as opening
Whether the vertex of state is last breaker.
Step 6: if route collects vertex to there are shortest path, being set as opening in step 5 between valve group vertex
The vertex of state is last breaker, conversely, this vertex for being set as opening state is not last breaker.When shortest path is disconnected
Road device vertex set VCBWhen for sky, then judgement terminates；Otherwise, return step five.
Example: Fig. 2 provides the electric main wiring diagram of alternating-current field, which contains 2 valve groups P1 and P2,2 mothers
Breaker 5101 and 5102,5011~5073 be interval string breaker, and route is indicated with L1~L7, indicates AC line with T1~T9
Road or valve group and the intersection point for exchanging string.
DC engineering first stage of construction, only preceding 6 intervals string puts into operation in Fig. 2 alternating-current field, thus establishes the alternating-current field
Adjacency matrix C is as follows:
By dijkstra's algorithm obtain from valve group P1 to the shortest path vertex set of route Rendezvous Point L be P=P1,
T4,5033,B2,5013,T2,L}。
Thus the corresponding shortest path breaker vertex set U={ 5013,5033 } of the set is obtained.Successively by the set
In breaker setting be in an open state, and ranks element where will abut against in matrix the breaker sets 0, is calculated by Dijkstra
Method continues searching valve group P1 to the shortest path of route Rendezvous Point L, and according to whether there are path judge the breaker whether be
Last breaker, last breaker judging result are as shown in table 1.Valve group P2 processing mode is same as above.
The last breaker judging result of table 1
As can be seen from Table 1, after valve group P1 deletes the breaker vertex in shortest path breaker vertex set U, there are still
Valve group P1 collects the path of vertex L to route, i.e. still there are electrical links with extraneous alternating current circuit by valve group P1.Therefore in set U
The non-last breaker of breaker.It can similarly obtain, valve group P2 is also without last breaker.
It, need to be according to the same known top in increased vertex if the 7th article of interval string puts into operation in Fig. 2 when DC engineering enlarging
The connection relationship of point, and new ranks element is further added by last column and last line of alternating-current field adjacency matrix.In addition, working as
When a certain interval goes here and there out of service in alternating-current field, ranks element where the string element need to be set 0 from adjacency matrix.
When the alternating-current field method of operation changes, such as breaker 5013 in Fig. 2 alternating-current field, 5022,5023,5031,
5032,5042,5043,5052 are in an open state, remaining breaker is closed state.Under the method for operation, valve group P1 and
The last breaker search result of valve group P2 is as shown in table 2.
The last breaker judging result of table 2
After breaker 5033,5102,5051 is opened, valve group is collected vertex with alternating current circuit and is disconnected, and therefore, this 3
A breaker is last breaker.After breaker 5053,5061 is opened, valve group is collected vertex with alternating current circuit and is still connected
It connects, therefore the two breakers are not last breaker.
Claims (3)
1. a kind of last breaker recognition methods of valve group based on dijkstra's algorithm, which comprises the following steps:
Step 1: alternating-current field is abstracted into Connected undigraph, the vertex and side of the Connected undigraph are determined by the configuration of alternating-current field,
Construct alternating-current field adjacency matrix C；According to the real-time status of breaker in alternating-current field, alternating-current field adjacency matrix C is corrected；
Step 2: setting the route in alternating-current field and collect vertex as source point, some valve group vertex in alternating-current field is terminal, is passed through
Dijkstra's algorithm obtains route and collects shortest path vertex set P between vertex and the valve group vertex；
Step 3: deleting the non-breaker vertex in step 2 in shortest path vertex set P；By shortest path vertex set P with
Breaker vertex set U takes intersection, obtains shortest path breaker vertex set V only comprising breaker vertexCB, i.e. VCB=P
∩U；
Step 4: judging shortest path breaker vertex set VCBIt whether is empty set；If the collection is combined into empty set, the valve group without
Last breaker；Otherwise, 5 are entered step；
Step 5: successively by shortest path breaker vertex set VCBIn each vertex be set as opening state, according to the real-time of breaker
State updates the adjacency matrix C of alternating-current field, executes dijkstra's algorithm according still further to step 2 and continues searching, obtains route and collect top
Point arrives the shortest path on valve group vertex；
Step 6: judgement is set as whether the vertex of opening state is last breaker: if route collects vertex between valve group vertex
There are shortest paths, which is last breaker；Otherwise, which is not most
Breaker afterwards；As shortest path breaker vertex set VCBWhen for sky, then judgement terminates；Otherwise, return step 5.
2. the last breaker recognition methods of the valve group according to claim 1 based on dijkstra's algorithm, which is characterized in that
The step 1 specifically:
Step 11: the main wiring diagram of alternating-current field is abstracted into Connected undigraph G=(V, E)；Wherein, V={ v1,v2,…,vNTable
Show that the vertex set of alternating-current field Connected undigraph, N are number of vertices, which includes the route of alternating-current field, valve group, mother
Line, interface point and breaker；E={ e1,e2,…,eEIndicate alternating-current field Connected undigraph line set, E be side item number, should
It is connected directly between two vertex in element representation Connected undigraph in line set；
Step 12: if having connection in Connected undigraph between two vertex and two vertex are closed state, side exists；It is no
Then, while being not present；Alternating current circuits all in alternating-current field are collected for a vertex, the adjacent square of the connection relationship between each vertex
Battle array C is indicated:
Wherein, cijIndicate vertex viWith vertex vjBetween connection relationship, specific value are as follows:
Step 13: when side is closed state in Connected undigraph, i.e., the breaker connecting with the side is closed state, then abuts
The value on the side remains unchanged in matrix；When side is in an open state in Connected undigraph, i.e., the breaker connecting with the side is to beat
Open state, then the value on the side is revised as ∞ in adjacency matrix；
Wherein, cij' for according to the modified alternating-current field adjacency matrix element value of real-time status of breaker in alternating-current field.
3. the last breaker recognition methods of the valve group according to claim 2 based on dijkstra's algorithm, which is characterized in that
Include: using the specific steps that dijkstra's algorithm searches for shortest path
Step 21: being the vertex for having acquired the vertex set S and not yet determining shortest path of shortest path by vertex set V points
{ route collects vertex v by set T, S=s, { route collects vertex v to T=t}；It is stored with apart from array D from source point to other vertex
Current path length, D=C (vs)；Shortest path is recorded with array P；
Step 22: from apart from array D [vt] the middle lookup vertex v nearest apart from source pointk, set S is added from set T in it；
Step 23: with vertex vkFor intermediate point, if vertex v is passed through on source point vertex into set TkAfterwards than originally without vertex vk
It is short, then modify distance, i.e. D [vt]=min { D [vt],D[k]+C(vk,vt), and modify P [vt] in path；
Step 24: repeating step 22,23, when searching vertex is valve group vertex, terminate search process；Otherwise, it searched for
The remaining vertex being continued until in set T is all added in set S by journey.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910474535.5A CN110137911B (en) | 2019-06-03 | 2019-06-03 | Valve group final circuit breaker identification method based on Dijkstra algorithm |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910474535.5A CN110137911B (en) | 2019-06-03 | 2019-06-03 | Valve group final circuit breaker identification method based on Dijkstra algorithm |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110137911A true CN110137911A (en) | 2019-08-16 |
| CN110137911B CN110137911B (en) | 2021-01-29 |
Family
ID=67579824
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910474535.5A Active CN110137911B (en) | 2019-06-03 | 2019-06-03 | Valve group final circuit breaker identification method based on Dijkstra algorithm |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110137911B (en) |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105514940A (en) * | 2015-11-24 | 2016-04-20 | 许继电气股份有限公司 | Adaptive discrimination method and apparatus for valve block last breaker of extra-high-voltage converter station |
| CN106300299A (en) * | 2016-09-23 | 2017-01-04 | 许继电气股份有限公司 | A kind of alternating-current field last chopper determination methods relating to bus connection switch and device |
| CN106529030A (en) * | 2016-11-09 | 2017-03-22 | 中国南方电网有限责任公司超高压输电公司检修试验中心 | Boundary searching method of last circuit breaker |
| CN106990354A (en) * | 2017-05-27 | 2017-07-28 | 西安科技大学 | A kind of trip breaker self-adapted search method based on dijkstra's algorithm |
| CN108062592A (en) * | 2016-11-08 | 2018-05-22 | 上海宝通汎球电子有限公司 | The optimization algorithm of optimal path is asked for reference to dijkstra's algorithm and A* algorithms |
| CN108572303A (en) * | 2018-04-25 | 2018-09-25 | 西南交通大学 | A kind of distribution network fault line selection method based on random matrix and Hausdorff distances |
-
2019
- 2019-06-03 CN CN201910474535.5A patent/CN110137911B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105514940A (en) * | 2015-11-24 | 2016-04-20 | 许继电气股份有限公司 | Adaptive discrimination method and apparatus for valve block last breaker of extra-high-voltage converter station |
| CN106300299A (en) * | 2016-09-23 | 2017-01-04 | 许继电气股份有限公司 | A kind of alternating-current field last chopper determination methods relating to bus connection switch and device |
| CN108062592A (en) * | 2016-11-08 | 2018-05-22 | 上海宝通汎球电子有限公司 | The optimization algorithm of optimal path is asked for reference to dijkstra's algorithm and A* algorithms |
| CN106529030A (en) * | 2016-11-09 | 2017-03-22 | 中国南方电网有限责任公司超高压输电公司检修试验中心 | Boundary searching method of last circuit breaker |
| CN106990354A (en) * | 2017-05-27 | 2017-07-28 | 西安科技大学 | A kind of trip breaker self-adapted search method based on dijkstra's algorithm |
| CN108572303A (en) * | 2018-04-25 | 2018-09-25 | 西南交通大学 | A kind of distribution network fault line selection method based on random matrix and Hausdorff distances |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110137911B (en) | 2021-01-29 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| AU2021203476B2 (en) | Nested microgrid control system | |
| EP0957555B1 (en) | Electric power system protection and control system | |
| CN110110856B (en) | Power grid fault diagnosis method and system based on multi-source information deep reasoning | |
| CN105762772B (en) | A kind of method for identifying bus differential region | |
| CN111428376A (en) | CIM (common information model) -based power distribution network feeder contact mode identification method and system | |
| CN101251835A (en) | Method for evaluating reliability of +/- 800kV current exchanging station main wire connection | |
| CN107846015B (en) | Intelligent power distribution network load transfer optimal path selection method based on peer-to-peer communication | |
| CN106300299A (en) | A kind of alternating-current field last chopper determination methods relating to bus connection switch and device | |
| CN110137939A (en) | A kind of substation's full cut-off load transfer method | |
| CN106549367B (en) | A kind of differential protection method for bus and device for mother CT exception | |
| CN106463950A (en) | Dc grid protection method and system thereof | |
| CN107846002B (en) | A method of utilizing fast breaker limiting short-circuit current | |
| CN109473974A (en) | A kind of power grid regulation operation self-adapting program operating method and system | |
| CN105391030B (en) | The plan isolated island division methods of polymerization are gradually loaded based on network topology structure load | |
| CN111342455A (en) | Method for switching 10kV line ring network into power supply | |
| CN110137911A (en) | A kind of last breaker recognition methods of valve group based on dijkstra's algorithm | |
| CN106990354B (en) | A kind of trip breaker self-adapted search method based on dijkstra's algorithm | |
| CN110112697A (en) | A kind of electric network fault partition method based on breadth-first search | |
| CN106451444B (en) | A kind of power grid cascading failure accident chaining search method considering removal of load and coupling | |
| CN110048385B (en) | Floyd-Warshall algorithm-based regional power grid fault isolation method | |
| CN105186464B (en) | One kind 3/2 switchs main electrical scheme breaker fail protection method | |
| CN108416689B (en) | Universal method for automatically generating operation order task | |
| CN109659913B (en) | Last circuit breaker identification method based on virtual circuit network | |
| CN108666986B (en) | A kind of high voltage direct current exchange field device connected trouble method of discrimination based on connected graph | |
| CN113013871A (en) | Load transfer method for power distribution network equipment during fault and maintenance |
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 |