Power distribution network line fault positioning method and system based on fault indicator

Abstract

The invention relates to the technical field of fault positioning, in particular to a power distribution network line fault positioning method and system based on a fault indicator, and the method comprises the following steps: obtaining node current data, calculating a jump rate, screening an early warning node, recognizing an intersection section, determining a fault position, and generating a recognition result. According to the invention, through collecting periodic current data of each node fault indicator, combining node numbers and topological structure mapping, systematically establishing a current sequence table and calculating a current increment difference value in unit time, and through grade division and periodic stability identification of a jump rate, key nodes with early warning characteristics can be accurately screened. The method comprises the following steps of: acquiring a path intersection area, positioning a fault centralized distribution section by virtue of jump intensity trend change analysis of the path intersection area, and determining a fault initial position and a grade identifier in combination with a comparison relationship between a sampling time point and trigger delay between nodes, so that accurate identification and quick response of a multi-path fault are realized under a complex topological structure of a power distribution network.

Description

Technical Field

[0001] This invention relates to the field of fault location technology, and in particular to a method and system for locating faults in distribution network lines based on fault indicators. Background Technology

[0002] The field of fault location technology involves the detection, location, and diagnosis of faults occurring in power systems. Core aspects include power line fault detection and location technology, electrical signal acquisition and analysis, line status monitoring, and distribution network operation safety assessment. Its overall technical field encompasses various fault identification methods in transmission and distribution systems, focusing on how to accurately and promptly determine the location of faults during distribution network operation to ensure power supply reliability and operational efficiency. It typically relies on the characteristics of electrical quantity changes, signal propagation characteristics, and information collected by monitoring devices to identify and judge power equipment faults. Traditional distribution network line fault location methods involve monitoring changes in power parameters using measuring devices such as current transformers or voltage transformers installed on the line, and combining this with phasor measurement devices to analyze current surge characteristics or voltage drop signals to determine whether short circuits, grounding faults, etc., have occurred. Then, based on the direction of the fault current, the amplitude of voltage changes, or the difference in signals at both ends, the fault section or specific location is estimated. Methods such as impedance methods, current traveling wave methods, or voltage traveling wave methods are commonly used, comparing and calculating the voltage and current waveforms at both ends of the line to locate the fault area.

[0003] Traditional fault location methods for power distribution networks rely on current transformers or voltage transformers installed on the lines to monitor electrical parameters. The overall fault judgment process is limited by the fixed location and limited number of measurement points, resulting in insufficient coverage in urban power distribution networks with multiple intersecting branches. It is difficult to capture the instantaneous current characteristics of the fault in time. At the same time, the method of comparing waveform differences at both ends will have reduced location accuracy when encountering signal distortion or noise interference. In short-term sudden faults or multi-point disturbance scenarios, there is a risk of misjudgment and missed judgment. In addition, existing technologies generally lack the ability to dynamically analyze the network topology, and cannot effectively determine the propagation path and changing trend of the fault in the branch path. This results in insufficient granularity of fault location, which is difficult to meet the high accuracy and high response speed operation guarantee requirements of urban power distribution systems. Summary of the Invention

[0004] To address the technical problems existing in the prior art, embodiments of the present invention provide a method for fault location in distribution network lines based on fault indicators, comprising the following steps: To achieve the above objectives, the present invention adopts the following technical solution: a fault location method for distribution network lines based on fault indicators, comprising the following steps: S1: Obtain the periodic current readings output by the short-circuit current indicator and the ground current indicator on the distribution cable node, summarize them by node number and establish a node mapping to generate a node current sequence table. S2: Based on the current readings of each node in the node current sequence table for two consecutive sampling periods, calculate the current increment of each node per unit time, output the jump rate value, sort the jump rate values ​​along the path direction, and generate a path jump rate map. S3: Based on the current periodic jump rate value of each node in the path jump rate graph, compare it sequentially with the preset warning level threshold, and record whether the rate value in a continuous period stably exceeds the corresponding level threshold, filter the warning nodes, and generate a path warning node list. S4: Based on the path warning node list, retrieve the path convergence point where the warning nodes intersect, retrieve the change trend of jump rate change intensity on the preceding and following paths, determine the jump increase interval and record the span interval and change node number, delineate the fault concentration distribution area, and generate the intersection segment identification table. S5: Based on all nodes in the intersection segment identification table, record the sampling time point of the first jump rate surge, calculate the jump trigger delay intensity of adjacent nodes, locate the node number with the earliest trigger time, combine it with the warning level of the path warning node list, determine the fault location, and generate the power distribution line fault identification result.

[0005] As a further embodiment of the present invention, the node current sequence table includes node number mapping, periodic current data sequence, and topological correspondence; the path jump rate diagram includes node sequence position, current change rate per unit time, and path direction sorting information; the path warning node list includes jump rate level marker, warning node number, and number of warning cycles; the intersection segment identification table includes jump increase interval, intersection node number, and fault concentration segment location interval; and the distribution line fault identification result includes fault node number, earliest trigger time point, and comprehensive warning level.

[0006] As a further aspect of the present invention, when establishing node mapping, the mapping is performed according to the deployment location and numbering order of the short-circuit current indicator and the ground current indicator, and the connection relationship in the main-branch topology diagram of the distribution network line.

[0007] As a further aspect of the present invention, the fault concentration distribution area specifically refers to a segment area that conforms to an increasing trend and whose intersection area covers two branches.

[0008] As a further aspect of the present invention, the step of obtaining the node current sequence table is as follows: S111: Obtain the periodic current readings of the short-circuit current indicator and the grounding current indicator on the distribution cable node of the urban branch road, and rearrange all current readings collected in each sampling period according to the node number corresponding to each node, number and aggregate the current readings with the same sampling time label, and construct a current value data set indexed by the node number to obtain the numbered current data set. S112: Based on the numbered current data set, extract the physical deployment location parameters and numbering sequence parameters corresponding to each node, perform structural retrieval on the connection relationship between node numbers, extract the adjacent node pairs in the trunk-branch topology diagram corresponding to the connection relationship, and map the node numbers to the physical connection relationship one by one to establish a node topology mapping relationship table. S113: Based on the connection order mapped in the established node topology mapping relationship table, perform a sequence reconstruction operation on the numbered current data set, concatenate the current values ​​of adjacent nodes into a current vector according to the topology connection order, and perform periodic indexing and number labeling on all concatenated current vectors to generate a node current sequence table.

