CN113608072A - Electric power self-healing rapid fault positioning method based on non-sound condition - Google Patents

Electric power self-healing rapid fault positioning method based on non-sound condition Download PDF

Info

Publication number
CN113608072A
CN113608072A CN202111169562.5A CN202111169562A CN113608072A CN 113608072 A CN113608072 A CN 113608072A CN 202111169562 A CN202111169562 A CN 202111169562A CN 113608072 A CN113608072 A CN 113608072A
Authority
CN
China
Prior art keywords
fault
node
probability
nodes
healing
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
Application number
CN202111169562.5A
Other languages
Chinese (zh)
Other versions
CN113608072B (en
Inventor
练晓玲
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Shenzhen Jingxing Tiancheng Technology Co ltd
Original Assignee
Shenzhen Jingxing Tiancheng Technology Co ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Shenzhen Jingxing Tiancheng Technology Co ltd filed Critical Shenzhen Jingxing Tiancheng Technology Co ltd
Priority to CN202111169562.5A priority Critical patent/CN113608072B/en
Publication of CN113608072A publication Critical patent/CN113608072A/en
Application granted granted Critical
Publication of CN113608072B publication Critical patent/CN113608072B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • GPHYSICS
    • G01MEASURING; TESTING
    • G01RMEASURING ELECTRIC VARIABLES; MEASURING MAGNETIC VARIABLES
    • G01R31/00Arrangements for testing electric properties; Arrangements for locating electric faults; Arrangements for electrical testing characterised by what is being tested not provided for elsewhere
    • G01R31/08Locating faults in cables, transmission lines, or networks
    • G01R31/081Locating faults in cables, transmission lines, or networks according to type of conductors
    • G01R31/086Locating faults in cables, transmission lines, or networks according to type of conductors in power transmission or distribution networks, i.e. with interconnected conductors
    • GPHYSICS
    • G01MEASURING; TESTING
    • G01RMEASURING ELECTRIC VARIABLES; MEASURING MAGNETIC VARIABLES
    • G01R31/00Arrangements for testing electric properties; Arrangements for locating electric faults; Arrangements for electrical testing characterised by what is being tested not provided for elsewhere
    • G01R31/08Locating faults in cables, transmission lines, or networks
    • G01R31/088Aspects of digital computing
    • YGENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y04INFORMATION OR COMMUNICATION TECHNOLOGIES HAVING AN IMPACT ON OTHER TECHNOLOGY AREAS
    • Y04SSYSTEMS INTEGRATING TECHNOLOGIES RELATED TO POWER NETWORK OPERATION, COMMUNICATION OR INFORMATION TECHNOLOGIES FOR IMPROVING THE ELECTRICAL POWER GENERATION, TRANSMISSION, DISTRIBUTION, MANAGEMENT OR USAGE, i.e. SMART GRIDS
    • Y04S10/00Systems supporting electrical power generation, transmission or distribution
    • Y04S10/50Systems or methods supporting the power network operation or management, involving a certain degree of interaction with the load-side end user applications
    • Y04S10/52Outage or fault management, e.g. fault detection or location

Abstract

The invention relates to the technical field of electric power self-healing, in particular to a quick electric power self-healing fault positioning method based on non-sound conditions. The method comprises the steps of fault position judgment, fault searching and positioning and regional trial recovery, wherein the specific fault position judgment steps of a topological algorithm adopted by the fault position judgment comprise the following steps of detection region division: the area to be detected is divided into primary areas to be processed and recorded as
Figure DEST_PATH_IMAGE002
Each of
Figure 345577DEST_PATH_IMAGE002
All contain a plurality of information node, constitute a conventional state information jointly, secondly the breadth search: when the state information of the whole area to be detected changes, searching is carried out, and detection signals are actively sent out to each area in sequence
Figure 934822DEST_PATH_IMAGE002
The method and the device have the advantages that the access is carried out, whether the change occurs or not is judged, and therefore the fault area is further positioned, and the purpose of the method and the device is to improve the accuracy and the judgment speed of the non-closed-loop power grid in judging and positioning the fault position of the power grid under the non-sound condition.

Description

Electric power self-healing rapid fault positioning method based on non-sound condition
Technical Field
The invention relates to the technical field of electric power self-healing, in particular to a quick electric power self-healing fault positioning method based on non-sound conditions.
Background
When the distribution network fails, the fault position is quickly positioned, then the fault position is isolated, and regional power supply can be effectively recovered, and meanwhile, after the fault position is positioned, fault maintenance is convenient for workers to carry out, but when the fault position is judged, because the distribution equipment, the distribution automation system and the communication network work in an outdoor severe environment, and meanwhile, a non-closed-loop power grid signal channel is single, the phenomenon of failure information missing report or error report is easy to occur, the problem of judging the fault region under the non-sound condition can occur, and under the non-sound condition, the faults in different regions are probability problems;
the invention aims to detect error information generated by failure report or failure report of a non-closed-loop power grid, judge failure generation probability under the non-sound condition for workers and avoid waste of human resources.
Disclosure of Invention
The invention aims to provide a quick fault location method based on electric self-healing under the non-sound condition, which aims to solve the problems that the faults in different areas are probability under the non-sound condition and the traditional one-by-one access mode is difficult to directly judge and has high operation pressure in the background art.
In order to achieve the purpose, the invention provides a quick fault location method for electric self-healing based on non-sound conditions, which comprises the following steps:
s1.1, fault position judgment: the method comprises the steps that a rapid fault position range is preliminarily judged through a topological algorithm, when the topological algorithm is started, a system accesses data information nodes along a certain sequence by taking error reporting points as starting points to obtain data feedback, if the error reporting points are in a false report condition, other error information feedback cannot be obtained on the path, and therefore the false report is qualified and is not processed;
when other error information feedback is found, the fault position can be positioned in a larger area through a topological algorithm;
s1.2, fault searching and positioning: performing depth search through a tree algorithm to obtain a plurality of fault occurrence areas, sequentially accessing one by one in a larger area obtained in the step S1.1 during the depth search to obtain a plurality of small possible fault occurrence areas, and calculating fault probabilities of the plurality of areas;
s1.3, region probing recovery: and recovering power supply to the areas with low fault occurrence rate one by one, so that the power grid can be self-healed.
As a further improvement of the technical solution, the specific fault location determination step of the topology algorithm in S1.1 is as follows:
s2.1, detection area division: the area to be detected is divided into primary areas to be processed and recorded as
Figure 413510DEST_PATH_IMAGE001
Each of
Figure 265403DEST_PATH_IMAGE001
All the information nodes comprise a plurality of information nodes which jointly form conventional state information;
s2.2, breadth searching: when the state information of the whole area to be detected changes, searching is carried out, and detection signals are actively sent out to each area in sequence
Figure 248403DEST_PATH_IMAGE001
Access is made to obtain feedback information and compare with the normal state information in step S2.1.
As a further improvement of the technical scheme, when the areas in the S2.1 are divided, each area
Figure 112454DEST_PATH_IMAGE001
Comprises at least two information nodes which are independent of each other and all
Figure 130088DEST_PATH_IMAGE001
Together forming a complete region to be detected.
As a further improvement of the technical solution, the breadth search process in S2.2 is as follows:
s3.1, reading and accessing a certain area
Figure 421392DEST_PATH_IMAGE001
Is a starting node;
s3.2, sequentially accessing each non-accessed adjacent area of the initial node
Figure 891688DEST_PATH_IMAGE001
S3.3 from these just accessed contiguous areas
Figure 559430DEST_PATH_IMAGE001
Starting with a sequence of accesses to their non-accessed contiguous areas
Figure 697150DEST_PATH_IMAGE001
The rule of access order is that the adjacency point of the vertex accessed first is accessed before the adjacency point of the vertex accessed later.
S3.4, if there are still areas
Figure 159355DEST_PATH_IMAGE001
If not, jump to S3.3, otherwise, end the search.
As a further improvement of the technical scheme, the S1.2 comprises
Figure 116947DEST_PATH_IMAGE001
The tree algorithm of the access of the inner nodes has the following specific flow:
s4.1, reading and accessing a certain node as an initial node;
s4.2, searching along a path which is not accessed, and accessing nodes on the path at intervals until the end node;
s4.3, backtracking to the last accessed node;
s4.4, if the node has a path which is not accessed, jumping to S4.2, otherwise, checking whether the node is a starting node, if so, finishing the search, otherwise, jumping to S4.3, and after the reading access is finished, reading the path originally containing a plurality of nodes
Figure 322800DEST_PATH_IMAGE001
Divided into a plurality of successive nodes
Figure 315027DEST_PATH_IMAGE002
As a further improvement of the technical scheme, the S1.2 comprises
Figure 213713DEST_PATH_IMAGE001
When only one node which detects fault information is accessed by the access tree algorithm of the internal nodes, the following algorithm flows are adopted:
s5.1, starting reading access by taking the error reporting node as an initial node;
s5.2, shielding an adjacent node from accessing to a third node in the same path;
and S5.3, when the path is accessed, if the path cannot be judged, shielding the number of the adjacent nodes, adding the number of the adjacent nodes, and repeating the S5.2.
As a further improvement of the present technical solution, the area heuristic recovery step of S1.3 is as follows:
s6.1, sequencing all possible fault areas according to the fault probability of the possible fault areas from large to small, recovering the power supply of the low-probability areas one by one, and simultaneously carrying out on-site investigation on the high-probability areas by workers.
S6.2, extracting possible fault areas according to the sequence of the fault probability from large to small, extracting only one possible fault area each time, and stopping when one of the following conditions is met: one is that the sum of the failure probabilities of the extracted regions exceeds a threshold a (a can be 90% -98% in general); the second is that the failure probability of the (k + 1) th extracted region is lower than 1/m (m can be 10-20 in general) of the failure probability of the kth extracted region.
As a further improvement of the technical solution, the S1.3 probability judgment algorithm is as follows:
recording node false alarm probability P (1) = K, wherein the specific condition comprises that the probability that all the false alarms of adjacent nodes are failure-free is P (2) = K; the probability that one node false reports to be failure-free is P (3) = K (1-K); the probability that both nodes report correctly is P (3) = (1-K) × (1-K); where the value of K is generally between 0.001 and 0.05 (increasing with time).
As a further improvement of the technical solution, in the case that a node in S1.3 reports fault information, if the fault information reported by the node is correct, a high probability region exists in a neighboring region, deep search is performed by a tree algorithm, the obtained regions that are all reported as non-fault regions are marked as low probability regions, power can be turned on one by one, and the regions that are all reported as faults are marked as high probability regions, which need to be temporarily isolated.
As a further improvement of the technical solution, when the node in S1.3 reports that the fault information is a wrong node, the node performs a deep search through a spaced tree algorithm, and when the spaced nodes exceed three nodes where the second node reporting the fault information is not found yet, a probability calculation formula for correctly reporting the fault information is as follows:
P(4)=K*K*K。
compared with the prior art, the invention has the beneficial effects that:
1. according to the rapid fault positioning method based on electric power self-healing under the non-sound condition, a non-closed-loop power grid is continuously divided in a topological structure mode, then an area needing accurate access is firstly reduced in a large range through an algorithm mode of breadth search and tree search, then adjacent nodes are accessed through a tree algorithm in a fine mode, and a plurality of small areas are determined in a fine mode.
2. According to the rapid fault location method based on electric power self-healing under the non-sound condition, for the condition of false alarm, the number of information nodes in a single area is increased through an interval tree-shaped search mode, the false alarm probability of the nodes is reduced, and the fault area of the bottom probability can be identified rapidly and accurately.
3. According to the rapid self-healing fault location method based on electric power under the non-sound condition, the high-probability area is isolated, and the rapid self-healing capability of the power grid is realized.
Drawings
FIG. 1 is an overall flow chart of the present invention;
FIG. 2 is a flowchart of the topological algorithm steps of the present invention;
FIG. 3 is a flowchart of the prior breadth search algorithm steps of the present invention;
FIG. 4 is a flowchart of the steps of the post tree search algorithm of the present invention;
fig. 5 is a simulation diagram of a grid node according to the present invention.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
Referring to fig. 1-5, the present invention provides a technical solution:
the invention provides a quick fault location method for self-healing of electric power based on non-sound conditions, which comprises the following steps:
s1.1, fault position judgment: performing rapid initial judgment on the fault position range through a topological algorithm;
s1.2, fault searching and positioning: carrying out deep search through a tree algorithm to obtain a plurality of fault occurrence areas;
s1.3, region probing recovery: and recovering power supply to the areas with low fault occurrence rate one by one, so that the power grid can be self-healed.
In addition, the specific fault position judgment step of the topology algorithm in S1.1 is as follows:
s2.1, detection area division: the areas to be detected are processed by primary areas, and are recorded as each
Figure 661531DEST_PATH_IMAGE001
All the information nodes comprise a plurality of information nodes which jointly form conventional state information;
s2.2, breadth searching: when the state information of the whole area to be detected changes, searching is carried out, and detection signals are actively sent out to each area in sequence
Figure 405496DEST_PATH_IMAGE001
And accessing to obtain feedback information, comparing the feedback information with the conventional state information in the step S2.1, and judging whether the feedback information is changed so as to further position the fault area.
Further, in the division of the regions in S2.1, each region is divided
Figure 517808DEST_PATH_IMAGE001
Comprises at least two information nodes which are independent of each other and all
Figure 56237DEST_PATH_IMAGE001
Jointly form a complete region to be detected, and due to the characteristics of the non-closed loop circuit, the region to be detected is taken as a complete topological space X
Figure 254000DEST_PATH_IMAGE001
The method is characterized in that the topological space X is a subset of the topological space X, the checking and the judging are carried out through a topological algorithm, when the power distribution equipment, the power distribution automation system and the communication network are in normal states, the fault position can be quickly obtained, and then the isolation is carried out so that the power grid can be self-healed.
Specifically, the breadth search process in S2.2 is as follows:
s3.1, reading and accessing a certain area
Figure 536077DEST_PATH_IMAGE001
Is a starting node;
s3.2, sequentially accessing each non-accessed adjacent area of the initial node
Figure 502896DEST_PATH_IMAGE001
S3.3 from these just accessed contiguous areas
Figure 743384DEST_PATH_IMAGE001
Starting with a sequence of accesses to their non-accessed contiguous areas
Figure 162864DEST_PATH_IMAGE001
The access sequence rule is:the adjacency point of the vertex visited first is visited "before" the adjacency point of the vertex visited later ", and taking fig. 5 as an example, when using the breadth search, the order of visiting the nodes is as follows:
1 → 2 → 4 → 3 → 6 → 8 → 5 → 7, visit and not repeat adjacent node in priority, save the computational resource, promote the computational efficiency.
S3.4, if there are still areas
Figure 248632DEST_PATH_IMAGE001
And if not, jumping to S3.3, otherwise, ending the search, and rapidly positioning the target area by using a breadth-first algorithm, and simultaneously saving the computing resources and improving the computing speed.
Furthermore, S1.2 includes pairs
Figure 69957DEST_PATH_IMAGE001
The tree algorithm of the access of the inner nodes has the following specific flow:
s4.1, reading and accessing a certain node as an initial node;
s4.2, searching along a path which is not accessed, and accessing nodes on the path at intervals until the end node;
s4.3, backtracking to the last accessed node;
s4.4, if the node has a path which is not accessed, jumping to S4.2, otherwise, checking whether the node is a starting node, if so, finishing the search, otherwise, jumping to S4.3, and after the reading access is finished, reading the path originally containing a plurality of nodes
Figure 481347DEST_PATH_IMAGE001
Divided into a plurality of successive nodes
Figure 388123DEST_PATH_IMAGE002
When is coming into contact with
Figure 12003DEST_PATH_IMAGE002
When neither node detects the failure information, the method
Figure 950484DEST_PATH_IMAGE002
Belonging to a normal area, and determining that the fault information is detected at both ends when the fault information is detected
Figure 532775DEST_PATH_IMAGE002
The located area is a failure area, and taking fig. 5 as an example, when searching by using the tree algorithm, the order of accessing nodes is as follows:
1 → 2 → 1 → 4 → 3 → 4 → 6 → 8 → 6 → 4 → 5 → 7, the efficiency is low but the precision is high, and the calculation amount is reduced in the case that the range is narrowed by the wide search, thereby increasing the calculation speed.
In addition, S1.2 includes pairs
Figure 926848DEST_PATH_IMAGE001
When only one node which detects fault information is accessed by the access tree algorithm of the internal nodes, the following algorithm flows are adopted:
s5.1, starting reading access by taking the error reporting node as an initial node;
s5.2, shielding an adjacent node from accessing to a third node in the same path;
s5.3, when the path is accessed completely, if the path cannot be judged, shielding the number of adjacent nodes and adding the number of adjacent nodes together to repeat S5.2, and enlarging the fault detection range in a mode of shielding the adjacent nodes, so that the direct access to the fault node is avoided, and further the influence on judgment caused by obtaining wrong information is avoided, taking fig. 5 as an example, when the interval tree algorithm is used for searching, if the error is reported by the No. 4 point, the path of the access node has the following steps:
4 → 2; 4 → 7; 4 → 8 … …, a plurality of spaced detection regions are obtained, and the probability that a single node false alarm affects the node is further reduced.
Further, the area heuristic recovery step of S1.3 is as follows:
s6.1, sequencing all possible fault areas according to the fault probability of the possible fault areas from large to small, and recovering the power supply of the low-probability areas one by one.
S6.2, extracting possible fault areas according to the sequence of the fault probability from large to small, extracting only one possible fault area each time, and stopping when one of the following conditions is met: one is that the sum of the failure probabilities of the extracted regions exceeds a threshold a (a can be 90% -98% in general); secondly, the fault probability of the (k + 1) th extracted region is lower than 1/m (m can be 10-20) of the fault probability of the kth extracted region, although the probability of the screened region having a fault is high, in reality, a small-probability event that the fault occurs in other regions still possibly occurs, and a power failure range is still expanded due to fewer situations, which is often caused by more serious false alarm and missed alarm and is also related to the distribution of false alarm and missed alarm switches. Even so, there is no risk to the operation except that it is possible that the power supply of the individual health areas is not restored.
In addition, the S1.3 probability judgment algorithm is as follows:
recording node false alarm probability P (1) = K, wherein the specific condition comprises that the probability that all the false alarms of adjacent nodes are failure-free is P (2) = K; the probability that one node false reports to be failure-free is P (3) = K (1-K); the probability that both nodes report correctly is P (3) = (1-K) × (1-K); the value of K is generally between 0.001 and 0.05 (rising with time), so that the fault probability of the region is extremely low under the condition of reporting no fault, the regions belong to low-probability regions, and the regions can be electrified one by one.
In addition, under the condition that one node in S1.3 reports fault information, if the fault information reported by the node is correct, a high-probability region exists in a neighboring region, deep search is performed through a tree algorithm, the obtained regions are reported as non-fault regions and are recorded as low-probability regions, power can be turned on one by one, and the regions reported as faults are recorded as high-probability regions, which need to be temporarily isolated.
Further, when the node in S1.3 reports that the failure information is a wrong node, deep search is performed by using a spaced tree algorithm, and when the number of spaced nodes exceeds three, and a second node reporting failure information is not found yet, a probability calculation formula for correctly reporting the failure information is as follows:
P(4)=K*K*K。
the foregoing shows and describes the general principles, essential features, and advantages of the invention. It will be understood by those skilled in the art that the present invention is not limited to the embodiments described above, and the preferred embodiments of the present invention are described in the above embodiments and the description, and are not intended to limit the present invention. The scope of the invention is defined by the appended claims and equivalents thereof.

Claims (10)

1. The quick fault location method for self-healing of electric power based on non-sound conditions is characterized by comprising the following steps:
s1.1, fault position judgment: performing rapid initial judgment on the fault position range through a topological algorithm;
s1.2, fault searching and positioning: carrying out deep search through a tree algorithm to obtain a plurality of fault occurrence areas;
s1.3, region probing recovery: and recovering power supply to the areas with low fault occurrence rate one by one, so that the power grid can be self-healed.
2. A power self-healing rapid fault location method based on non-robust conditions according to claim 1, characterized in that: the specific fault position judgment step of the topology algorithm in the S1.1 is as follows:
s2.1, detection area division: the area to be detected is divided into primary areas to be processed and recorded as
Figure 425501DEST_PATH_IMAGE002
Each of
Figure 364638DEST_PATH_IMAGE002
All the information nodes comprise a plurality of information nodes which jointly form conventional state information;
s2.2, breadth searching: when the state information of the whole area to be detected changes, searching is carried out, and the state information is actively sent outThe detection signal is applied to each of the detection signals in turn
Figure 94697DEST_PATH_IMAGE002
Access is made to obtain feedback information and compare with the normal state information in step S2.1.
3. A power self-healing rapid fault location method based on non-robust conditions according to claim 2, characterized in that: when the regions in S2.1 are divided, each region
Figure 904521DEST_PATH_IMAGE002
Comprises at least two information nodes which are independent of each other and all
Figure 694622DEST_PATH_IMAGE002
Together forming a complete region to be detected.
4. A power self-healing rapid fault location method based on non-robust conditions according to claim 2, characterized in that: the breadth search process in S2.2 is as follows:
s3.1, reading and accessing a certain area
Figure 855476DEST_PATH_IMAGE002
Is a starting node;
s3.2, sequentially accessing each non-accessed adjacent area of the initial node
Figure 123646DEST_PATH_IMAGE002
S3.3 from these just accessed contiguous areas
Figure 53556DEST_PATH_IMAGE002
Starting with a sequence of accesses to their non-accessed contiguous areas
Figure 14559DEST_PATH_IMAGE002
The access sequence rule is that the adjacent point of the vertex accessed first is accessed before the adjacent point of the vertex accessed later;
s3.4, if there are still areas
Figure 397130DEST_PATH_IMAGE002
If not, jump to S3.3, otherwise, end the search.
5. A power self-healing rapid fault location method based on non-robust conditions according to claim 1, characterized in that: said S1.2 comprises
Figure 468991DEST_PATH_IMAGE002
The tree algorithm of the access of the inner nodes has the following specific flow:
s4.1, reading and accessing a certain node as an initial node;
s4.2, searching along a path which is not accessed, and accessing nodes on the path at intervals until the end node;
s4.3, backtracking to the last accessed node;
s4.4, if the node has a path which is not accessed, jumping to S4.2, otherwise, checking whether the node is a starting node, if so, finishing the search, otherwise, jumping to S4.3, and after the reading access is finished, reading the path originally containing a plurality of nodes
Figure 518987DEST_PATH_IMAGE002
Divided into a plurality of successive nodes
Figure 385312DEST_PATH_IMAGE004
6. A power self-healing rapid fault location method based on non-robust conditions according to claim 5, characterized in that: said S1.2 comprises
Figure 517828DEST_PATH_IMAGE002
When only one node which detects fault information is accessed by the access tree algorithm of the internal nodes, the following algorithm flows are adopted:
s5.1, starting reading access by taking the error reporting node as an initial node;
s5.2, shielding an adjacent node from accessing to a third node in the same path;
and S5.3, when the path is accessed, if the path cannot be judged, shielding the number of the adjacent nodes, adding the number of the adjacent nodes, and repeating the S5.2.
7. A power self-healing rapid fault location method based on non-robust conditions according to claim 1, characterized in that:
the region probing recovery step of S1.3 is as follows:
s6.1, sequencing all possible fault areas according to the sequence of the fault probability from large to small, and recovering the power supply of the low-probability areas one by one;
s6.2, extracting possible fault areas according to the sequence of the fault probability from large to small, extracting only one possible fault area each time, and stopping when one of the following conditions is met:
the sum of the failure probabilities of the extracted regions exceeds a threshold value a;
secondly, the fault probability of the (k + 1) th extracted region is lower than 1/m of the fault probability of the (k) th extracted region.
8. A power self-healing rapid fault location method based on non-robust conditions according to claim 7, characterized in that: the S1.3 probability judgment algorithm is as follows:
recording node false alarm probability P (1) = K, wherein the specific condition comprises that the probability that all the false alarms of adjacent nodes are failure-free is P (2) = K; the probability that one node false reports to be failure-free is P (3) = K (1-K); the probability that both nodes report correctly is P (3) = (1-K) × (1-K).
9. A power self-healing rapid fault location method based on non-robust conditions according to claim 8, characterized in that:
under the condition that one node in S1.3 reports fault information, if the fault information reported by the node is correct, a high-probability region exists in a nearby region, deep search is carried out through a tree algorithm, the obtained regions which are all reported as fault-free regions are marked as low-probability regions, power can be supplied one by one, and the regions which are all reported as faults are marked as high-probability regions.
10. A power self-healing rapid fault location method based on non-robust conditions according to claim 8, characterized in that: when the fault information reported by the nodes in S1.3 is a dislocation, deep search is performed by using a spaced tree algorithm, and when the number of spaced nodes exceeds three, and a second node reporting fault information is not found yet, a probability calculation formula for correct reporting is as follows:
P(4)=K*K*K。
CN202111169562.5A 2021-10-06 2021-10-06 Electric power self-healing rapid fault positioning method based on non-sound condition Active CN113608072B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202111169562.5A CN113608072B (en) 2021-10-06 2021-10-06 Electric power self-healing rapid fault positioning method based on non-sound condition

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202111169562.5A CN113608072B (en) 2021-10-06 2021-10-06 Electric power self-healing rapid fault positioning method based on non-sound condition

Publications (2)

Publication Number Publication Date
CN113608072A true CN113608072A (en) 2021-11-05
CN113608072B CN113608072B (en) 2021-12-28

Family

ID=78310812

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202111169562.5A Active CN113608072B (en) 2021-10-06 2021-10-06 Electric power self-healing rapid fault positioning method based on non-sound condition

Country Status (1)

Country Link
CN (1) CN113608072B (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN116663785A (en) * 2023-08-01 2023-08-29 国网四川省电力公司广安供电公司 Topology identification-based low-voltage fault positioning method
CN117559447A (en) * 2024-01-10 2024-02-13 成都汉度科技有限公司 Power failure studying and judging data analysis method and system based on power grid model

Citations (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20100027480A1 (en) * 2008-07-31 2010-02-04 Palchaudhuri Santashil Assigning Slots in a Mesh Network
CN104750878A (en) * 2015-04-28 2015-07-01 国网上海市电力公司 Mixed searching strategy-based topology fault diagnosis method
CN107196337A (en) * 2017-06-29 2017-09-22 广东电网有限责任公司电力调度控制中心 A kind of isolated island quiescent point method of calibration and system
CN107612970A (en) * 2017-08-16 2018-01-19 国网上海市电力公司 Big figure caching method, display methods and system based on power network topology analysis
CN108281945A (en) * 2018-04-12 2018-07-13 天津浩源慧能科技有限公司 It is a kind of based on the singlephase earth fault shielding system and partition method of applying signal outside
CN108933694A (en) * 2018-06-09 2018-12-04 西安电子科技大学 Data center network Fault Node Diagnosis method and system based on testing data
CN109558518A (en) * 2018-10-30 2019-04-02 深圳先进技术研究院 The method, apparatus and storage medium of community discovery in a kind of determining social networks
CN109613400A (en) * 2018-12-24 2019-04-12 华中科技大学 Soft straight electric network fault detection method is maked somebody a mere figurehead based on the current-limiting reactor voltage difference opposite sex
CN110571802A (en) * 2019-09-12 2019-12-13 国网山东省电力公司寿光市供电公司 Power distribution network self-healing control method and device based on rough set dynamic planning model
CN112083292A (en) * 2020-10-26 2020-12-15 积成电子股份有限公司 Power distribution network active fault studying and judging method based on multi-source non-sound information fusion

Patent Citations (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20100027480A1 (en) * 2008-07-31 2010-02-04 Palchaudhuri Santashil Assigning Slots in a Mesh Network
CN104750878A (en) * 2015-04-28 2015-07-01 国网上海市电力公司 Mixed searching strategy-based topology fault diagnosis method
CN107196337A (en) * 2017-06-29 2017-09-22 广东电网有限责任公司电力调度控制中心 A kind of isolated island quiescent point method of calibration and system
CN107612970A (en) * 2017-08-16 2018-01-19 国网上海市电力公司 Big figure caching method, display methods and system based on power network topology analysis
CN108281945A (en) * 2018-04-12 2018-07-13 天津浩源慧能科技有限公司 It is a kind of based on the singlephase earth fault shielding system and partition method of applying signal outside
CN108933694A (en) * 2018-06-09 2018-12-04 西安电子科技大学 Data center network Fault Node Diagnosis method and system based on testing data
CN109558518A (en) * 2018-10-30 2019-04-02 深圳先进技术研究院 The method, apparatus and storage medium of community discovery in a kind of determining social networks
CN109613400A (en) * 2018-12-24 2019-04-12 华中科技大学 Soft straight electric network fault detection method is maked somebody a mere figurehead based on the current-limiting reactor voltage difference opposite sex
CN110571802A (en) * 2019-09-12 2019-12-13 国网山东省电力公司寿光市供电公司 Power distribution network self-healing control method and device based on rough set dynamic planning model
CN112083292A (en) * 2020-10-26 2020-12-15 积成电子股份有限公司 Power distribution network active fault studying and judging method based on multi-source non-sound information fusion

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN116663785A (en) * 2023-08-01 2023-08-29 国网四川省电力公司广安供电公司 Topology identification-based low-voltage fault positioning method
CN116663785B (en) * 2023-08-01 2023-10-10 国网四川省电力公司广安供电公司 Topology identification-based low-voltage fault positioning method
CN117559447A (en) * 2024-01-10 2024-02-13 成都汉度科技有限公司 Power failure studying and judging data analysis method and system based on power grid model
CN117559447B (en) * 2024-01-10 2024-03-22 成都汉度科技有限公司 Power failure studying and judging data analysis method and system based on power grid model

Also Published As

Publication number Publication date
CN113608072B (en) 2021-12-28

Similar Documents

Publication Publication Date Title
CN113608072B (en) Electric power self-healing rapid fault positioning method based on non-sound condition
CN110943453B (en) Power system fault sample generation and model construction method facing transfer learning
CN112799898B (en) Interconnection system fault node positioning method and system based on distributed fault detection
CN102183708B (en) Wide-area traveling wave distance measurement method
CN103533571B (en) Fault-tolerant event detecting method based on temporal voting strategy
CN103728507A (en) Grid fault diagnosis method based on data mining
CN104750878A (en) Mixed searching strategy-based topology fault diagnosis method
CN111159922B (en) Key line identification method and device for cascading failure of power system
CN112104495A (en) System fault root cause positioning algorithm based on network topology
CN110048901B (en) Fault positioning method, device and equipment for power communication network
Yim et al. Neighbor-based malicious node detection in wireless sensor networks
CN106771875B (en) Fault-tolerant fault positioning method for power distribution network
Feng et al. Weighted distributed fault detection for wireless sensor networks Based on the distance
WO2020215505A1 (en) Multi-dimensional correlation generation method and system for network alarm rules
CN109635430B (en) Power grid transmission line transient signal monitoring method and system
CN104954164A (en) Method for fault tolerance of data center network structure
CN109561480A (en) A kind of base station location method for correcting error and system
CN106646106B (en) Electric network fault detection method based on outlier's detection technology
CN110412417A (en) Micro-capacitance sensor data fault diagnostic method based on intelligent power monitoring instrument table
CN108256536B (en) Power network situation perception method and device based on geographical position relation
De Sousa et al. Event detection framework for wireless sensor networks considering data anomaly
CN115436750A (en) Power grid fault point positioning method
CN108090616A (en) A kind of electric system Active Splitting optimal section searching method
CN113075498A (en) Power distribution network traveling wave fault positioning method and system based on residual error clustering
Wang et al. A fault detection scheme based on self-clustering nodes sets for wireless sensor networks

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