CN110763953A - Troubleshooting line patrol path planning method under distribution automation condition - Google Patents
Troubleshooting line patrol path planning method under distribution automation condition Download PDFInfo
- Publication number
- CN110763953A CN110763953A CN201911045608.5A CN201911045608A CN110763953A CN 110763953 A CN110763953 A CN 110763953A CN 201911045608 A CN201911045608 A CN 201911045608A CN 110763953 A CN110763953 A CN 110763953A
- Authority
- CN
- China
- Prior art keywords
- node
- fault
- line
- matrix
- nodes
- 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
Images
Classifications
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01R—MEASURING ELECTRIC VARIABLES; MEASURING MAGNETIC VARIABLES
- G01R31/00—Arrangements for testing electric properties; Arrangements for locating electric faults; Arrangements for electrical testing characterised by what is being tested not provided for elsewhere
- G01R31/08—Locating faults in cables, transmission lines, or networks
- G01R31/081—Locating faults in cables, transmission lines, or networks according to type of conductors
- G01R31/085—Locating faults in cables, transmission lines, or networks according to type of conductors in power transmission or distribution lines, e.g. overhead
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01R—MEASURING ELECTRIC VARIABLES; MEASURING MAGNETIC VARIABLES
- G01R31/00—Arrangements for testing electric properties; Arrangements for locating electric faults; Arrangements for electrical testing characterised by what is being tested not provided for elsewhere
- G01R31/08—Locating faults in cables, transmission lines, or networks
- G01R31/088—Aspects of digital computing
Landscapes
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Engineering & Computer Science (AREA)
- Mathematical Physics (AREA)
- Theoretical Computer Science (AREA)
- Supply And Distribution Of Alternating Current (AREA)
Abstract
The invention discloses a troubleshooting line patrol path planning method under the power distribution automation condition, which comprises the following steps of: (1) carrying out automatic transformation after a distribution network line is provided with a distribution terminal: dividing line patrol sections by utilizing adjacent matrix change according to the number and the installation positions of the power distribution terminals; (2) calculating the shortest distance between the line nodes to form a shortest distance matrix; (3) when a distribution network line has a fault, determining a line patrol section with the fault according to fault information sent by a power distribution terminal; (4) and determining the optimal line patrol path for troubleshooting by using an improved genetic algorithm and taking the node which patrols the fault section in the shortest time as a target. The method solves the problems of low efficiency and insufficient practicability of the line patrol path planning method aiming at fault troubleshooting under the power distribution automation condition in the prior art, realizes the rapid troubleshooting of the distribution network fault, and reduces the power failure time.
Description
Technical Field
The invention relates to the field of electric power fault maintenance, in particular to a troubleshooting line patrol path planning method under the power distribution automation condition.
Background
After the 10kV line of the distribution network is in fault, the whole line is tripped due to the fault and has power failure, at the moment, the power company can send emergency repair personnel to patrol the line immediately, find fault points, and can carry out line emergency repair and power restoration after finding the fault points. When the distribution line is not provided with a distribution terminal, the line inspection of the whole line needs to be carried out after the fault, fault points are searched one by one, and the time for inspecting the line and troubleshooting is long. At present, more and more lines are automatically transformed and provided with power distribution terminals, faults can be positioned in a certain section through the terminals during the faults, then the section is checked and fault points are searched, and the fault checking time is effectively shortened. However, due to limited investment, power distribution terminals cannot be installed at all switch positions on a distribution network line in a power enterprise, and a fault cannot be located at a certain fault point after the terminals are installed, and the fault point still needs to be inspected through line inspection, so that a planning method of an optimal line inspection path during fault inspection under a power distribution automation condition is urgently needed.
At present, the research on routing paths after the fault location of the distribution network lines is less, and only a few documents are mentioned in the calculation of reliability, wherein the calculation of routing paths is only simple addition, and the possibility of repeated routing and the best path existing in all routing paths is not considered. In summary, a practical and effective method for planning a route patrol path during troubleshooting under the automatic power distribution condition is urgently needed.
Disclosure of Invention
In order to solve the technical problems, the invention discloses a method for planning a fault-finding line-patrol path under a distribution automation condition, which aims to solve the problems of low efficiency and insufficient practicability of the method for planning the line-patrol path during fault finding under the distribution automation condition in the prior art, realize the rapid finding of distribution network faults and reduce the power failure time.
The invention is realized by the following technical scheme:
a troubleshooting patrol route planning method under the distribution automation condition comprises the following steps:
(1) carrying out automatic transformation after a distribution network line is provided with a distribution terminal: dividing line patrol sections by utilizing adjacent matrix change according to the number and the installation positions of the power distribution terminals;
(2) calculating the shortest distance between the line nodes to form a shortest distance matrix;
(3) when a distribution network line has a fault, determining a line patrol section with the fault according to fault information sent by a power distribution terminal;
(4) and determining the optimal line patrol path for troubleshooting by using an improved genetic algorithm and taking the node which patrols the fault section in the shortest time as a target.
In the step (1), the division of the line patrol sections comprises the following steps:
(11) converting the distribution network topology into a connected graph, and forming an adjacent matrix A by the connected graph according to a description method of graph theory;
(12) acquiring the number and the installation position of the power distribution terminals, and splitting the node provided with the power distribution terminals into two nodes which are not communicated because the power distribution terminals are installed at the position close to the circuit breaker or the switch; when each terminal is installed, a row and a column are added to the original adjacent matrix, and the value assignment is carried out between the newly added node and the original node according to the following conditions:
i → j represents a newly added node, which is located between the node i and the node j and split by the node i and is not communicated with the node i and is communicated with the node j, i and n represent subscripts of rows and columns of the original split node, and d represents a subscript of a row of the newly added node; therefore, the relationship between the newly added nodes of the matrix and other nodes is obtained according to the formula rule and the node relationship between the original split nodes and other nodes, and the matrix B is obtained according to the number and the positions of the power distribution terminals and the rule;
(13) continuously carrying out iterative calculation according to the following formula until the matrix calculated next time is completely the same as the matrix calculated last time and does not change any more, stopping calculation and obtaining a matrix C:
C＝B·BT；
(14) and analyzing the values in the matrix C, and grouping the nodes which are 1 in the matrix C into 1 group so as to obtain a plurality of line patrol sections.
Further, before the step (2), parameters of the distribution network lines, including the line length, are obtained in advance, and then a matrix D of the shortest path between the nodes is obtained according to the connected graph.
Further, in the step (4), an improved genetic algorithm is used for determining an optimal route patrol path for troubleshooting, and the method comprises the following steps:
(41) the routing path planning is to take the node which is routed to the fault section in the shortest time as the target, and since the routing speed is fixed, the problem can be converted into the shortest path length which is routed to all the nodes, and the target function can be expressed as:
wherein d (a)i,ai+1) The shortest distance between the node i and the node i +1 is defined, and n is the number of nodes of the whole connected graph;
(42) the optimal line patrol path problem is solved by using an improved genetic algorithm, the coding mode adopts a decimal system, each node number in the line patrol section can be represented by a decimal code, if the node number is 4, the decimal code is 4, and a fitness function F is obtained by converting an objective function F:
f＝1/F，
the crossing mode adopts a one-point crossing strategy, firstly, crossing point positions are randomly generated through continuous and uniform distribution, the point positions are used as crossing positions, in order to avoid unreasonable paths, the crossing positions of the parent generation 1 correspond to decimal values of the parent generation 2, point positions with the same values as the crossing positions of the parent generation 2 are found in other non-crossing areas of the parent generation 1 and are assigned as the values of the crossing positions of the parent generation 1, then, the same operation is carried out on the parent generation 2, and finally, the values of the crossing positions of the parent generation 1 and the parent generation 2 are exchanged.
Cross probability PjcAnd the mutation probability PbyThe size of the numerical value is the key of the behavior and the performance of the genetic algorithm, and the convergence and the accuracy of the algorithm can be directly influencedjcAnd PbyAnd (3) adjusting:
in the formula (f)Maximum ofRepresenting the fitness value of the largest individual in the population; f. ofAverageAn average fitness value representative of the population; f' represents the greater fitness value of the two individuals to be crossed; f represents the fitness value of the individual to be mutated; pjc1And Pby1Are respectively greater than Pjc2And Pby2These four values are given during genetic manipulation, and during mutation manipulation, two genes of one chromosome are randomly selected for interchange, and the specific mutation mode is two-point interchange.
Compared with the prior art, the invention has the following advantages and beneficial effects:
the invention relates to a method for planning a fault inspection route inspection path under the distribution automation condition, which divides the route inspection sections according to the installation number and the position of distribution terminals and the adjacent matrix transformation, and then calculates the optimal route according to the shortest time target route inspection section by utilizing an improved genetic algorithm.
Drawings
The accompanying drawings, which are included to provide a further understanding of the embodiments of the invention and are incorporated in and constitute a part of this application, illustrate embodiment(s) of the invention and together with the description serve to explain the principles of the invention. In the drawings:
FIG. 1 is a flow chart of the calculation of an optimal routing path for the improved genetic algorithm of the present invention;
fig. 2 is a simple distribution network in a certain area in embodiment 2 of the present invention, where STA denotes a substation, CB denotes a substation outgoing breaker, S1-S7 denotes a load switch, and T1-T4 denotes a distribution transformer;
FIG. 3 is a connectivity graph converted from the distribution network topology of FIG. 2 of the present invention, wherein the numbers 1-12 represent connectivity graph nodes converted from the circuit breaker, the load switch, and the distribution transformer, respectively;
FIG. 4 is a diagram of the installation location of the power distribution terminal of the present invention, wherein numerals DT1-DT3 represent power distribution terminals, respectively;
FIG. 5 is a schematic diagram of the present invention divided into different routing sections based on the installation location of the power distribution terminal;
fig. 6 is a diagram of a troubleshooting route of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention is further described in detail below with reference to examples and accompanying drawings, and the exemplary embodiments and descriptions thereof are only used for explaining the present invention and are not meant to limit the present invention.
Example 1
The invention discloses a troubleshooting line patrol path planning method under the distribution automation condition, which comprises the following steps of:
1. carrying out automatic transformation after a distribution network line is provided with a distribution terminal: according to the number and the installation position of the power distribution terminals, line patrol sections are divided by utilizing the change of the adjacent matrix, and the method specifically comprises the following steps:
(11) converting the distribution network topology into a connected graph, and forming an adjacent matrix A by the connected graph according to a description method of graph theory;
(12) acquiring the number and the installation position of the power distribution terminals, and splitting the node provided with the power distribution terminals into two nodes which are not communicated because the power distribution terminals are installed at the position close to the circuit breaker or the switch; when each terminal is installed, a row and a column are added to the original adjacent matrix, and the value assignment is carried out between the newly added node and the original node according to the following conditions:
i → j represents a newly added node, which is located between the node i and the node j and split by the node i and is not communicated with the node i and is communicated with the node j, i and n represent subscripts of rows and columns of the original split node, and d represents a subscript of a row of the newly added node; therefore, the relationship between the newly added nodes of the matrix and other nodes is obtained according to the formula rule and the node relationship between the original split nodes and other nodes, and the matrix B is obtained according to the number and the positions of the power distribution terminals and the rule;
(13) continuously carrying out iterative calculation according to the following formula until the matrix calculated next time is completely the same as the matrix calculated last time and does not change any more, stopping calculation and obtaining a matrix C:
C＝B·BT；
(14) and analyzing the values in the matrix C, and grouping the nodes which are 1 in the matrix C into 1 group so as to obtain a plurality of line patrol sections.
2. Calculating the shortest distance between the line nodes to form a shortest distance matrix;
3. when a distribution network line has a fault, determining a line patrol section with the fault according to fault information sent by a power distribution terminal;
4. determining an optimal line patrol path for troubleshooting by using an improved genetic algorithm and taking nodes which patrol the fault section in the shortest time as targets:
(41) the routing path planning is to take the node which is routed to the fault section in the shortest time as the target, and since the routing speed is fixed, the problem can be converted into the shortest path length which is routed to all the nodes, and the target function can be expressed as:
wherein d (a)i,ai+1) The shortest distance between the node i and the node i +1 is defined, and n is the number of nodes of the whole connected graph;
(42) as shown in fig. 1, the optimal routing problem is solved by using an improved genetic algorithm, the coding mode adopts a decimal system, each node number in the routing section can be represented by a decimal code, if the node number is 4, the decimal code is 4, and the fitness function F is obtained by transforming an objective function F:
f＝1/F，
the crossing mode adopts a one-point crossing strategy, firstly, crossing point positions are randomly generated through continuous and uniform distribution, the point positions are used as crossing positions, in order to avoid unreasonable paths, the crossing positions of the parent generation 1 correspond to decimal values of the parent generation 2, point positions with the same values as the crossing positions of the parent generation 2 are found in other non-crossing areas of the parent generation 1 and are assigned as the values of the crossing positions of the parent generation 1, then, the same operation is carried out on the parent generation 2, and finally, the values of the crossing positions of the parent generation 1 and the parent generation 2 are exchanged.
Cross probability PjcAnd the mutation probability PbyThe size of the numerical value is the key of the behavior and the performance of the genetic algorithm, and the convergence and the accuracy of the algorithm can be directly influencedjcAnd PbyAnd (3) adjusting:
in the formula (f)Maximum ofRepresenting the fitness value of the largest individual in the population; f. ofAverageAn average fitness value representative of the population; f' represents the greater fitness value of the two individuals to be crossed; f represents the fitness value of the individual to be mutated; pjc1And Pby1Are respectively greater than Pjc2And Pby2These four values are given during genetic manipulation, and during mutation manipulation, two genes of one chromosome are randomly selected for interchange, and the specific mutation mode is two-point interchange.
Example 2
As shown in fig. 2, which is a simple power distribution network in a certain area, the method for planning the fault-finding line-patrol path under the power distribution automation condition of the present invention includes the following steps:
in fig. 2, the circuit breaker, the load switch and the distribution transformer at the tail end are used as nodes, the line segment is used as a branch, and a distribution network topology is converted into a connection diagram shown in fig. 3;
according to fig. 3, the adjacency matrix a may be formed according to the method described in graph theory:
the simple distribution network is provided with distribution terminals at branches CB-S1, S4-S5 and S4-S6, and the positions of the distribution terminals are close to an upstream switch, see FIG. 4, and a new adjacent matrix B can be obtained by a method for transforming the adjacent matrix according to the installation positions and the number of the terminals:
and continuously iterating and calculating according to the transposed matrix multiplied by the B matrix until the new matrix is not changed any more to obtain the matrix C.
And analyzing the values in the matrix C, and grouping the nodes which are 1 into 1 group, thereby obtaining a plurality of connected graphs. By using the method, the distribution network topology can be divided into 4 groups of line patrol sections, each section corresponds to 1 group of adjacent matrixes, and the connected graph is divided into different line patrol sections as shown in fig. 5.
The parameters of the distribution network line are shown in table 1:
TABLE 1 distribution network line parameters
According to the line parameters, the shortest distance matrix D between the nodes of the 2 nd connected graph is as follows:
when the 2 nd line patrol section has short circuit fault, the optimal line patrol path for troubleshooting the fault in the 2 nd line patrol section can be obtained by solving according to the improved genetic algorithm and is shown in the following table.
TABLE 2 optimal route inspection path
The routing path obtained from the above table is shown in fig. 6.
The above-mentioned embodiments are intended to illustrate the objects, technical solutions and advantages of the present invention in further detail, and it should be understood that the above-mentioned embodiments are merely exemplary embodiments of the present invention, and are not intended to limit the scope of the present invention, and any modifications, equivalent substitutions, improvements and the like made within the spirit and principle of the present invention should be included in the scope of the present invention.
Claims (4)
1. A troubleshooting line patrol path planning method under the distribution automation condition is characterized by comprising the following steps:
(1) carrying out automatic transformation after a distribution network line is provided with a distribution terminal: dividing line patrol sections by utilizing adjacent matrix change according to the number and the installation positions of the power distribution terminals;
(2) calculating the shortest distance between the line nodes to form a shortest distance matrix;
(3) when a distribution network line has a fault, determining a line patrol section with the fault according to fault information sent by a power distribution terminal;
(4) and determining the optimal line patrol path for troubleshooting by using an improved genetic algorithm and taking the node which patrols the fault section in the shortest time as a target.
2. The method for planning the fault-investigation patrol route under the distribution automation condition according to claim 1, wherein in the step (1), the division of the patrol section comprises the following steps:
(11) converting the distribution network topology into a connected graph, and forming an adjacent matrix A by the connected graph according to a description method of graph theory;
(12) acquiring the number and the installation position of the power distribution terminals, and splitting the node provided with the power distribution terminals into two nodes which are not communicated because the power distribution terminals are installed at the position close to the circuit breaker or the switch; when each terminal is installed, a row and a column are added to the original adjacent matrix, and the value assignment is carried out between the newly added node and the original node according to the following conditions:
i → j represents a newly added node, which is located between the node i and the node j and split by the node i and is not communicated with the node i and is communicated with the node j, i and n represent subscripts of rows and columns of the original split node, and d represents a subscript of a row of the newly added node; therefore, the relationship between the newly added nodes of the matrix and other nodes is obtained according to the formula rule and the node relationship between the original split nodes and other nodes, and the matrix B is obtained according to the number and the positions of the power distribution terminals and the rule;
(13) continuously carrying out iterative calculation according to the following formula until the matrix calculated next time is completely the same as the matrix calculated last time and does not change any more, stopping calculation and obtaining a matrix C:
C＝B·BT；
(14) and analyzing the values in the matrix C, and grouping the nodes which are 1 in the matrix C into 1 group so as to obtain a plurality of line patrol sections.
3. The troubleshooting routing method under the distribution automation condition as claimed in claim 1, characterized in that, before the step (2), the parameters of the distribution network line, including the line length, are obtained in advance, and then the matrix D of the shortest path between the nodes is obtained according to the connected graph.
4. The method for planning the fault-elimination line-patrol path under the power distribution automation condition as claimed in claim 1, wherein in the step (4), the optimal line-patrol path for eliminating the fault is determined by using the improved genetic algorithm, and the method comprises the following steps:
(41) the routing path planning is to take the node which is routed to the fault section in the shortest time as the target, and since the routing speed is fixed, the problem can be converted into the shortest path length which is routed to all the nodes, and the target function can be expressed as:
wherein d (a)i,ai+1) The shortest distance between the node i and the node i +1 is defined, and n is the number of nodes of the whole connected graph;
(42) the optimal line patrol path problem is solved by using an improved genetic algorithm, the coding mode adopts a decimal system, each node number in the line patrol section can be represented by a decimal code, if the node number is 4, the decimal code is 4, and a fitness function F is obtained by converting an objective function F:
f＝1/F，
the crossing mode adopts a one-point crossing strategy, firstly, crossing point positions are randomly generated through continuous and uniform distribution, the point positions are used as crossing positions, in order to avoid unreasonable paths, the crossing positions of the parent generation 1 correspond to decimal values of the parent generation 2, point positions with the same values as the crossing positions of the parent generation 2 are found in other non-crossing areas of the parent generation 1 and are assigned as the values of the crossing positions of the parent generation 1, then, the same operation is carried out on the parent generation 2, and finally, the values of the crossing positions of the parent generation 1 and the parent generation 2 are exchanged;
(43) using adaptive genetic operators, cross probability P is measured using the formulajcAnd the mutation probability PbyThe adjustment of (2):
in the formula (f)Maximum ofRepresenting the fitness value of the largest individual in the population; f. ofAverageAn average fitness value representative of the population; f' represents the greater fitness value of the two individuals to be crossed; f represents the fitness value of the individual to be mutated; pjc1And Pby1Are respectively greater than Pjc2And Pby2These four values are given during genetic manipulation, and during mutation manipulation, two genes of one chromosome are randomly selected for interchange, and the specific mutation mode is two-point interchange.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911045608.5A CN110763953B (en) | 2019-10-30 | 2019-10-30 | Troubleshooting line patrol path planning method under distribution automation condition |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911045608.5A CN110763953B (en) | 2019-10-30 | 2019-10-30 | Troubleshooting line patrol path planning method under distribution automation condition |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110763953A true CN110763953A (en) | 2020-02-07 |
| CN110763953B CN110763953B (en) | 2022-04-22 |
Family
ID=69334566
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911045608.5A Active CN110763953B (en) | 2019-10-30 | 2019-10-30 | Troubleshooting line patrol path planning method under distribution automation condition |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110763953B (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111667118A (en) * | 2020-06-10 | 2020-09-15 | 国网四川省电力公司电力科学研究院 | Fault line patrol checking and planning method and system under single/double cooperative mode |
| CN112014686A (en) * | 2020-08-14 | 2020-12-01 | 国网河南省电力公司封丘县供电公司 | Low-voltage distribution network fault positioning method based on shortest path of adjacency matrix |
| CN113837469A (en) * | 2021-09-24 | 2021-12-24 | 国网四川省电力公司电力科学研究院 | Distribution network low-voltage regulator installation point selection optimization method, system and equipment |
Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2000172664A (en) * | 1998-10-02 | 2000-06-23 | Yoshinori Haseyama | Optimum route and optimum circulation route searching method |
| CN101266659A (en) * | 2008-05-08 | 2008-09-17 | 山东大学 | Robot grid sub-map amalgamation method based on immune self-adapted genetic algorithm |
| CN105404938A (en) * | 2015-11-30 | 2016-03-16 | 国网山东省电力公司烟台供电公司 | Line-patrolling path optimization method for shortening patrolling time of transmission line |
| CN105608507A (en) * | 2015-12-22 | 2016-05-25 | 广东电网有限责任公司江门供电局 | Transmission line inspection path optimization method based on differential crisscross optimization algorithm |
| CN106125671A (en) * | 2016-07-25 | 2016-11-16 | 广东省自动化研究所 | A kind of multiclass pel hybrid process method for optimizing route |
| CN106503844A (en) * | 2016-10-19 | 2017-03-15 | 国网山东省电力公司济阳县供电公司 | A kind of power circuit optimum path search method of employing genetic algorithm |
| CN107464005A (en) * | 2017-08-21 | 2017-12-12 | 中国人民解放军国防科技大学 | Expanded path planning method for vehicle reservation |
| CN107770637A (en) * | 2017-09-22 | 2018-03-06 | 广西师范大学 | Elastic optical network stochastic route path generating method |
| CN108958257A (en) * | 2018-07-25 | 2018-12-07 | 深圳市集大自动化有限公司 | The collaboration paths planning method of more AGV integrated navigations |
| CN110244712A (en) * | 2019-05-22 | 2019-09-17 | 南通大学 | A kind of more AGV system paths planning methods |
-
2019
- 2019-10-30 CN CN201911045608.5A patent/CN110763953B/en active Active
Patent Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2000172664A (en) * | 1998-10-02 | 2000-06-23 | Yoshinori Haseyama | Optimum route and optimum circulation route searching method |
| CN101266659A (en) * | 2008-05-08 | 2008-09-17 | 山东大学 | Robot grid sub-map amalgamation method based on immune self-adapted genetic algorithm |
| CN105404938A (en) * | 2015-11-30 | 2016-03-16 | 国网山东省电力公司烟台供电公司 | Line-patrolling path optimization method for shortening patrolling time of transmission line |
| CN105608507A (en) * | 2015-12-22 | 2016-05-25 | 广东电网有限责任公司江门供电局 | Transmission line inspection path optimization method based on differential crisscross optimization algorithm |
| CN106125671A (en) * | 2016-07-25 | 2016-11-16 | 广东省自动化研究所 | A kind of multiclass pel hybrid process method for optimizing route |
| CN106503844A (en) * | 2016-10-19 | 2017-03-15 | 国网山东省电力公司济阳县供电公司 | A kind of power circuit optimum path search method of employing genetic algorithm |
| CN107464005A (en) * | 2017-08-21 | 2017-12-12 | 中国人民解放军国防科技大学 | Expanded path planning method for vehicle reservation |
| CN107770637A (en) * | 2017-09-22 | 2018-03-06 | 广西师范大学 | Elastic optical network stochastic route path generating method |
| CN108958257A (en) * | 2018-07-25 | 2018-12-07 | 深圳市集大自动化有限公司 | The collaboration paths planning method of more AGV integrated navigations |
| CN110244712A (en) * | 2019-05-22 | 2019-09-17 | 南通大学 | A kind of more AGV system paths planning methods |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111667118A (en) * | 2020-06-10 | 2020-09-15 | 国网四川省电力公司电力科学研究院 | Fault line patrol checking and planning method and system under single/double cooperative mode |
| CN111667118B (en) * | 2020-06-10 | 2022-07-29 | 国网四川省电力公司电力科学研究院 | Fault line patrol checking and planning method and system under single/double cooperation mode |
| CN112014686A (en) * | 2020-08-14 | 2020-12-01 | 国网河南省电力公司封丘县供电公司 | Low-voltage distribution network fault positioning method based on shortest path of adjacency matrix |
| CN112014686B (en) * | 2020-08-14 | 2022-07-05 | 国网河南省电力公司封丘县供电公司 | Low-voltage distribution network fault positioning method based on shortest path of adjacency matrix |
| CN113837469A (en) * | 2021-09-24 | 2021-12-24 | 国网四川省电力公司电力科学研究院 | Distribution network low-voltage regulator installation point selection optimization method, system and equipment |
| CN113837469B (en) * | 2021-09-24 | 2023-10-27 | 国网四川省电力公司电力科学研究院 | Distribution network low-voltage regulator installation point selection optimization method, system and equipment |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110763953B (en) | 2022-04-22 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110763953B (en) | Troubleshooting line patrol path planning method under distribution automation condition | |
| CN103607320B (en) | Power telecom network survivability evaluation methodology | |
| CN102663412A (en) | Power equipment current-carrying fault trend prediction method based on least squares support vector machine | |
| CN108695846B (en) | Unit distribution power grid operation risk assessment method | |
| CN106054019B (en) | The online Fault Locating Method of power distribution network high fault tolerance based on failure confactor | |
| CN107526872B (en) | Method for calculating thermal stress and deformation of 500kV ultrahigh-voltage cable | |
| Bahirat et al. | Reliability assessment of DC wind farms | |
| CN116359652A (en) | State monitoring system for power equipment | |
| CN108594075B (en) | Power distribution network power failure fault positioning method based on improved ant colony algorithm | |
| CN115545479A (en) | Method and device for determining important nodes or important lines of power distribution network | |
| CN115333062A (en) | Fault processing method and device for power distribution network system | |
| CN112865090B (en) | Intelligent power distribution network fault recovery method based on organism immune mechanism | |
| KR20190040752A (en) | Apparatus and method for designing offshore wind farm | |
| CN115219838A (en) | Power distribution network fault studying and judging method based on multi-source information fusion | |
| CN110768260B (en) | Power grid cascading failure model building method based on electrical betweenness | |
| CN113541092B (en) | Power distribution network relay protection artificial intelligence setting method based on reinforcement learning algorithm | |
| CN113271226B (en) | Power communication gateway key link identification method and protection method thereof | |
| CN111327028B (en) | Method for realizing protection constant value setting calculation under different topologies by utilizing K-Means clustering | |
| CN108090616A (en) | A kind of electric system Active Splitting optimal section searching method | |
| CN110738411B (en) | Reliability analysis method for typical wiring mode of power distribution network | |
| CN112668747A (en) | Optimal configuration method of harmonic source positioning measurement device considering measurement redundancy | |
| CN113471928A (en) | Photovoltaic equipment cluster equivalence calculation method in power distribution network current protection setting process | |
| CN107546742B (en) | Day-ahead planned power flow active power and voltage calculation error analysis method | |
| CN111337763A (en) | Optimized distribution method for voltage monitoring terminal of trunk type distribution line | |
| CN116979511B (en) | Method and system for identifying cascading failure key line by considering low-pass characteristic of fan |
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 |