[0009] As a further aspect of the present invention, the step of obtaining the path jump rate map is as follows: S211: Based on the current readings of each node in the node current sequence table for two consecutive sampling periods, extract the node current vector value of the current period and the previous period, calculate the numerical difference of the current values ​​of the two periods under the same node number, obtain the current increment sequence under each node number, extract the sampling period time constant, divide the current increment by the sampling period time length, and perform unit time normalization processing on all node numbers in sequence to generate the current change rate matrix. S212: Based on the jump rate values ​​of each node in the current change rate matrix, and combined with the connection order index of each node number in the network structure, extract the arrangement order of the node number in the topology path from the node current sequence table, and reorder the jump rate values ​​according to the topology path order to construct an ordered jump rate list and obtain the topology sorted jump sequence. S213: Based on the arrangement of the jump rates of each node in the topological sort jump sequence, draw the jump rate values ​​corresponding to the adjacent node numbers into a directed path structure graph in sequence, and label the path direction and jump rate value. Set the jump rate label value for each connecting edge in the graph to generate a path jump rate graph.

[0010] As a further aspect of the present invention, the step of obtaining the path warning node list is as follows: S311: Based on the jump rate value of each node in the current period of the path jump rate graph, compare it with the preset jump rate level 1 threshold, level 2 threshold and level 3 threshold in sequence, and use the interval comparison method to determine whether the jump rate falls into any level threshold interval. Record the level judgment result of each node in the current period according to the node number, and generate a node jump level mark table. S312: Based on the node level judgment result in the node jump level marking table, and combined with the corresponding node level data of the previous period, compare the current level with the level of the previous period node by node. If the level of two consecutive periods meets the condition of the corresponding level or above, then mark the node as a continuous jump node and obtain the continuous level matching node set. S313: Based on the node number in the continuous level matching node set, read the number index and the corresponding branch path code in the topology structure, and write the nodes that meet the different level conditions of level 1, level 2, and level 3 into the structured registration according to their corresponding branch paths to generate a path warning node list.

[0011] As a further aspect of the present invention, the step of obtaining the intersection segment identification table is as follows: S411: Based on the node number and the path number recorded in the path warning node list, extract the spatial coordinate values ​​of each node in the topology and construct a node distribution sequence according to the path dimension. If there are consecutive or shared nodes in two branch paths, mark the nodes as potential intersection points and combine their spatial coordinates to aggregate and identify the nodes in the path intersection area to generate a candidate set of path intersection points. S412: Based on the node number of each node in the candidate set of path intersection points, read the preceding and following jump rate data on the path, perform differential operation on the jump values ​​of adjacent nodes and establish a differential sequence, calculate the monotonicity of the change direction in the differential sequence, and if the jump values ​​of consecutive nodes show a monotonically increasing trend, record the starting and ending node numbers of the corresponding segment and the path span range to obtain the jump increasing interval description set. S413: Based on the segment intervals marked in the description set of the jump increasing interval, extract the set of branch numbers covered by the path span, determine whether it covers two or more branch paths, and if the condition is met, perform fault area marking operation on the segment interval to generate an intersection segment identification table.

[0012] As a further aspect of the present invention, the step of obtaining the fault identification result of the power distribution line is as follows: S511: Obtain the number index of all intersection nodes in the intersection segment identification table, extract the time series index value, locate the first sudden increase in the jump rate for each node number in the multi-cycle jump data, the sudden increase is defined as the jump rate change value being greater than the set jump trigger benchmark value, record the minimum time index value that meets the condition as the jump trigger time point, and obtain the jump trigger time mapping table. S512: Based on the jump trigger time mapping table, for adjacent nodes with consecutive numbers in each intersection path, the jump trigger time is compared sequentially according to the path direction, the difference between the time indices of the two nodes is calculated, the jump trigger delay intensity value between the nodes is obtained, the node number with the earliest jump and the corresponding path start position are recorded, and a jump trigger delay matrix is ​​constructed. S513: Based on the earliest node number of the transition trigger delay matrix, extract the warning level record of the corresponding node in the path warning node list, construct a binary combination pair to represent the fault trigger priority structure, and combine the path topology mapping to determine whether the node is located at the intersection of multiple branches. The node number that meets the conditions is output as the identifiable fault location under the current power distribution network, and the power distribution line fault identification result is generated.

[0013] A fault location system for distribution network lines based on fault indicators includes: The node acquisition initialization module is used to execute S1: acquire the periodic current readings output by the short-circuit current indicator and the ground current indicator on the distribution cable node, summarize them by node number and establish node mapping, and generate a node current sequence table; The jump rate extraction module is used to perform S2: based on the current readings of each node in the node current sequence table for two consecutive sampling periods, calculate the current increment of each node per unit time, output the jump rate value, sort the jump rate values ​​along the path direction, and generate a path jump rate map. The warning node determination module is used to execute S3: based on the current periodic jump rate value of each node in the path jump rate map, compare it sequentially with the preset warning level threshold, and record whether the rate value in the continuous period stably exceeds the corresponding level threshold, filter the warning nodes, and generate a path warning node list. The intersection section identification module is used to perform S4: based on the path warning node list, retrieve the path convergence point where the warning nodes intersect, retrieve the change trend of jump rate change intensity on the front and back paths, determine the jump increase interval and record the span interval and change node number, delineate the fault concentration distribution area, and generate an intersection section identification table. The fault location confirmation module is used to execute S5: based on all nodes in the intersection segment identification table, record the sampling time point of the first jump rate surge, calculate the jump trigger delay intensity of adjacent nodes, locate the node number with the earliest trigger time, combine it with the warning level of the path warning node list, determine the fault location, and generate the power distribution line fault identification result.

[0014] Compared with the prior art, the advantages and positive effects of the present invention are as follows: In this invention, by collecting periodic current data from fault indicators at each node, and combining node numbers with topology mapping, a current sequence table is systematically established and the difference in current increment per unit time is calculated. This allows for the acquisition of the jump rate ranking results along the path. By classifying the jump rate levels and identifying periodic stability, key nodes with early warning characteristics can be accurately screened. Furthermore, by analyzing the trend of jump intensity changes in the path intersection area, the location of the concentrated fault distribution section can be achieved. Combined with the comparison between sampling time points and trigger delays between nodes, the initial fault location and level identifier can be determined. Thus, accurate identification and rapid response to multi-path faults can be achieved under complex distribution network topology. Attached Figure Description

