CN110137911B - Valve group final circuit breaker identification method based on Dijkstra algorithm - Google Patents
Valve group final circuit breaker identification method based on Dijkstra algorithm Download PDFInfo
- Publication number
- CN110137911B CN110137911B CN201910474535.5A CN201910474535A CN110137911B CN 110137911 B CN110137911 B CN 110137911B CN 201910474535 A CN201910474535 A CN 201910474535A CN 110137911 B CN110137911 B CN 110137911B
- Authority
- CN
- China
- Prior art keywords
- vertex
- breaker
- shortest path
- alternating current
- 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.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 39
- 239000011159 matrix material Substances 0.000 claims abstract description 27
- 238000010586 diagram Methods 0.000 claims description 8
- 238000004891 communication Methods 0.000 claims description 4
- 230000005540 biological transmission Effects 0.000 description 3
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000005265 energy consumption Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000009413 insulation Methods 0.000 description 1
- 239000004576 sand Substances 0.000 description 1
- 238000010845 search algorithm Methods 0.000 description 1
Images
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 invention discloses a valve group final breaker identification method based on Dijkstra algorithm, which is characterized in that an adjacent matrix is constructed by abstracting an alternating current field into a directionless connected graph according to a topological structure of the alternating current field; updating an adjacency matrix according to the on-off state of the circuit breaker of the alternating current field acquired in real time, and converting the final judgment problem of the circuit breaker into a Dijkstra algorithm to solve the problem of the shortest path from the vertex of the valve bank to the vertex of the alternating current line collection; when a certain breaker vertex on the path is set to be in an open state, continuously searching a valve bank vertex to an AC line collection vertex, and if a path exists between the valve bank vertex and the AC line collection vertex, determining the vertex as a final breaker; otherwise, the vertex is not the last breaker. The method is simple and effective, can judge the last circuit breaker of the valve group in real time when the operation mode of the AC field changes, does not need to prepare the last circuit breaker retrieval table of all the operation states of the AC field in advance, and has good flexibility and universality.
Description
Technical Field
The invention relates to the technical field, in particular to a valve group final breaker identification method based on a Dijkstra algorithm.
Background
The last circuit breaker of the converter station of the direct current transmission system is a key circuit breaker for connecting the direct current valve group with the alternating current transmission line, and the final circuit breaker mainly prevents overvoltage of the converter station caused by sudden load shedding of the converter station. The problem of insulation matching caused by overvoltage is one of the problems that the safe operation of the alternating current-direct current hybrid system must be considered seriously. The last circuit breaker is a key circuit breaker for connecting the direct current system and the alternating current system, and the tripping of the last circuit breaker can cause the disconnection of the direct current system and the alternating current system. Because a large amount of reactive compensation equipment on the converter bus cannot be cut off immediately, the direct current system can continue to charge the converter station bus. If the direct current system is not stopped in time, high overvoltage is formed in the converter station, and the safety of alternating current and direct current equipment is seriously influenced.
The final breaker protection mainly comprises two modes of lightning arrester type final breaker protection and switch state type final breaker protection. The lightning arrester type final breaker protection utilizes the energy consumption characteristic of the lightning arrester after the fault occurs to identify the fault condition. Therefore, the protection is a passive protection mode. It takes a certain time for the energy integral of the arrester to exceed a fixed value, which means that the equipment of the converter station still has to bear the impact of high-power overvoltage in the period, and the longer the action delay of the arrester type final breaker protection is, the greater the impact of high-power overvoltage is borne by the system equipment. The switch state type final breaker protection is an active protection mode for pre-judging the fault condition by utilizing the information before the fault, and converter station equipment does not need to bear fault threat for a certain time. And (4) protecting the final breaker in a switch state type, and judging which breakers are the last breakers from the valve bank to the AC line in advance according to the switch state information of the AC field uploaded to the pole control host. When the protection system sends a tripping command to the last breaker, an emergency shutdown command of the direct current converter station needs to be started first, the corresponding valve group is shut down, and then the tripping command is executed.
In an ac field of the existing dc engineering, a plurality of 2/3 connected ac lines are generally connected in series and parallel between buses, and in order to prevent an overvoltage problem caused by the false tripping of a final breaker, the final breaker needs to be determined according to the switching state of the ac field. In the initial research of foreign electrical equipment manufacturers, the final breaker of the valve group only needs to consider the switching state of an alternating current string where the valve group is located, and the method is irrelevant to other strings, and the method is proved to judge the incompleteness of logic and has the defect of missing judgment. At present, there are two main technical methods, namely a method for automatically judging the logic of the last circuit breaker based on matrixing and a method for judging the last circuit breaker based on path coincidence. The method for automatically judging the logic of the last circuit breaker in the matrixing mode is complex and low in efficiency. In order to avoid the risk of action tripping of the last circuit breaker caused by misoperation, the prior art designs a last circuit breaker index table, and an operator determines the last circuit breaker of an alternating current field in the operation mode by retrieving the index number of each working condition. The method through enumeration or data statistics has poor flexibility, the whole table needs to be refilled when an exchange string is expanded or the operation is quitted, the workload is large, and omission is easily caused when an index table is manually filled.
In addition, according to the path coincidence-based final breaker judgment method, all paths between the valve bank and the alternating current line are searched through a depth-first search algorithm, and the breaker with the occurrence frequency equal to the number of the paths is judged as the final breaker. The method has a certain reference value for solving the problem of intelligent judgment of the final breaker. However, when the number of paths between the valve block and the ac line is large, the amount of calculation of the final breaker determination method based on the path overlapping is large. In fact, a shortest path can be searched, the circuit breakers on the shortest path can be disconnected in sequence, and the last circuit breaker of the valve bank can be judged in real time by taking whether the shortest path exists from the valve bank to the alternating current line collection point as a judgment basis, so that the number of path searching is reduced, and the operation judgment efficiency is improved.
Disclosure of Invention
In view of the above problems, an object of the present invention is to provide a valve group final breaker identification method based on Dijkstra algorithm, which can avoid a complicated judgment process of an enumeration identification method, so as to improve final breaker identification efficiency and accuracy. The technical scheme is as follows:
a valve group final breaker identification method based on Dijkstra algorithm comprises the following steps:
step 1: abstracting the alternating current field into a non-directional connected graph, determining the vertex and the edge of the non-directional connected graph according to the configuration of the alternating current field, and constructing an alternating current field adjacency matrix C; correcting the adjacent matrix C of the alternating current field according to the real-time state of the circuit breaker in the alternating current field;
step 2: setting a line collection vertex in an alternating current field as a source point and a certain valve group vertex in the alternating current field as a destination point, and obtaining a shortest path vertex set P between the line collection vertex and the valve group vertex through a Dijkstra algorithm;
and step 3: deleting the non-breaker vertexes in the shortest path vertex set P in the step 2; the shortest path vertex set P and the breaker vertex set U are intersected to obtain a shortest path breaker vertex set V only containing breaker vertexesCBI.e. VCB＝P∩U；
And 4, step 4: judging the shortest path breaker peak set VCBWhether the set is an empty set; if the set is an empty set, the valve bank has no last circuit breaker; otherwise, entering step 5;
and 5: sequentially collecting vertexes V of shortest path breakerCBThe middle vertexes are set to be in an open state, and the adjacent moment of the alternating current field is updated according to the real-time state of the breakerC, according to the step 2, executing Dijkstra algorithm to continuously search the shortest path from the line collection vertex to the valve group;
step 6: judging whether the vertex set to be in an open state is the last breaker: if the shortest path exists between the line collection vertex and the valve group vertex, the vertex set to be in an open state is the last breaker; otherwise, the vertex set to the open state is not the last breaker; set V of breaker vertexes in shortest pathCBIf the time is empty, the judgment is finished; otherwise, return to step 5.
Further, the step 1 specifically comprises:
step 11: abstracting a main wiring diagram of the alternating-current field into a non-directional connected diagram G (V, E); wherein V ═ { V ═ V1,v2,…,vNThe vertex set of the undirected communication graph of the alternating current field is represented, N is the number of the vertices, and the vertex set comprises lines, valve banks, buses, junction points and circuit breakers of the alternating current field; e ═ E1,e2,…,eLThe method comprises the steps that (1) an edge set of an alternating-current field undirected connected graph is represented, L is the number of edges, and elements in the edge set represent that two vertexes in the undirected connected graph are directly connected;
step 12: if connection exists between two vertexes in the undirected connected graph and the two vertexes are in a closed state, an edge exists; otherwise, the edge does not exist; all the AC lines in the AC field are collected into a vertex, and the connection relationship between the vertexes is represented by an adjacency matrix C:
wherein, cijRepresenting a vertex viAnd vertex vjThe specific values of the connection relationship are as follows:
step 13: when the edge in the undirected connected graph is in a closed state, namely all the circuit breakers connected with the edge are in a closed state, the value of the edge in the adjacent matrix is kept unchanged; when the edge in the undirected connected graph is in an open state, namely a breaker connected with the edge is in an open state, the value of the edge in the adjacent matrix is modified to be infinity;
wherein, cij' is the value of the ac field adjacency matrix element modified according to the real-time status of the circuit breaker in the ac field.
Further, the specific step of searching the shortest path by using Dijkstra algorithm includes:
step 21: dividing the vertex set V into a vertex set S with the shortest path obtained and a vertex set T with the shortest path not determined, wherein S is the vertex V with the shortest path obtainedsWhere S is { vertex v of the shortest path has already been found }, S ═ vs}; storing Slave vertices v with distance array DsCurrent path length to other vertices, D ═ C (v)s) (ii) a Recording the shortest path by using an array P;
step 22: finding distance vertex v from distance array DsNearest vertex vkAdding it from set T to set S;
step 23: by vertex vkIs the middle point, if the vertex vsTo the vertex in the set T through the vertex vkLater than original without passing through vertex vkShort, the distance is modified, i.e. D [ v ]t]＝min{D[vt],D[vk]+C(vk,vt) And modifying the path in the P;
step 24: repeating the steps 22 and 23 until the vertex is the valve group vertex, and terminating the searching process; otherwise, the search process will continue until all of the remaining vertices in set T are added to set S.
The invention has the beneficial effects that: the invention adopts graph theory technology, and converts an alternating current field into a non-directional connected graph by determining the vertex and the edge of the alternating current field in a direct current transmission system, thereby providing a universal modeling method suitable for the alternating current field with different structural characteristics, the change of the running mode of the alternating current field and the extension of direct current engineering; the method for identifying the final breaker is simple, all paths from the line collection vertex to the valve group vertex do not need to be traversed, and the operation efficiency of the self-adaptive judgment of the final breaker is improved. In conclusion, the method is simple and feasible, can adapt to the valve bank final breaker self-adaptive judgment under different alternating current field operation conditions, and is reliable, effective and strong in practicability.
Drawings
Fig. 1 is a flowchart of a valve group final breaker identification method based on Dijkstra algorithm according to the present invention.
Fig. 2 is a diagram of the electrical main connection of an ac field of the present invention.
Detailed Description
The invention is described in further detail below with reference to the figures and specific embodiments. Fig. 1 is a flowchart of a valve group final breaker identification method based on Dijkstra algorithm provided by the present invention, and the method includes the following steps:
step one, abstracting an alternating current field into a non-directional connected graph, determining the top point and the edge of the non-directional connected graph according to the configuration of the alternating current field, and correcting an adjacent matrix of the alternating current field according to the real-time state of a breaker in the alternating current field, wherein the concrete steps are as follows:
s1, abstracting the main wiring diagram of the AC field into a non-directional communication diagram G ═ (V, E), wherein V ═ { V ═ E1,v2,…,vNThe vertex set of the undirected communication graph of the alternating current field is represented, N is the number of the vertices, and the vertex set comprises lines, valve banks, buses, junction points and circuit breakers of the alternating current field; e ═ E1,e2,…,eLAnd (4) representing an edge set of the undirected connected graph of the alternating-current field, wherein L is the number of the edges, and elements in the edge set represent that two vertexes in the undirected connected graph are directly connected.
s2, if there is a connection between two vertices in the undirected connected graph and both vertices are in a closed state, an edge exists. Otherwise, the edge does not exist. It is particularly noted that the vertices of the circuit breaker equivalent are considered to be in the closed state, except that the states of the vertices are classified into the closed state and the open state. To simplify the search process, all ac lines in the ac field are collected as one vertex, and the connection relationship between vertices can be represented by an adjacency matrix C:
wherein, cijRepresenting a vertex viAnd vertex vjThe specific values of the connection relationship are as follows:
wherein, when the vertex v isiAnd vertex vjWhen directly connected, then element cij1. Vertex viAnd vertex vjWhen the same vertex is used, i equals j, then cij0. When the vertex v isiAnd vertex vjWhen not directly connected, the element cij＝∞。
s3, when the side in the undirected connectivity graph is in a closed state, that is, the breakers connected to the side are in a closed state, the value of the side in the adjacency matrix remains unchanged. When the edge in the undirected connected graph is in an open state, namely the breaker connected with the edge is in an open state, the value of the edge in the adjacent matrix is modified to be infinity.
Wherein, cij' is the value of the ac field adjacency matrix element modified according to the real-time status of the circuit breaker in the ac field.
Step two, setting a line collection vertex in the alternating current field as a source point and a certain valve group vertex in the alternating current field as a destination point, and obtaining a shortest path vertex set P between the line collection vertex and the valve group vertex through a Dijkstra algorithm, wherein the specific search process is as follows:
s1, dividing the vertex set V into a vertex set S for which the shortest path has been found and a vertex set T for which the shortest path has not been determined, and storing the vertex set V by a distance array DsTo other vertexAnd D, recording the shortest path by using the P array according to the previous path length, wherein the matrix C is an adjacent matrix which is obtained in the step one and reflects the running condition of the real-time alternating current field.
S2, initialization, S ═ vertex v for which shortest path has been foundsT ═ T { vertex v for which shortest path has not been determined yett}，D＝C(vsAnd (b) recording the shortest path by the P array.
s3 finding distance vertex v from distance array DsNearest vertex vkIt is added from set T to set S.
s4, at vertex vkIs the middle point, if the vertex vsTo T middle vertex through vertex vkLater than original without passing through vertex vkShort, the distance is modified, i.e. D [ v ]t]＝min{D[vt],D[vk]+C(vk,vt) And modify the path in P.
s5, repeating the steps s3 and s4 until the vertex is the valve group vertex, and terminating the searching process; otherwise, the search process will continue until all of the remaining vertices in set T are added to set S.
And step three, deleting the non-breaker vertexes in the shortest path vertex set P in the step two. The shortest path vertex set P and the breaker vertex set U are intersected to obtain a shortest path breaker vertex set V only containing breaker vertexesCBI.e. VCB＝P∩U。
Step four, judging the peak set V of the breaker with the shortest pathCBWhether the set is an empty set; if the set is an empty set, the valve bank has no last circuit breaker; otherwise, go to step five.
Step five, if the shortest path breaker vertex set VCBIf not, sequentially setting all vertexes in the set to be in an open state, updating an adjacent matrix C of the alternating current field according to the real-time state of the breaker in the first step, and then continuously searching the shortest path from the line collection vertex to the valve bank according to the Dijkstra algorithm in the second step; next, the process proceeds to step six, and it is determined whether or not the vertex set to the open state is the last breaker.
Step six, if the circuit is stored between the line collection vertex and the valve group vertexIn the shortest path, the vertex set to the open state in step five is the last breaker, whereas the vertex set to the open state is not the last breaker. Set V of breaker vertexes in shortest pathCBIf the time is empty, the judgment is finished; otherwise, returning to the step five.
Example (c): fig. 2 shows an electrical main connection diagram of an ac farm, which includes 2 valve blocks P1 and P2, 2 buscouple breakers 5101 and 5102, 5011 to 5073 as bay string breakers, lines denoted by L1 to L7, and points of intersection of ac lines or valve blocks and ac strings denoted by T1 to T9.
In the initial stage of the dc engineering construction, only the first 6 intervals in the ac field of fig. 2 are put into operation, and thereby an adjacent matrix C of the ac field is established as follows:
the Dijkstra algorithm is used to obtain the set of shortest path vertices from the valve block P1 to the line collection point L as P ═ P1, T4,5033, B2,5013, T2, L.
This results in the shortest path breaker vertex set U corresponding to this set being {5013,5033 }. Setting the breakers in the set to be in an open state, setting row and column elements where the breakers are located in the adjacent matrix to be 0, continuously searching the shortest path from the valve group P1 to the line collection point L through a Dijkstra algorithm, and judging whether the breaker is the last breaker according to whether a path exists, wherein the judgment result of the last breaker is shown in table 1. Valve block P2 is processed in the same manner as above.
TABLE 1 Final Circuit breaker determination
As can be seen from table 1, after the valve group P1 deletes the breaker vertex in the shortest path breaker vertex set U, there is still a path from the valve group P1 to the line collection vertex L, i.e. the valve group P1 is still in electrical contact with the external ac line. So none of the breakers in the set U is the last breaker. Likewise, valve block P2 has no final circuit breaker.
When the direct current project is expanded, as the 7 th interval string in fig. 2 is put into operation, new row and column elements are added to the last column and the last row of the adjacent matrix of the alternating current field according to the connection relationship between the added vertex and the known vertex. In addition, when a certain interval string in the alternating current field is out of operation, the row and column elements where the string element is located are set to 0 from the adjacent matrix.
When the operation mode of the ac field is changed, as shown in fig. 2, the circuit breakers 5013, 5022, 5023, 5031, 5032, 5042, 5043 and 5052 in the ac field are in an open state, and the rest of the circuit breakers are in a closed state. In this mode of operation, the final breaker search results for the valve block P1 and the valve block P2 are shown in table 2.
TABLE 2 Final Circuit breaker determination
When the circuit breakers 5033, 5102, 5051 are opened, the valve block is disconnected from the ac line sink vertex, so these 3 circuit breakers are the last circuit breakers. After the circuit breakers 5053, 5061 are opened, the valve block remains connected to the ac line collection apex, so neither circuit breaker is the last circuit breaker.
Claims (3)
1. A valve group final breaker identification method based on Dijkstra algorithm is characterized by comprising the following steps:
step 1: abstracting the alternating current field into a non-directional connected graph, determining the vertex and the edge of the non-directional connected graph according to the configuration of the alternating current field, and constructing an alternating current field adjacency matrix C; correcting the adjacent matrix C of the alternating current field according to the real-time state of the circuit breaker in the alternating current field;
step 2: setting a line collection vertex in an alternating current field as a source point and a certain valve group vertex in the alternating current field as a destination point, and obtaining a shortest path vertex set P between the line collection vertex and the valve group vertex through a Dijkstra algorithm;
and step 3: deleting from the shortest path vertex set P in step 2A non-breaker vertex; the shortest path vertex set P and the breaker vertex set U are intersected to obtain a shortest path breaker vertex set V only containing breaker vertexesCBI.e. VCB＝P∩U；
And 4, step 4: judging the shortest path breaker peak set VCBWhether the set is an empty set; if the set is an empty set, the valve bank has no last circuit breaker; otherwise, entering step 5;
and 5: sequentially collecting vertexes V of shortest path breakerCBSetting each vertex in the three-dimensional space as an open state, updating an adjacent matrix C of the alternating current field according to the real-time state of the breaker, and then executing Dijkstra algorithm to continue searching according to the step 2 to obtain the shortest path from the line collection vertex to the valve group vertex;
step 6: judging whether the vertex set to be in an open state is the last breaker: if the shortest path exists between the line collection vertex and the valve group vertex, the vertex set to be in an open state is the last breaker; otherwise, the vertex set to the open state is not the last breaker; set V of breaker vertexes in shortest pathCBIf the time is empty, the judgment is finished; otherwise, return to step 5.
2. The Dijkstra algorithm-based valve group final breaker identification method according to claim 1, wherein the step 1 specifically comprises:
step 11: abstracting a main wiring diagram of the alternating-current field into a non-directional connected diagram G (V, E); wherein V ═ { V ═ V1,v2,…,vNThe vertex set of the undirected communication graph of the alternating current field is represented, N is the number of the vertices, and the vertex set comprises lines, valve banks, buses, junction points and circuit breakers of the alternating current field; e ═ E1,e2,…,eLThe method comprises the steps that (1) an edge set of an alternating-current field undirected connected graph is represented, L is the number of edges, and elements in the edge set represent that two vertexes in the undirected connected graph are directly connected;
step 12: if connection exists between two vertexes in the undirected connected graph and the two vertexes are in a closed state, an edge exists; otherwise, the edge does not exist; all the AC lines in the AC field are collected into a vertex, and the connection relationship between the vertexes is represented by an adjacency matrix C:
wherein, cijRepresenting a vertex viAnd vertex vjThe specific values of the connection relationship are as follows:
step 13: when the edge in the undirected connected graph is in a closed state, namely all the circuit breakers connected with the edge are in a closed state, the value of the edge in the adjacent matrix is kept unchanged; when the edge in the undirected connected graph is in an open state, namely a breaker connected with the edge is in an open state, the value of the edge in the adjacent matrix is modified to be infinity;
wherein, cij' is the value of the ac field adjacency matrix element modified according to the real-time status of the circuit breaker in the ac field.
3. The Dijkstra algorithm-based valve group final breaker identification method according to claim 2, wherein the specific step of searching for the shortest path using Dijkstra algorithm comprises:
step 21: dividing the vertex set V into a vertex set S with the shortest path obtained and a vertex set T with the shortest path not determined, wherein S is the vertex V with the shortest path obtainedsT ═ T { vertex v for which shortest path has not been determined yett}; storing Slave vertices v with distance array DsCurrent path length to other vertices, D ═ C (v)s) (ii) a Recording the shortest path by using an array P;
step 22: finding distance vertex v from distance array DsMore recently, the development of new and more recently developed devicesVertex v ofkAdding it from set T to set S;
step 23: by vertex vkIs the middle point, if the vertex vsTo the vertex in the set T through the vertex vkLater than original without passing through vertex vkShort, the distance is modified, i.e. D [ v ]t]＝min{D[vt],D[vk]+C(vk,vt) And modifying the path in the P;
step 24: repeating the steps 22 and 23 until the vertex is the valve group vertex, and terminating the searching process; otherwise, the search process will continue until all of the remaining vertices in set T are added to set S.
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 CN110137911A (en) | 2019-08-16 |
| CN110137911B true 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 (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| 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 |
| CN108572303A (en) * | 2018-04-25 | 2018-09-25 | 西南交通大学 | A kind of distribution network fault line selection method based on random matrix and Hausdorff distances |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105514940B (en) * | 2015-11-24 | 2017-12-26 | 许继电气股份有限公司 | The adaptive method of discrimination of the last breaker of ultra-high voltage converter station valve group 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 |
| CN106529030B (en) * | 2016-11-09 | 2019-06-28 | 中国南方电网有限责任公司超高压输电公司检修试验中心 | The border search method of last breaker |
| CN106990354B (en) * | 2017-05-27 | 2019-03-19 | 西安科技大学 | A kind of trip breaker self-adapted search method based on dijkstra's algorithm |
-
2019
- 2019-06-03 CN CN201910474535.5A patent/CN110137911B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| 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 |
| 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 |
|---|---|
| CN110137911A (en) | 2019-08-16 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110994612B (en) | Power distribution network fault rapid recovery method based on network topology partition layering | |
| CN112507552A (en) | Power network vulnerability assessment method based on multiple attack strategies | |
| WO2015078172A1 (en) | Method for multi-fault power restoration of power distribution network | |
| CN108152663A (en) | A kind of electrical power distribution network fault location method and device | |
| CN103138227B (en) | Power distribution network fast power restoration method containing distributed power connected grid | |
| CN107769191A (en) | key transmission cross-section automatic identifying method based on network topology and flow data | |
| CN110350511B (en) | Power distribution network fault recovery method based on transfer power affinity | |
| CN103577896B (en) | A kind of region partitioning method of large scale electric network adaptive setting | |
| CN106300299A (en) | A kind of alternating-current field last chopper determination methods relating to bus connection switch and device | |
| CN110350522A (en) | A kind of electric system vulnerable line identifying method based on Weighted H index | |
| CN104750878A (en) | Mixed searching strategy-based topology fault diagnosis method | |
| CN114744616A (en) | Power recovery auxiliary decision-making method for power distribution network | |
| CN110112697B (en) | Power grid fault isolation method based on breadth-first search algorithm | |
| CN113507116B (en) | Power distribution network load transfer method, device, equipment and storage medium | |
| CN110135109B (en) | Direct-current system multi-valve-group last circuit breaker identification method based on improved Tarjan algorithm | |
| CN116500385A (en) | Power transmission network monitoring and checking method, device, equipment and medium | |
| CN110137911B (en) | Valve group final circuit breaker identification method based on Dijkstra algorithm | |
| CN110571802A (en) | Power distribution network self-healing control method and device based on rough set dynamic planning model | |
| CN116667336A (en) | Method, system and electronic equipment for evaluating information network nodes of photovoltaic power distribution network in transformer area | |
| CN107302208A (en) | A kind of coalmine high-voltage power network quick-break sets verified in parallel method | |
| CN106990354B (en) | A kind of trip breaker self-adapted search method based on dijkstra's algorithm | |
| Hor et al. | Extracting knowledge from substations for decision support | |
| CN106451444B (en) | A kind of power grid cascading failure accident chaining search method considering removal of load and coupling | |
| CN115879271A (en) | Power grid cut set type key power transmission section searching method based on cut set section tree | |
| CN115577292A (en) | Vulnerable line identification method based on abstract dual network and cascading failure super network |
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 | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20240619 Address after: 230000 b-1018, Woye Garden commercial office building, 81 Ganquan Road, Shushan District, Hefei City, Anhui Province Patentee after: HEFEI WISDOM DRAGON MACHINERY DESIGN Co.,Ltd. Country or region after: China Address before: 610031 science and technology division, Southwest Jiao Tong University, 111 north section of two ring road, Sichuan, Chengdu Patentee before: SOUTHWEST JIAOTONG University Country or region before: China |
|
| TR01 | Transfer of patent right |