[0015] To more clearly illustrate the technical solutions in the embodiments of the present invention, the accompanying drawings used in the description of the embodiments will be briefly introduced below. Obviously, the accompanying drawings described below are only some embodiments of the present invention. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0016] Figure 1 This is a schematic diagram of the steps of the present invention; Figure 2 This is a flowchart of the node current sequence table acquisition process of the present invention; Figure 3 This is a flowchart of the path jump rate map acquisition process of the present invention; Figure 4 This is a flowchart of the process for obtaining the path warning node list in this invention; Figure 5 This is a flowchart of the process for obtaining the intersection segment identification table in this invention; Figure 6 This is a flowchart of the process for obtaining the fault identification results of power distribution lines according to the present invention; Figure 7 This is a system module diagram of the present invention. Detailed Implementation

[0017] The technical solution of the present invention will now be described with reference to the accompanying drawings.

[0018] In embodiments of the present invention, words such as "exemplarily," "for example," etc., are used to indicate that something is an example, illustration, or description. Any embodiment or design described as "exemplary" in the present invention should not be construed as being more preferred or advantageous than other embodiments or designs. Specifically, the use of the word "exemplary" is intended to present the concept in a concrete manner. Furthermore, in embodiments of the present invention, the meaning expressed by "and / or" can be both, or either one.

[0019] In the embodiments of this invention, the terms "image" and "picture" may sometimes be used interchangeably. It should be noted that, without emphasizing the distinction between them, they convey the same meaning. Similarly, the terms "of," "corresponding (relevant)," and "corresponding" may sometimes be used interchangeably. It should be noted that, without emphasizing the distinction between them, they convey the same meaning.

[0020] In this embodiment of the invention, sometimes a subscript such as W1 may be written in a non-subscript form such as W1. When the difference is not emphasized, the meaning they express is the same.

[0021] To make the technical problems, technical solutions and advantages of the present invention clearer, a detailed description will be given below in conjunction with the accompanying drawings and specific embodiments.

[0022] Please see Figure 1 This invention provides a method for locating faults in distribution network lines based on fault indicators, comprising the following steps: S1: Obtain the periodic current readings output by the short-circuit current indicator and the grounding current indicator installed on the nodes of the multi-branch power distribution cable in the city. Summarize the current values ​​of all nodes in the same sampling period according to the node number to form a current sequence. Establish node mapping according to the deployment location, numbering order and connection relationship in the trunk-branch topology diagram to generate a node current sequence table. S2: Based on the current readings of each node in the node current sequence table for two consecutive sampling periods, calculate the current increment of each node per unit time, divide the result of subtracting the previous period's reading from the current current reading by the sampling period time, output the jump rate value, and combine the position order of each node in the network structure to sort the jump rate values ​​along the path direction to generate a path jump rate map. S3: Based on the current periodic jump rate value of each node in the path jump rate graph, compare it sequentially with the preset jump rate level 1, 2 and 3 threshold values, and record whether the rate value in a continuous period stably exceeds the corresponding level threshold. Filter out early warning nodes that meet different levels, write the node number and its branch path in the topology structure into the level registration structure, and generate a path early warning node list. S4: Based on the path and distribution location of each node in the path warning node list, retrieve the path convergence point where the warning nodes intersect, retrieve the change trend of jump rate change intensity on the preceding and following paths, determine the jump increase interval and record the span interval and change node number, and delineate the segment area that meets the increase trend and whose intersection area covers two branches as the fault concentration distribution area, and generate the intersection segment identification table. S5: Based on all nodes in the intersection segment identification table, record the sampling time point of the first jump rate surge, calculate the jump trigger delay intensity of adjacent nodes, locate the node number with the earliest trigger time, combine it with the warning level in the path warning node list, determine the identifiable fault location in the current power distribution network, and generate the power distribution line fault identification result.

[0023] The node current sequence table includes node number mapping, periodic current data sequence, and topological correspondence. The path jump rate diagram includes node sequence position, current change rate per unit time, and path direction sorting information. The path warning node list includes jump rate level markers, warning node numbers, and the number of warning cycles. The intersection segment identification table includes jump increase intervals, intersection node numbers, and fault concentration segment location intervals. The distribution line fault identification results include fault node number, earliest trigger time point, and comprehensive warning level.

[0024] Please see Figure 2 The specific steps of S1 are as follows: S111: Obtain the periodic current readings of the short-circuit current indicator and the grounding current indicator on the distribution cable node of the urban branch road, and rearrange all current readings collected in each sampling period according to the node number corresponding to each node, number and aggregate the current readings with the same sampling time label, and construct a current value data set indexed by the node number to obtain the numbered current data set. To acquire periodic current readings from short-circuit current indicators and grounding current indicators installed at multiple branch distribution cable nodes in the city, the physical connection status of the indicators at each distribution cable node is first confirmed to ensure that both the short-circuit current indicator and the grounding current indicator are energized. A clock synchronization module is activated during the sampling period to unify the data acquisition time of each node. Then, the current value output by each node within the same sampling period is read. During the reading process, the analog signal voltage value generated by the current sensing element inside the indicator is called, and the analog voltage signal is converted into a digital current value using an analog-to-digital converter. The current value data is recorded every second as a sampling period. For example, if the short-circuit current value of a node is 12.4A and the grounding current value is 1.3A in the first period, the current value in the second period... The internal short-circuit current is 13.1A and the ground current is 1.1A. The resulting node current time series consists of two rows of current data. Next, a node number label is added to the current value data of each node, numbered sequentially according to the deployment planning document, for example, from N001 to N128, totaling 128 nodes. For all nodes, the current value data acquired in the t-th sampling period is arranged in a 128-dimensional array according to the node number and recorded in the number-time index table. Then, the current sampling period timestamp is used, and the sampling period t is marked at the beginning of the current current series as a time anchor point, thus constructing a periodic current dataset with numbers and time indices. For example, at t=5 seconds, the current values ​​output by nodes N001-N128 are shown in Table 1: Table 1. Correspondence between node number and current value within a 5-second cycle. Node number Short-circuit current (A) Grounding current (A) N001 11.2 0.9 N002 12.5 1.0 N003 10.7 1.1 …… …… …… N128 13.0 1.2 As shown in Table 1, a complete current reading data structure can be constructed by unifying the time period and aligning the numbers. Then, each row of data in the table is aggregated in two channels, that is, the short-circuit current and ground current values ​​under the same node number are constructed into a binary pair, forming 128 binary current pair arrays. Finally, the set of current readings of the numbered nodes in the period is returned in array form, that is, the numbered current data set.

[0025] S112: Based on the numbered current data set, extract the physical deployment location parameters and numbering sequence parameters corresponding to each node, perform structural retrieval on the connection relationship between node numbers, extract the adjacent node pairs in the trunk-branch topology diagram corresponding to the connection relationship, and map the node number to the physical connection relationship one by one to establish a node topology mapping relationship table; Based on the numbered current data set, the deployment location information corresponding to each node number is first retrieved. The deployment location is given by the coordinate system in the city cable routing diagram. For example, N001 is deployed at coordinates (23, 41), N002 is deployed at (24, 42), and so on. The deployment order index is then retrieved to extract the numbering mapping relationship between the main path and the branch path. This mapping relationship is expressed in the form of a topology connection diagram. The main path numbers are N001-N010, branch 1 is numbered N011-N020, branch 2 is numbered N021-N030, etc. The node connection matrix recorded in the system configuration file is then retrieved. In the connection matrix, if there is a connection between node i and node j, the corresponding position is 1; otherwise, it is 0. For example, if N001 and N002 are connected, then the matrix element M... 12 =1, then iterate through each row of the connection matrix, filter out the column index of the non-zero element to identify the adjacent connection nodes of the node, and then form connection pairs with the node number and its connecting node number, such as (N001, N002), (N002, N003), etc., and mark the connection type as "backbone connection" or "branch connection", for example (N011, N012) belongs to branch 1 connection. The topology connection table structure is formed by aggregating the connection pairs, and a mapping table is built for all node pairs in this structure. The mapping table fields are: source node number, target node number, connection type, deployment coordinates, and relative topology position, as shown below: Table 2 Node Topology Connection Relationship Mapping Table Source node number Target node number Connection type Source coordinates Target coordinates N001 N002 backbone connection （23，41） （24，42） N002 N003 backbone connection （24，42） （25，43） N011 N012 Branch connection （30，50） （31，51） Referring to Table 2, all connections are precisely marked, and subsequent operations will use this connection order as a reference to establish a node topology mapping table.

[0026] S113: Based on the connection order mapped in the established node topology mapping table, perform sequence reconstruction operation on the numbered current data set, concatenate the current values ​​of adjacent nodes into current vectors according to the topology connection order, and perform periodic indexing and number labeling on all concatenated current vectors to generate a node current sequence table. Based on the connection order mapped in the established node topology mapping table, the current tuple value corresponding to each node number in the numbered current data set is called. Then, according to the connection pairs marked in Table 2, the current data pairs of the source node and the target node are extracted item by item to form a topology sequence splicing vector. Specifically, if the first connection pair in Table 2 is (N001, N002), and its corresponding current values ​​within the t=5s sampling period are (11.2A, 0.9A) and (12.5A, 1.0A) respectively, then the spliced ​​current vector is (11.2, 0.9, 12.5, 1.0). This process is repeated for all connection pairs. The same splicing process yields multiple current feature vector groups of length 4. These spliced ​​vectors are then numbered according to their connection order to generate a current sequence structure. Each set of current spliced ​​vectors is accompanied by a source number, a target number, and a sampling period label, generating a structured vector table. The fields of this table are: time label, connection pair number, node pair number, and current vector. For example, at t=5s, the spliced ​​vector of connection pair 1 is (11.2, 0.9, 12.5, 1.0), connection pair 2 is (12.5, 1.0, 10.7, 1.1), and so on. By traversing and aggregating all connection pair vectors, the node current sequence table is finally generated.

[0027] Please see Figure 3 The specific steps of S2 are as follows: S211: Based on the current readings of each node in the node current sequence table for two consecutive sampling periods, extract the node current vector value of the current period and the previous period, calculate the numerical difference of the current values ​​of the two periods under the same node number, obtain the current increment sequence under each node number, extract the sampling period time constant, divide the current increment by the sampling period time length, and perform unit time normalization processing on all node numbers in turn to generate the current change rate matrix. Based on the current readings of each node in the node current sequence table for two consecutive sampling periods, the sequence table structure is first deconstructed, and all node numbers at the specified time points are extracted. and The current value at time t is represented by a two-dimensional array, with rows being node numbers and columns being time series indices. Then, using the node number as the index, the current values ​​at two time points of the same node are subtracted to obtain the current increment matrix. For example, node N001 at... The current per second is 12.6A. If the current increment is 11.2A per second, then the current increment is... A. Next, obtain the sampling period constant τ. In this system, τ is configured to be 1 second. Call τ to perform normalization calculation on the current increment value of each node. The formula is as follows: That is, the rate of change per unit time. Continuing with the above example, the rate of change of node N001 is... A / s, this calculation process is performed sequentially for all node numbers to obtain the set of unit time switching rates for all nodes. This set is then structured into a matrix form, with matrix fields including node number, current current, previous cycle current, current difference, and switching rate, as shown in Table 3. Table 3 Calculation Table of Current Jump Rate Node number Current current (A) Current in the previous cycle (A) Current increment (A) Jump rate (A / s) N001 12.6 11.2 1.4 1.4 N002 10.3 10.8 -0.5 -0.5 N003 11.7 11.7 0.0 0.0 Referring to Table 3, the switching rate is obtained by dividing the current difference between two cycles by the sampling period. This operation is performed in batches for all nodes, and finally, a current change rate matrix is ​​generated.

[0028] S212: Based on the jump rate values ​​of each node in the current change rate matrix, and combined with the connection order index of each node number in the network structure, extract the arrangement order of the node number in the topology path from the node current sequence table, and reorder the jump rate values ​​according to the topology path order to construct an ordered list of jump rates and obtain the topology sorted jump sequence. Based on the node numbers and corresponding hopping rate values ​​recorded in the current rate of change matrix, the connection order information of the nodes in the network is obtained. This connection order information originates from the node topology graph, in which each node has a clear upstream and downstream connection relationship. This connection structure table is called to extract the arrangement order of the node numbers in the topology path. This order structure is compared with the node number order in the hopping rate matrix, and the hopping rate values ​​are reordered. Specifically, the topology path number sequence is traversed, and for each number in the sequence, the corresponding hopping rate value is found and sorted in order. The sequence is written into a new sequence structure. For example, if the topological path order is [N003, N001, N002], and the corresponding jump rate values ​​in the matrix are N003: 0.0, N001: 1.4, and N002: -0.5, then the sorted result is [0.0, 1.4, -0.5]. At the same time, the corresponding index is retained to form a sequence key-value pair structure, which constitutes an ordered list of jump rates. Each element consists of a tuple structure of number and jump rate. The sequence data structure fields are path position, node number, and jump rate value. Finally, the topological sorted jump sequence is obtained.

[0029] S213: Based on the arrangement of the jump rates of each node in the topological sort jump sequence, draw the jump rate values ​​corresponding to the adjacent node numbers into a directed path structure graph in sequence, and label the path direction and jump rate value. Set the jump rate label value for each connecting edge in the graph to generate a path jump rate graph. Based on the arrangement of all node numbers and jump rate values ​​in the topological sort jump sequence, directed edges are constructed according to adjacent numbers in the topological structure. The source and target numbers connected by each edge are used as the start and end points of the path direction. The jump rate values ​​of all edges on the path are labeled with edge weights according to the jump rate recorded by the node number. For example, if N003 is connected to N001 and N001 is connected to N002 in the path, the drawing structure is the directed path N003→N001→N002. The weights of each edge are added: N003→N001 is 1.4 and N001→N002 is -0.5. This graph is drawn in the form of a path graph structure, with each node as a graph vertex and the connection between each pair of nodes as a directed edge. Jump rate labels are attached to the edges. The font of the edge weight label is set to standard bold, the font size is 10, and the edge color is set to gray-black to ensure that the jump rate values ​​are clearly identifiable. The path direction is drawn in numerical order to form a complete path graph structure, and finally, a path jump rate graph is generated.

[0030] Please see Figure 4 The specific steps of S3 are as follows: S311: Based on the jump rate value of each node in the current period of the path jump rate graph, compare it with the preset jump rate level 1 threshold, level 2 threshold and level 3 threshold in turn, and use the interval comparison method to determine whether the jump rate falls into any level threshold interval. Record the level judgment result of each node in the current period according to the node number, and generate a node jump rate mark table. Based on the current cycle transition rate value of each node in the path transition rate graph, the current transition rate value is extracted for each node number and compared item by item with the system's preset transition rate level thresholds. The set transition rate thresholds are: Level 1 threshold of 2.0 A / s, Level 2 threshold of 3.5 A / s, and Level 3 threshold of 5.0 A / s. The level intervals are defined using a non-overlapping interval method, where 0 to 2.0 is the no-warning zone, 2.0 to 3.5 is the Level 1 interval, and 3.5 to 5.0 is the Level 2 interval. Values ​​greater than 5.0 are classified as Level 3 intervals. All node numbers are traversed, and their transition rate values ​​are extracted. Interval judgment logic determines the transition level of each node. If a node N005 has a transition rate of 3.9A / s, it falls into the Level 2 interval and is marked as "Level 2 Warning." If N010 has a transition rate of 1.8A / s, it belongs to the "No Warning" interval. The judgment results are recorded in a structured format using the node number as an index. Fields include node number, transition rate, and level judgment result. Example data is shown in Table 4 below. Table 4. Node Jump Level Determination Table Node number Jump rate (A / s) Level determination N003 2.2 Level 1 warning N005 3.9 Level II Warning N007 5.6 Level III Warning N010 1.8 No warning As shown in Table 4, the system has completed the rate judgment of all nodes in the current cycle and labeled the corresponding levels, and finally generated a node jump level label table.

[0031] S312: Based on the node level judgment result in the node jump level marking table, and combined with the corresponding node level data of the previous period, compare the current level with the level of the previous period for each node. If the level of two consecutive periods meets the condition of the corresponding level or above, then mark the node as a continuous jump node and obtain the continuous level matching node set. Based on the level results of all nodes in the current period in the node jump level label table, the level results of the same node number in the previous period are extracted in pairs to form a pairing structure of the current level and the historical level. For each pair, a consistency judgment is performed, that is, to determine whether the level remains unchanged or is in the same level range in two periods. If the level meets the level range of level one or above in consecutive periods, it is regarded as a level abnormal node with stable jump and its number is recorded. During execution, the judgment result is marked by Boolean flags. A value of 1 is assigned to a node that matches successfully and a value of 0 is assigned to a node that does not match successfully. The node numbers assigned a value of 1 are counted. Example data is shown in Table 5 below: Table 5 Node-level Continuous Screening Results Node number Current level Previous level Continuous matching marker N003 Level 1 warning Level 1 warning 1 N005 Level II Warning Level 1 warning 0 N007 Level III Warning Level III Warning 1 N010 No warning No warning 0 As shown in Table 5, only N003 and N007 meet the requirement of consistent continuous period level. The system marks them as sustainable identification nodes and finally obtains the set of nodes with consistent continuous level.

[0032] S313: Based on the node number in the continuous level matching node set, read the number index and the corresponding branch path code in the topology structure, and write the nodes that meet the conditions of different levels (level 1, level 2, and level 3) into the structured registration according to their corresponding branch paths to generate a path warning node list; Based on the node numbers listed in the persistent level matching node set, retrieve the branch path number information corresponding to each node number from the node topology diagram. Simultaneously, extract the absolute position index value of this number in the topology, and perform structural annotation on the level type to construct a hierarchical registration structure. The record fields are: node number, level label, branch number, and persistent period count. The persistent period count is recorded as 2 by default in this step (current and previous periods). Nodes are also clustered and archived according to their branch numbers, and within the same branch, they are sorted by level from highest to lowest, as shown in Table 6 below. Table 6. Path Early Warning Node Level Registration Form Node number Branch road Level Labels Duration period N007 Branch Road 03 Level III Warning 2 N003 Branch Road 01 Level 1 warning 2 As shown in Table 6, the system has completed the branch grouping and level archiving registration of nodes that meet the continuous level matching conditions, and finally generated a list of path warning nodes.

[0033] Please see Figure 5 The specific steps of S4 are as follows: S411: Based on the node number and the path number recorded in the path warning node list, extract the spatial coordinate values ​​of each node in the topology and construct a node distribution sequence according to the path dimension. If there are consecutive or shared nodes in two branch paths, mark the nodes as potential intersection points and combine their spatial coordinates to aggregate and identify the nodes in the path intersection area to generate a candidate set of path intersection points. Based on the path and spatial distribution of nodes recorded in the path warning node list, the unique number of each warning node in the topology diagram and the branch number of its path are first obtained. Then, the physical spatial coordinate information corresponding to each node in the topology is called to construct a path node distribution coordinate sequence. Subsequently, the node number sequences within a path are sorted based on the branch path. Next, the node number sequences between different paths are compared. If two branch paths contain nodes with the same number or nodes with adjacent numbers differing by 1, it is considered that there is path overlap or boundary intersection. The node number is marked as a candidate value for the intersection point. For example, if node N022 belongs to both branch 03 and branch 05, or N045 and N046 belong to branch 01 and branch 02 respectively, and their numbers are consecutive, they can be determined as intersection nodes. These node numbers are recorded, and their path information is aggregated to form a cross-structure tuple. A schematic structure is shown in Table 7 below. Table 7 Candidate Path Intersection Points Node number Path 1 Path 2 Node x-coordinate Node ordinate N022 Branch Road 03 Branch Road 05 132.4 98.1 N045 Branch Road 01 Branch Road 02 115.0 87.2 As shown in Table 7, all nodes that satisfy the intersection relationship are identified and their path information and spatial location are extracted, and finally a candidate set of path intersection points is generated.

[0034] S412: Based on the node number of each node in the candidate set of path intersection points, read the preceding and following jump rate data on the path, perform differential operation on the jump values ​​of adjacent nodes and establish a differential sequence, calculate the monotonicity of the change direction in the differential sequence, if the jump values ​​of consecutive nodes show a monotonically increasing trend, record the starting and ending node numbers of the corresponding segment and the path span range, and obtain the jump increasing interval description set. Based on all node numbers in the candidate set of path intersection points, the jump rate values ​​of the adjacent upstream and downstream nodes on the path of each node are extracted. A three-point sliding window structure is constructed, with the intersection node as the center point, extracting the node number and its corresponding jump rate of the node before and after it. The rate difference in the sliding window is calculated, specifically the difference between the rate of the subsequent node minus the rate of the current node and the difference between the rate of the current node minus the rate of the preceding node, denoted as […]. and If both are positive and satisfy the condition... and If the jumps show an increasing trend, the start and end numbers of the sliding window are recorded. For example, in the path segment N031→N032→N033, the jump rates are 2.1, 2.9, and 3.7 A / s, respectively, with corresponding differences of 0.8 and 0.8, which meet the increasing condition. The increasing interval is recorded as [N031, N033] and written into the interval structure. At the same time, the path number and interval span of the interval are marked to form a structured record. Finally, the jump increasing interval description set is obtained.

[0035] S413: Based on the segment intervals marked in the description of the jump-incrementing intervals, extract the set of branch numbers covered by the path span, determine whether it covers two or more branch paths, and if the condition is met, perform fault area marking operation on the segment intervals to generate an intersection segment identification table. Based on all records of the jump-incrementing interval description set, the list of path numbers they cover is extracted. The path numbers of the starting and ending nodes of each interval are compared. If the starting and ending nodes belong to different branch paths or the nodes within the interval are distributed across two or more path numbers, then the jump interval is considered to span multiple branches and has an intersection property. It is marked as an intersection segment, and a fault identification and labeling operation is performed on the segment. The structure fields are segment starting number, ending number, number of span paths, change trend type, and intersection center number. Taking the segment [N031, N033] as an example, if N031 and N033 belong to branch 01 and branch 03 respectively, then the number of span paths is 2, the change type is jump-incrementing, and the intersection center is set to N032. The schematic structure is shown in Table 8 below: Table 8. Structure Table for Identifying Intersecting Segments Starting point number End point number Path count Trend type Interchange Center N031 N033 2 Jump increment N032 N045 N048 3 Jump increment N046 As shown in Table 8, path segments that meet the requirements of cross-path and have a clear increasing trend have been identified and archived, and finally, an intersection segment identification table is generated.

[0036] Please see Figure 6 The specific steps of S5 are as follows: S511: Obtain the index of the number of all intersection nodes in the intersection segment identification table, extract the time series index value, locate the moment of the first sudden increase in the jump rate in the multi-cycle jump data for each node number, the sudden increase is defined as the jump rate change value being greater than the set jump trigger benchmark value, record the minimum time index value that meets the condition as the jump trigger time point, and obtain the jump trigger time mapping table. Obtain the node number and its corresponding path number from the intersection segment identification table. Call the time series value corresponding to each node in the jump rate sequence. Iterate through the jump rate change process of each node according to its number, identifying the time point at which the jump rate first surges in multiple consecutive sampling periods. Set the surge judgment benchmark value to 1.2 A / s and perform a threshold judgment operation. If the jump rate of node N031 is 0.9 A / s in the 6th sampling period and changes to 2.3 A / s in the 7th period, with a jump increment of 1.4 A / s, it meets the jump surge condition. Then, record the 7th period as its jump trigger time point. Based on this, establish a mapping structure between the node number and the corresponding jump time index value for all nodes, constructing a jump trigger record table structure. The structure fields are node number, sampling time index, and jump rate value. The illustrative data is shown in Table 9 below. Table 9 Jump Trigger Time Mapping Table Node number Sampling time point (s) Jump rate (A / s) N031 7 2.3 N032 8 3.1 N045 6 2.6 As shown in Table 9, the first trigger time of the jump for all nodes that meet the sudden rise condition is marked, and the jump trigger time mapping table is finally obtained.

[0037] S512: Based on the jump trigger time mapping table, for consecutively numbered adjacent nodes within each intersection path, the jump trigger times are compared sequentially according to the path direction, and the difference in time indices between the two nodes is calculated using the formula: ; The algorithm calculates and obtains the transition trigger delay strength value between nodes, records the node number of the earliest transition and the corresponding path start position, and constructs a transition trigger delay matrix; where, Represents a node With nodes The transition trigger delay intensity, in seconds. , They are nodes ,node The jump trigger time, in seconds. , They are nodes , The physical location on the power distribution path, in meters. This indicates the speed at which signals propagate in a power distribution network, measured in meters per second. Based on all trigger time values ​​in the jump trigger time mapping table, the jump propagation intensity between each pair of nodes is calculated according to the order of adjacent node numbers in the intersection path. The physical distance between adjacent nodes is obtained, and their physical location coordinates in the path are retrieved. The propagation speed constant set in the system configuration is then called. The overall propagation delay is calculated in seconds to obtain the transition delay strength between each pair of nodes. If nodes N031 and N032 transition at the 7th and 8th seconds respectively, and their physical distance difference is 100 meters, then the delay strength is calculated as follows: The process iterates through all adjacent node pairs for seconds and establishes a propagation strength matrix, ultimately generating a transition trigger delay matrix.

[0038] The overall operational logic of the formula is modeled around the propagation process triggered by transitions between nodes. It reflects the transmission characteristics of transition signals in the power distribution network by integrating time difference and spatial distance terms. Specifically, the formula...

[0039] In the middle, the first item Represents a node With nodes The absolute difference in transition trigger time reflects the temporal relationship between the transition responses of the two nodes. The smaller this value, the more likely the two nodes transitioned almost simultaneously, suggesting a possible physical connection. The second term... It is the difference in physical distance between nodes divided by the propagation speed. This indicates that the transition signal is generated by the node. Transmit to node The minimum required propagation time, the sum of the two, constitutes the distance from the node. To the node The jump-triggered propagation intensity value comprehensively reflects the coupled behavior of the jump in both time response and spatial diffusion, among which the propagation speed... As a constant set by the system to ensure the uniformity of physical dimensions, the entire formula, through the linear superposition of time difference and propagation delay, enables the calculation results to measure both the synchronicity of jumps and the geographical factors of path structure, which helps to accurately identify the source and direction of fault propagation.

[0040] The inter-node transition trigger delay strength value is a comprehensive indicator used to quantify the difference in response time and physical propagation distance between two adjacent nodes in a power distribution network during a fault transition event. Specifically, this value not only reflects the asynchronous nature of the transition signal on the time axis between nodes, but also takes into account the transmission time of the signal along the physical path during the transition propagation process. It can effectively characterize the dynamic process of the transition event propagating from the upstream node to the downstream node. The smaller the value, the stronger the possibility that the transition signal propagates from the previous node to the next node, and the more likely the starting point of the transition event is to appear at the upstream node position corresponding to this value. Therefore, this strength value has key reference value in fault source location and propagation path inference.

[0041] S513: Based on the earliest node number of the jump in the jump trigger delay matrix, extract the warning level record of the corresponding node in the path warning node list, construct a binary combination pair to represent the fault trigger priority structure, and combine the path topology mapping to determine whether the node is located at the intersection of multiple branches. The node number that meets the conditions is output as the identifiable fault location under the current power distribution network, and the power distribution line fault identification result is generated. Based on the delay intensity values ​​recorded in the transition trigger delay matrix, the node number with the smallest delay intensity is extracted and considered to be the earliest node to transition in the fault event. Then, the warning level field matching the number in the path warning node list is called to extract the level identifier of the node in the previous level identification process. For example, node N031 is a level 3 warning. Then, its branch location number in the path topology and whether it is in the intersection area are extracted. If the conditions of multiple branch overlap and earliest trigger are met, the node can be located as an identifiable fault location target in the current power distribution network, and finally, the power distribution line fault identification result is generated.

[0042] Please see Figure 7 A fault location system for distribution network lines based on fault indicators includes: The node acquisition initialization module is used to execute S1: acquire the periodic current readings output by the short-circuit current indicator and the ground current indicator on the distribution cable node, summarize them by node number and establish node mapping, and generate a node current sequence table; The jump rate extraction module is used to execute S2: based on the current readings of each node in the node current sequence table for two consecutive sampling periods, calculate the current increment of each node per unit time, output the jump rate value, sort the jump rate value along the path direction, and generate a path jump rate map. The warning node determination module is used to execute S3: based on the current periodic jump rate value of each node in the path jump rate graph, compare it sequentially with the preset warning level threshold, and record whether the rate value in a continuous period stably exceeds the corresponding level threshold, filter warning nodes, and generate a path warning node list; The intersection section identification module is used to execute S4: based on the path warning node list, it retrieves the path convergence point where the warning nodes intersect, retrieves the change trend of jump rate change intensity on the preceding and following paths, determines the jump increase interval and records the span interval and change node number, delineates the fault concentration distribution area, and generates the intersection section identification table. The fault location confirmation module is used to execute S5: based on all nodes in the intersection segment identification table, record the sampling time point of the first jump rate surge, calculate the jump trigger delay intensity of adjacent nodes, locate the node number with the earliest trigger time, combine it with the warning level of the path warning node list, determine the fault location, and generate the power distribution line fault identification result.

[0043] The above description is merely a specific embodiment of the present invention, but the scope of protection of the present invention is not limited thereto. Any variations or substitutions that can be easily conceived by those skilled in the art within the technical scope disclosed in the present invention should be included within the scope of protection of the present invention. Therefore, the scope of protection of the present invention should be determined by the scope of the claims.

Claims

1. A fault locator method for distribution network based on fault indicators, characterized in that, The method comprises the following steps: S1: obtaining periodic current readings output by short-circuit current indicators and ground current indicators on power distribution cable nodes, aggregating and establishing node mapping according to node numbers, and generating a node current sequence list; S2: based on current readings of each node in the node current sequence list for two consecutive sampling periods, calculating the current increment of each node per unit time, outputting the jump rate value, sorting the jump rate value along the path direction, and generating a path jump rate graph; S3: based on the current period jump rate value of each node in the path jump rate graph, sequentially comparing with the preset warning level threshold, and recording whether the rate value is stable and exceeds the corresponding level threshold in the continuous period, screening the warning nodes, and generating a path warning node list; S4: according to the path warning node list, searching the path convergence point intersected by the warning nodes, searching the jump rate mutation strength trend on the front and rear paths, judging the jump increasing interval and recording the span interval and the mutation node number, and delimiting the fault concentrated distribution area, and generating an intersection paragraph identification table; S5: according to all nodes in the intersection paragraph identification table, recording the sampling time point of the first jump rate sudden increase, calculating the jump trigger delay strength of adjacent nodes, positioning the node number with the earliest trigger time, combining with the warning level of the path warning node list, determining the fault location, and generating a power distribution line fault identification result.

2. The fault indicator based distribution network line fault location method as claimed in claim 1, wherein, The node current sequence list includes node number mapping, periodic current data sequence, and topological structure correspondence. The path jump rate graph includes node sequence position, unit time current change rate, and path direction sorting information. The path warning node list includes jump rate level mark, warning node number, and warning period number. The intersection paragraph identification table includes jump increasing interval, intersection node number, and fault concentrated segment position interval. The power distribution line fault identification result includes fault node number, earliest trigger time point, and comprehensive warning level.

3. The fault indicator based distribution network line fault location method as claimed in claim 1, wherein, When establishing the node mapping, the mapping is performed according to the deployment positions of the short-circuit current indicators and the ground current indicators, the numbering order, and the connection relationship in the main-branch topological structure diagram of the power distribution network.

4. The fault indicator based distribution network line fault location method as claimed in claim 1, wherein, The fault concentrated distribution area specifically refers to a paragraph area that meets the increasing trend and covers two branch lines in the intersection area.

5. The fault indicator based distribution network line fault location method as claimed in claim 1, wherein, The acquisition step of the node current sequence list is: S111: obtaining periodic current readings of short-circuit current indicators and ground current indicators on city branch power distribution cable nodes, rearranging all current readings collected in each sampling period according to the node numbers corresponding to each node, aggregating the current readings with the same sampling time label, constructing a current value data set indexed by node number, and obtaining a numbered current data set; S112: based on the numbered current data set, extracting the physical deployment position parameters and numbering order parameters corresponding to each node, and performing structural retrieval on the connection relationship between node numbers, extracting the adjacent node pairs in the main-branch topological structure diagram corresponding to the connection relationship, and one-to-one mapping the node numbers and physical connection relationship, and establishing a node topological mapping relationship table; S113: According to the connection order mapped in the node topology mapping relationship table, the sequence reconstruction operation is performed on the numbered current data set, the current values of adjacent nodes are spliced into current vectors according to the topology connection order, and the period index and number mark are performed on all spliced current vectors, and the node current sequence table is generated.

6. The fault indicator based distribution network line fault location method as claimed in claim 1, wherein, The acquisition step of the path jump rate graph is: S211: Based on the current and last period node current vector values in the node current sequence table, the current values of two periods of the same node number are calculated, the current increment sequence under each node number is obtained, the sampling period time constant is extracted, the current increment is divided by the sampling period time length, and the unit time normalization processing is performed on all node numbers in turn, and the current change rate matrix is generated; S212: According to the node jump rate values in the current change rate matrix, the arrangement order of node numbers in the topology path is extracted from the node current sequence table combined with the connection order index of each node number in the network structure, and the jump rate values are reordered according to the topology path order, the jump rate ordered list is constructed, and the topology sorting jump sequence is obtained; S213: According to the arrangement results of the node jump rate in the topology sorting jump sequence, the jump rate values corresponding to adjacent node numbers are sequentially drawn into a directed path structure diagram, and the path direction and jump rate value are marked, the jump rate label value is set for each connection edge in the diagram, and the path jump rate graph is generated.

7. The fault indicator based distribution network line fault location method as claimed in claim 1, wherein, The acquisition step of the path warning node list is: S311: Based on the jump rate value of each node in the current period in the path jump rate graph, the interval comparison method is used to judge whether the jump rate falls into any level threshold interval by comparing the preset jump rate first level threshold, second level threshold and third level threshold in turn, and the level judgment result of each node in the current period is recorded according to the node number, and the node jump level mark table is generated; S312: Based on the node level judgment result in the node jump level mark table, the corresponding node level data of the last period is combined, and the current level is compared with the last period level node by node, if the levels of two consecutive periods meet the corresponding level above the condition, the node is marked as a continuous jump node, and a continuous level matching node set is obtained; S313: According to the node numbers in the continuous level matching node set, the number index and branch path code in the topology structure are read, and the nodes meeting the conditions of different levels of first level, second level and third level are grouped according to the branch path clustering and written into the structured registration, and the path warning node list is generated.

8. The fault indicator based distribution network line fault location method as claimed in claim 1, wherein, The acquisition step of the intersection paragraph identification table is: S411: Extract the spatial coordinate values of each node in the topology structure according to the node number and the path number recorded in the path warning node list, and construct the node distribution sequence according to the path dimension. If there are numbered continuous or shared nodes in the two branch paths, mark the nodes as potential intersection points, and combine their spatial coordinates to aggregate the path intersection area nodes to generate a path intersection point candidate set; S412: Based on each node number in the path intersection point candidate set, read the front and back hop rate data on the path, perform difference operation on the hop values of adjacent nodes and establish a difference sequence, calculate the monotonicity of the change direction in the difference sequence, and if the hop values of the continuous nodes show a monotonic increasing trend, record the start node and end node number and the path span range of the paragraph, and obtain a jump increasing interval description set; S413: According to the paragraph interval marked in the jump increasing interval description set, extract the branch number set covered by the path span, judge whether it covers two and more branch paths, and if the condition is met, perform fault area marking operation on the paragraph interval to generate an intersection paragraph identification table.

9. The fault indicator based distribution network line fault location method as claimed in claim 1, wherein, The acquisition step of the power distribution line fault identification result is: S511: Obtain the number index of all intersection nodes in the intersection paragraph identification table, and extract the time sequence index value. Locate the first jump rate surge time of each node number in the multi-period jump data, and record the minimum time index value that meets the condition as the jump trigger time point. Obtain a jump trigger time mapping table; S512: Based on the jump trigger time mapping table, for each adjacent node with continuous numbering in the intersection path, compare the jump trigger time in turn according to the path direction, calculate the difference value of the time index between the two nodes, and obtain the jump trigger delay intensity value. Record the node number with the earliest jump and the corresponding path start position, and construct a jump trigger delay matrix; S513: According to the jump earliest node number marked in the jump trigger delay matrix, extract the warning level record of the corresponding node in the path warning node list, construct a binary combination pair to represent the fault trigger priority structure, and judge whether the node is located at a multi-branch intersection according to the path topology structure mapping. The node number that meets the condition is output as the identifiable fault position of the current power distribution network, and a power distribution line fault identification result is generated.

10. A fault locator system for distribution network lines based on fault indicators, characterized in that, The system is used to realize the power distribution network line fault positioning method based on fault indicator in any one of claims 1-9, and the system comprises: The node collection initialization module is used to execute S1: Obtain the periodic current readings output by the short-circuit current indicator and the ground current indicator on the power cable node, aggregate and establish node mapping according to node number, and generate a node current sequence table; The jump rate extraction module is used to execute S2: Based on the current readings of each node in the node current sequence table for two consecutive sampling periods, calculate the current increment per unit time of each node, output the jump rate value, sort the jump rate value along the path direction, and generate a path jump rate graph; The early warning node determination module is configured to perform S3: based on the current period hop rate value of each node in the path hop rate diagram, sequentially comparing preset early warning level thresholds, and recording whether the rate value in the continuous period is stable and exceeds the corresponding level threshold, screening early warning nodes, and generating a path early warning node list; The intersection section identification module is configured to perform S4: according to the path early warning node list, searching for the path convergence point where the early warning nodes converge, searching for the trend of the jump rate mutation strength change on the front and rear paths, judging the jump increasing interval and recording the span interval and the mutation node number, delimiting the fault concentrated distribution area, and generating an intersection section identification table; The fault location confirmation module is configured to perform S5: according to all the nodes in the intersection section identification table, recording the sampling time point of the first jump rate sudden increase, calculating the jump trigger delay strength of the adjacent nodes, positioning the node number with the earliest trigger time, combining with the early warning level of the path early warning node list, determining the fault location, and generating a distribution line fault identification result.

Images