A pipe network classification method, system, device and storage medium

Through in-depth priority search and multi-index step-by-step decision-making evaluation, the accuracy and efficiency of grading and sorting of complex drainage pipelines in the existing technology are solved, and the accurate grading and efficient processing of complex pipelines are achieved.

CN119379117BActive Publication Date: 2025-04-22BEIJING YINGTELIWEI ENVIRONMENTAL TECH CO LTD
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202411978936.1
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2024-12-31
Publication Date
2025-04-22
Estimated Expiration
2044-12-31

AI Technical Summary

Technical Problem

When the prior art hierarchical ordering of complex drainage pipelines, it is easy to cause errors in judging the upstream and downstream relationships of nodes, and it is difficult to fully reflect the complexity of the pipeline system based on a single indicator, resulting in inaccurate grading results and low efficiency.

Method used

Depth priority search method is used to recursively traverse the upstream path, and combined with multi-index step-by-step decision evaluation, identify the main branch and perform hierarchical hierarchical hierarchical hierarchical hierarchical hierarchical hierarchical sequential sequential sequential sequential sequential sequential sequential sequential sequential sequential sequential sequential sequential sequential sequential sequential sequential sequential sequential sequential sequential sequential sequential sequential sequential sequential sequential sequential sequential sequential sequential sequential sequential sequential sequential

Benefits of technology

Through multi-index decision-making and depth-first search, complex loops and multi-attribute branch paths can be accurately processed, improving the accuracy and efficiency of grading, and is suitable for multi-loop pipeline networks.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119379117B_ABST
    Figure CN119379117B_ABST
Patent Text Reader

Abstract

The present invention discloses a pipe network classification method, system, equipment and storage medium. The system includes a directed graph construction module for acquiring pipe network data to construct a directed graph; a recursive traversal module for recursively traversing all upstream paths in the directed graph; a loop identification module for identifying whether there is a loop in the upstream path; a multi-index hierarchical decision evaluation module for evaluating the upstream path using a multi-index hierarchical decision; a node hierarchical classification module for hierarchical classification of nodes in the directed graph; a cycle judgment module for judging whether all nodes in the node set to be classified are hierarchical classification; a pipe section hierarchical classification module for hierarchical classification of pipe sections based on the node classification results; and a result output module for generating a data set including the node hierarchical classification results and the pipe section hierarchical classification results. The present invention combines a depth-first search method with a multi-index hierarchical decision, so that the hierarchical classification results have high accuracy, and the overall applicability, practicality and computational efficiency are high.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the technical field of municipal drainage, and in particular to a pipe network classification method, system, equipment and storage medium. Background Art

[0002] With the continuous development of urbanization, an urban area often contains millions of underground drainage pipelines and nodes, and the drainage networks built in different periods have different characteristics. Faced with a large number of drainage networks with large structural differences and high complexity, the lack of network classification and sorting often makes it impossible for researchers to distinguish key pipelines, and therefore it is impossible to effectively manage and maintain the drainage network. Similarly, in the modeling of urban hydrological models, unclassified network data makes it impossible for researchers to simplify a complex network as a whole into several subsystems for simulation, which significantly reduces the operating efficiency and calculation speed of the model. Therefore, whether it is the management level that manages water resources in the urban drainage system, or the system application level that models and analyzes the urban hydrological system, it is inseparable from the classification and sorting of the drainage network.

[0003] Most existing technologies use breadth-first traversal algorithms to perform topological classification on urban drainage networks, thereby dividing the entire network into different spatial and functional levels. However, due to the existence of pipe loops in actual drainage networks, drainage networks are not ideal tree-like results. Therefore, most existing technologies are used to determine the upstream and downstream of pipe sections, which is prone to errors in the judgment of the upstream and downstream relationships of nodes. In actual operations, in order to ensure the accuracy of the topological classification results, manual inspection and correction of the classification results are often required, which undoubtedly increases the workload, has low work efficiency, and is difficult to efficiently handle multi-loop pipe networks.

[0004] Moreover, most existing grading technologies rely on a single indicator (such as connection relationship, pipe section slope, node elevation) to determine the upstream and downstream relationship between nodes. A single indicator alone cannot fully reflect the complexity of the pipeline network system, and decisions made based on a single indicator lack flexibility and are difficult to optimize. Summary of the invention

[0005] Purpose of the invention: The purpose of the present invention is to provide a pipeline network classification method, system, equipment and storage medium with high accuracy and efficiency and relying on multiple indicators to determine the upstream and downstream relationships between nodes.

[0006] Technical solution: The present invention discloses a pipe network classification method, comprising the following steps:

[0007] S1: Obtain the pipe network data to construct a directed graph, and all the nodes of the directed graph constitute a set of nodes to be classified, and input the level n, and set the initial value of n to be 0;

[0008] S2: Using a depth-first search method, recursively traverse all upstream paths in the directed graph according to the specified downstream nodes;

[0009] S3: Identify whether there is a loop in the upstream path. If there is no loop, the upstream path proceeds to the next step; if there is a loop, the upstream path proceeds to step S5;

[0010] S4: Use multi-index hierarchical decision-making to evaluate the upstream path, identify the main branch, and set n=n+1 after identifying the main branch;

[0011] S5: Based on the n value, the upstream path of the identified main branch and the nodes contained therein are assigned hierarchical values, and then based on the hierarchical values ​​of the nodes on the main branch, the nodes in the loop are assigned hierarchical values;

[0012] S6: Determine whether all nodes in the node set to be classified have been classified and graded. If all nodes have been classified and graded, proceed to the next step; if not all nodes have been classified and graded, return to step S2;

[0013] S7: classify the pipe segments based on the node classification results;

[0014] S8: Generate a data set including node stratification and classification results and pipe segment stratification and classification results.

[0015] Furthermore, the pipe network data includes node names of connected pipe sections, pipe section information, and maintenance management information; the nodes connecting pipe sections in the pipe network data are defined as nodes in a directed graph, and the names of the nodes connecting pipe sections are defined as node attributes in the directed graph; the pipe sections in the pipe network data are defined as edges of a directed graph, and the pipe section information is defined as edge attributes of the directed graph; wherein the pipe section information includes the pipe section name, the node names connected at both ends of the pipe section, the drainage type, the pipe section width, the cross-sectional area shape of the pipe section, the pipe section twist rate, the pipe section slope change rate, and the number of open channels.

[0016] Furthermore, the use of multi-index hierarchical decision-making to evaluate the upstream path in step S4 includes the following steps:

[0017] S4-1: Count the top 1 percentile values ​​of the pipe widths in all upstream paths;

[0018] S4-2: Setting a threshold value for the pipe segment width, judging whether the upstream path meets the regulations based on the first 1% value of the pipe segment width in the upstream path and the threshold value, if there is a pipe segment width in the upstream path whose first 1% value is greater than or equal to the threshold value, judging that the upstream path to which the first 1% value of the pipe segment width in the upstream path belongs meets the regulations, and proceeding to the next step; if the first 1% values ​​of the pipe segment width in all the statistical upstream paths are less than the threshold value, resetting the threshold value until there is a pipe segment width in the upstream path whose first 1% value is greater than or equal to the threshold value;

[0019] S4-3: Identify whether the drainage type of all pipe sections in the same upstream path that meet the regulations is consistent;

[0020] If they are consistent, the following judgment is made: when n≤1, the upstream path is determined to be the highest level path, and the highest level path is used as the target path; when n>1, the upstream path that meets the requirements and has the same drainage type in all pipe sections is defined as the path to be judged, and one of the multiple screening methods or a combination of two or more of the multiple screening methods is specified to select the upstream path that meets the conditions in the path to be judged as the target path;

[0021] If they are inconsistent, the following judgment is made: the upstream path to which the largest top 1% value belongs or the upstream path with inconsistent drainage type of the only pipe section is selected as the target path;

[0022] S4-4: Define the target path as the main branch.

[0023] Furthermore, the multiple screening methods in step S4-4 include the following methods:

[0024] Pipe segment twist rate screening: select the upstream path with the lowest pipe segment twist rate in the path to be judged as the target path;

[0025] Pipeline slope change rate screening: select the upstream path with the lowest pipe slope change rate in the path to be judged as the target path;

[0026] Screening of the number of open channels: Screening the upstream path with the largest number of open channels among the paths to be determined as the target path;

[0027] Combining two or more of the multiple screening methods means: selecting two or more of the multiple screening methods; sorting the two or more screening methods; using the aforementioned screening methods to screen in the set order, and using the target path screened by the screening method that is sorted first as the path to be judged by the screening method that is sorted later.

[0028] Furthermore, the nodes described in step S5 are hierarchically and graded as follows: for the upstream path identified as the main branch and the nodes contained therein, the hierarchical grade assignment is the n value after the main branch is identified in step S5; the hierarchical grade assignment for the nodes within the identified loop is the same as the hierarchical grade assignment for the graded nodes outside the loop.

[0029] Furthermore, the method for determining whether all nodes in the node set to be classified are hierarchically graded in step S6 is as follows: the nodes with hierarchical grading values ​​assigned to them are an intermediate set, the nodes in the intermediate set are used as downstream nodes for the next node hierarchical grading, and the intermediate set in the node set to be classified is deleted; determine whether the node set to be classified is an empty set, if it is an empty set, proceed to the next step, if it is a non-empty set, return to step S2 for the next node hierarchical grading, until the node set to be classified is an empty set.

[0030] Furthermore, the method of layering and grading the pipe segments described in step S7 is: determine whether the hierarchical grading values ​​of the nodes at both ends of the pipe segment are consistent. If they are consistent, the hierarchical grading value of the pipe segment is the same as the hierarchical grading of the nodes at both ends; if they are inconsistent, the hierarchical grading value of the pipe segment is the same as the node at the end with the larger hierarchical grading value of the nodes at both ends.

[0031] Based on the same inventive concept, the present invention also discloses a pipe network classification system, comprising:

[0032] A directed graph construction module is used to obtain the pipe network data to construct a directed graph, and all the nodes of the directed graph constitute a set of nodes to be classified, and input the level n, and set the initial value of n to be 0;

[0033] The recursive traversal module uses a depth-first search method to recursively traverse all upstream paths in the directed graph according to the specified downstream nodes;

[0034] A loop identification module identifies whether there is a loop in the upstream path. If there is no loop, the upstream path is input into the multi-index hierarchical decision evaluation module; if there is a loop, the upstream path is input into the node stratification and classification module;

[0035] The multi-index hierarchical decision-making evaluation module uses a multi-index hierarchical decision-making to evaluate the upstream path, identify the main branch, and set n=n+1 after identifying the main branch;

[0036] The node stratification and grading module stratifies and grades the upstream path of the main branch and the nodes contained therein identified by the multi-index hierarchical decision-making evaluation module based on the n value, and then stratifies and grades the nodes in the loop based on the node stratification and grading assignment on the main branch;

[0037] The loop judgment module is used to judge whether all the nodes in the node set to be classified have been hierarchically classified. If all the nodes have been hierarchically classified, the node hierarchical classification results are transmitted to the pipe segment hierarchical classification module and the result output module; if all the nodes have not been hierarchically classified, the current node hierarchical classification results are input into the directed graph construction module and the recursive traversal module, and the recursive traversal module, the loop identification module, the multi-index hierarchical decision evaluation module, the node hierarchical classification module and this module are cyclically run until all the nodes in the node set to be classified have been hierarchically classified;

[0038] The pipe segment stratification and grading module can stratify and grade pipe segments based on the node grading results;

[0039] The result output module is used to collect the node stratification and grading results of the node stratification and grading module and the pipe segment stratification and grading results of the pipe segment stratification and grading module, and generate a data set including the node stratification and grading results and the pipe segment stratification and grading results.

[0040] Based on the same inventive concept, the present invention also discloses an electronic device, comprising one or more processors, one or more memories and one or more programs, wherein the programs are stored in the memories and configured to be executed by the processors, and when the programs are loaded into the processors, the steps of the pipeline grading method as described above are implemented.

[0041] Based on the same inventive concept, the present invention also discloses a computer-readable storage medium, wherein the computer-readable storage medium stores a computer program, wherein the computer program includes program instructions, and when the program instructions are executed by a processor, the processor executes the steps of the pipeline network classification method as described above.

[0042] Beneficial effects: Compared with the prior art, the present invention has the following significant advantages:

[0043] The present invention adopts a depth-first search method to recursively traverse all upstream paths, and at the same time combines multi-index recursive decision-making to evaluate the upstream paths, and accurately hierarchizes and grades the loops and branches by integrating multiple evaluation criteria. It not only ensures the accuracy of the hierarchical sorting results of nodes and pipe sections, but also can flexibly customize the hierarchical and grading standards according to specific circumstances, which is conducive to improving the overall applicability and practicality, making the present invention particularly suitable for pipe networks with many branch paths with different attributes or multiple loops.

[0044] The present invention can reduce the calculation space to the greatest extent by using the fallback logic, which is beneficial to improving the efficiency of the overall layering and grading. BRIEF DESCRIPTION OF THE DRAWINGS

[0045] Figure 1 is a flow chart of the method of the present invention;

[0046] Figure 2is a flow chart of step S4 of the present invention;

[0047] Figure 3 It is a schematic diagram of the structure of the system of the present invention. DETAILED DESCRIPTION

[0048] The technical solution of the present invention is further described below in conjunction with the accompanying drawings.

[0049] Example 1

[0050] The present invention discloses a pipe network classification method, such as Figure 1 As shown, the following steps are included:

[0051] S1: Obtain pipe network data to construct a directed graph. Pipe network data refers to detailed information about drainage pipes and related facilities, including node names of connected pipe sections, pipe section information, and maintenance management information; preferably, the node names of connected pipe sections, pipe section information, and maintenance management information are GIS data of different contents.

[0052] The nodes connecting the pipe segments in the pipe network data are defined as nodes in a directed graph, and the names of the nodes connecting the pipe segments are defined as node attributes in the directed graph; the pipe segments in the pipe network data are defined as edges of a directed graph, and the pipe segment information is defined as edge attributes of the directed graph. The pipe segment information includes the pipe segment name, the node names connected at both ends of the pipe segment, the drainage type, the pipe segment width, the cross-sectional area shape of the pipe segment, the pipe segment twist rate, the pipe segment slope change rate, and the number of open channels. Preferably, in actual use, the user can modify or increase or decrease the edge attributes according to the use requirements and actual conditions.

[0053] All nodes of the directed graph constitute a set of nodes to be classified.

[0054] And input the level n, and set the initial value of n to 0.

[0055] S2: Using a depth-first search method, recursively traverse all upstream paths in the directed graph according to the designated downstream node. Preferably, the downstream node is designated according to the user's usage requirements or actual conditions, for example, the pipe segment node at the end of a certain water flow is designated as the downstream node, and the pipe segment node at the end of a certain area is designated as the downstream node.

[0056] S3: Identify whether there is a loop in the upstream path. If there is no loop, the upstream path proceeds to the next step; if there is a loop, the upstream path proceeds to step S5.

[0057] S4: Use multi-index hierarchical decision-making to evaluate the upstream path, identify the main branch, and set n=n+1 after identifying the main branch. Figure 2 shown.

[0058] S4-1: Count the top 1% of the pipe width in all upstream paths. For each upstream path, count the width of all pipes in it, and sort them from largest to smallest according to the pipe width, and take the top 1%, that is, take the maximum pipe width value in the top 1%. If there are multiple width values ​​in the top 1%, take the smallest value as the top 1% of the width of the upstream path.

[0059] S4-2: Set a threshold for the pipe segment width, and determine whether the upstream path meets the regulations based on the top 1% value of the pipe segment width in the upstream path and the threshold. If there is a top 1% value of the pipe segment width in the upstream path that is greater than or equal to the threshold, then the upstream path to which the top 1% value of the pipe segment width in the upstream path belongs is determined to meet the regulations, and proceed to the next step; if the top 1% values ​​of the pipe segment width in all statistical upstream paths are less than the threshold, then the threshold is reset until there is a top 1% value of the pipe segment width in the upstream path that is greater than or equal to the threshold.

[0060] S4-3: Identify whether the drainage type of all pipe sections in the same upstream path that meet the regulations is consistent;

[0061] If they are consistent, the following judgment is made: when n≤1, the upstream path is determined to be the highest level path, and the highest level path is used as the target path; when n>1, the upstream path that meets the requirements and has the same drainage type in all pipe sections is defined as the path to be judged, and one of the multiple screening methods or a combination of two or more of the multiple screening methods is specified to select the upstream path that meets the conditions in the path to be judged as the target path;

[0062] If they are inconsistent, the following judgment is made: the upstream path to which the largest top 1% value belongs or the upstream path with inconsistent drainage type of the only pipe section is selected as the target path.

[0063] When there is only one largest top 1% value, the upstream path to which the largest top 1% value belongs is selected as the target path; when there are two or more largest top 1% values ​​that are equal, the corresponding two or more upstream paths are selected as the target path; when there is only one upstream path and the drainage types of the pipe sections are inconsistent, the upstream path is selected as the target path.

[0064] The multiple screening methods in step S4-3 include pipe segment twist rate screening, pipe segment slope change rate screening, and river channel open channel quantity screening. The specific screening rules are as follows:

[0065] The pipe segment twist rate screening is to screen the upstream path with the lowest pipe segment twist rate in the path to be judged as the target path;

[0066] The pipe segment slope change rate screening is to screen the upstream path with the lowest pipe segment slope change rate in the path to be judged as the target path;

[0067] The open channel quantity screening is to screen the upstream path with the largest number of open channels in the path to be judged as the target path.

[0068] In actual use, the screening methods are not limited to the above three screening methods. Users can set other screening methods according to usage requirements or actual conditions.

[0069] Combining two or more of the multiple screening methods means: selecting two or more of the multiple screening methods; sorting the two or more screening methods; using the aforementioned screening methods to screen in the set order, and using the target path screened by the screening method that is sorted first as the path to be judged by the screening method that is sorted later.

[0070] When there are two or more target paths selected by selecting any of the above three screening methods, two or more of the screening methods can be selected according to actual needs to simultaneously screen the target paths, and the selected two or more screening methods can be sorted according to actual needs. For example, the user can combine the pipe segment twist rate screening and the pipe segment slope change rate screening methods, and first use the pipe segment twist rate screening, and then use the pipe segment slope change rate screening; the specific screening process is as follows: first use the pipe segment twist rate screening method to screen the upstream path with the lowest pipe segment twist rate in the path to be judged as the target path, and there may be two or more upstream paths with the lowest twist rate screened, and then use the two or more target paths screened as the paths to be screened by the pipe segment slope change rate screening method, and the pipe segment slope change rate screening method is based on the upstream path with the lowest pipe segment slope change rate.

[0071] S4-4: define the target path as the main branch;

[0072] S5: Based on the n value, the upstream path of the identified main branch and the nodes contained therein are assigned hierarchical values, and then based on the hierarchical values ​​of the nodes on the main branch, the nodes in the loop are assigned hierarchical values.

[0073] For the upstream path identified as the main branch and the nodes it contains, the hierarchical classification is assigned the n value after the main branch is identified in step S5; the hierarchical classification of the nodes within the identified loop is the same as the hierarchical classification of the classified nodes outside the loop.

[0074] S6: Determine whether all nodes in the node set to be classified have been classified and graded. If all nodes have been classified and graded, proceed to the next step; if not all nodes have been classified and graded, return to step S2.

[0075] The nodes with hierarchical values ​​assigned to them are formed into an intermediate set, the nodes of the intermediate set are used as downstream nodes for the next node hierarchical grading, and the intermediate set in the node set to be graded is deleted; it is determined whether the node set to be graded is an empty set, if it is an empty set, the next step is entered, if it is a non-empty set, the step returns to step S2 for the next node hierarchical grading, until the node set to be graded is an empty set.

[0076] S7: The pipe segments are hierarchically graded based on the node classification results.

[0077] Determine whether the hierarchical grading values ​​of the nodes at both ends of the pipe segment are consistent. If they are consistent, the hierarchical grading value of the pipe segment is the same as the hierarchical grading of the nodes at both ends; if they are inconsistent, the hierarchical grading value of the pipe segment is the same as the node at the end with the larger hierarchical grading value of the nodes at both ends.

[0078] S8: Collect the node stratification and grading results and the pipe segment stratification and grading results, and generate a data set including the node stratification and grading results and the pipe segment stratification and grading results.

[0079] In summary, the present invention aims to significantly improve the accuracy and efficiency of systematic grading of a large number of complex pipe networks through the traversal of directed graphs and multi-index recursive decision-making. First, the hierarchical analysis can fully reflect the important functionality of each branch in the pipe network, and the multi-index recursive decision-making can ensure the systematic sorting from the downstream node to the upstream node, avoiding the situation of pipeline loops affecting the accuracy of the overall stratification and grading. Secondly, the present invention combines the depth-first search method to traverse the upstream path and the multi-index recursive decision-making to evaluate the upstream path, which can efficiently handle large-scale and complex pipe networks, especially for pipe networks with many branch paths with different attributes or with multiple loops. Furthermore, the present invention can reduce the calculation space by using the fallback logic, which is conducive to improving the efficiency of the overall stratification and grading. Finally, when using multi-index recursive decision-making, the loops and branches are accurately ranked by combining multiple evaluation criteria, which not only ensures the accuracy of the grading and sorting results of nodes and pipe sections, but also can be flexibly customized according to the standards of stratification and grading according to specific circumstances, so that the applicable objects of the present invention can include urban drainage pipe networks and river open channels. The present invention provides a robust framework for application areas such as urban drainage, hydrological modeling, and multi-type complex pipeline management while systematically managing loops and side branches in the network.

[0080] Fallback logic: When faced with multiple possible choices, fallback logic allows decision makers to go back and re-evaluate previous choices in order to seek a better solution if they find that the initial choice is not ideal or invalid.

[0081] In the multi-indicator hierarchical decision-making of the present invention, since it includes multiple levels of decision indicators, when selecting a project, the decision maker can first evaluate the overall goal of the project. If it is found that a project does not meet the goal, it can be regressed to the indicators of the previous level to re-evaluate it. For example: when it is determined in step S4-4 that the drainage type is inconsistent, it is regressed to the previous level and the pipe section width is used as the judgment indicator.

[0082] Indicator weights can be adjusted dynamically, that is, during the implementation process, if it is found that the initial weight settings of certain indicators are unreasonable, the fallback logic allows decision makers to return and adjust these weights to more accurately reflect the decision goals. For example: when the threshold set in step S4-3 does not have a top 1% value greater than or equal to the threshold, it means that the threshold setting does not conform to the current actual situation, and the user can adjust the threshold according to the actual situation.

[0083] Example 2

[0084] The present invention discloses a pipe network classification system, such as Figure 3 As shown, it includes a directed graph construction module, a recursive traversal module, a loop identification module, a multi-index hierarchical decision-making evaluation module, a node hierarchical grading module, a cycle judgment module, a pipe segment hierarchical grading module and a result output module.

[0085] The directed graph construction module is used to obtain the pipe network data to construct a directed graph, and all the nodes of the directed graph constitute a set of nodes to be classified, and input the level classification n, and let the initial value of n be 0. The pipe network data refers to detailed information about the drainage pipes and related facilities, the node names of the connected pipe sections, the pipe section information, and the maintenance and management information; preferably, the node names of the connected pipe sections, the pipe section information, and the maintenance and management information are GIS data of different contents.

[0086] The nodes connecting the pipe segments in the pipe network data are defined as nodes in a directed graph, and the names of the nodes connecting the pipe segments are defined as node attributes in the directed graph; the pipe segments in the pipe network data are defined as edges of a directed graph, and the pipe segment information is defined as edge attributes of the directed graph. The pipe segment information includes the pipe segment name, the node names connected at both ends of the pipe segment, the drainage type, the pipe segment width, the cross-sectional area shape of the pipe segment, the pipe segment twist rate, the pipe segment slope change rate, and the number of open channels. Preferably, in actual use, the user can modify or increase or decrease the edge attributes according to the use requirements and actual conditions.

[0087] The recursive traversal module uses a depth-first search method to recursively traverse all upstream paths in the directed graph according to the specified downstream node. Preferably, the downstream node is specified according to the user's usage requirements or actual conditions, for example, specifying the pipe segment node at the end of a certain water flow as the downstream node, specifying the pipe segment node at the end of a certain area as the downstream node.

[0088] The loop identification module identifies whether there is a loop in the upstream path. If there is no loop, the upstream path is input into the multi-index hierarchical decision-making evaluation module; if there is a loop, the upstream path is input into the node layering and grading module.

[0089] The multi-index hierarchical decision-making evaluation module adopts a multi-index hierarchical decision-making to evaluate the upstream path, identify the main branch therein, and set n=n+1 after identifying the main branch.

[0090] Ⅰ-1: Count the top 1% of the pipe width in all upstream paths. For each upstream path, count the width of all pipes in it, and sort them from largest to smallest according to the pipe width. Take the top 1%, that is, take the maximum pipe width value in the top 1%. If there are multiple width values ​​in the top 1%, take the smallest value as the top 1% of the width of the upstream path.

[0091] Ⅰ-2: Set a threshold for the pipe segment width, and determine whether the upstream path meets the requirements based on the top 1% value of the pipe segment width in the upstream path and the threshold. If there is a top 1% value of the pipe segment width in the upstream path that is greater than or equal to the threshold, then the upstream path to which the top 1% value of the pipe segment width in the upstream path belongs is determined to meet the requirements, and proceed to the next step; if the top 1% values ​​of the pipe segment width in all statistical upstream paths are less than the threshold, then reset the threshold until there is a top 1% value of the pipe segment width in the upstream path that is greater than or equal to the threshold.

[0092] I-3: Identify whether the drainage type of all pipe sections in the same upstream path or the same upstream path with loops that meet the regulations is consistent;

[0093] If they are consistent, the following judgment is made: when n≤1, the upstream path is determined to be the highest level path, and the highest level path is used as the target path; when n>1, the upstream path that meets the requirements and has the same drainage type in all pipe sections is defined as the path to be judged, and one of the multiple screening methods or a combination of two or more of the multiple screening methods is specified to select the upstream path that meets the conditions in the path to be judged as the target path;

[0094] If they are inconsistent, the following judgment is made: the upstream path to which the largest top 1% value belongs or the upstream path with inconsistent drainage type of the only pipe section is selected as the target path.

[0095] When there is only one largest top 1% value, the upstream path to which the largest top 1% value belongs is selected as the target path; when there are two or more largest top 1% values ​​that are equal, the corresponding two or more upstream paths are selected as the target path; when there is only one upstream path and the drainage types of the pipe sections are inconsistent, the upstream path is selected as the target path.

[0096] The various screening methods include pipe segment twist rate screening, pipe segment slope change rate screening and river open channel quantity screening. The specific screening rules are as follows:

[0097] The pipe segment twist rate screening is to screen the upstream path with the lowest pipe segment twist rate in the path to be judged as the target path;

[0098] The pipe segment slope change rate screening is to screen the upstream path with the lowest pipe segment slope change rate in the path to be judged as the target path;

[0099] The open channel quantity screening is to screen the upstream path with the largest number of open channels in the path to be judged as the target path.

[0100] In actual use, the screening methods are not limited to the above three screening methods. Users can set other screening methods according to usage requirements or actual conditions.

[0101] Combining two or more of the multiple screening methods means: selecting two or more of the multiple screening methods; sorting the two or more screening methods; using the aforementioned screening methods to screen in the set order, and using the target path screened by the screening method that is sorted first as the path to be judged by the screening method that is sorted later.

[0102] When there are two or more target paths selected by selecting any of the above three screening methods, two or more of the screening methods can be selected according to actual needs to simultaneously screen the target paths, and the selected two or more screening methods can be sorted according to actual needs. For example, the user can combine the pipe segment twist rate screening and the pipe segment slope change rate screening methods, and first use the pipe segment twist rate screening, and then use the pipe segment slope change rate screening; the specific screening process is as follows: first use the pipe segment twist rate screening method to screen the upstream path with the lowest pipe segment twist rate in the path to be judged as the target path, and there may be two or more upstream paths with the lowest twist rate screened, and then use the two or more target paths screened as the paths to be screened by the pipe segment slope change rate screening method, and the pipe segment slope change rate screening method is based on the upstream path with the lowest pipe segment slope change rate.

[0103] Ⅰ-4: Define the target path as the main branch.

[0104] The node hierarchical classification module hierarchically and classifies the upstream path of the main branch and the nodes it contains identified by the multi-index hierarchical decision-making evaluation module based on the n value, and then hierarchically and classifies the nodes in the loop based on the node hierarchical classification assignment on the main branch.

[0105] For the upstream path identified as the main branch in step Ⅰ-4 of the multi-index hierarchical decision-making evaluation module and the nodes contained therein, the hierarchical classification is assigned the n value after the main branch is identified in the multi-index hierarchical decision-making evaluation module;

[0106] The hierarchical classification of nodes within the loop identified in the loop identification module is the same as the hierarchical classification of the classified nodes outside the loop.

[0107] The cyclic judgment module is used to judge whether all the nodes in the node set to be classified have been layered and graded. If all of them have been layered and graded, the results of the node layering and grading will be transmitted to the pipe section layering and grading module and the result output module; if not all of them have been layered and graded, the current node layering and grading results will be input into the directed graph construction module and the recursive traversal module, and the recursive traversal module, the loop identification module, the multi-index hierarchical decision-making evaluation module, the node layering and grading module and this module will be run cyclically until all the nodes in the node set to be classified have been layered and graded.

[0108] The method for judging whether all the nodes in the node set to be classified are hierarchically graded is as follows: the nodes whose hierarchical grade is assigned a value of n in the node hierarchical grade module constitute an intermediate set, the nodes of the intermediate set are used as downstream nodes for the next node hierarchical grade, and the intermediate set in the node set to be classified of the directed graph construction module is deleted; it is judged whether the node set to be classified is an empty set, if it is an empty set, the result of the node hierarchical grade is transmitted to the pipe section hierarchical grade module and the result output module, and the pipe section hierarchical grade module and the result output module are run in sequence, if it is a non-empty set, the directed graph construction module, the recursive traversal module, the multi-index hierarchical decision evaluation module, the multi-index hierarchical decision evaluation module, the node hierarchical grade module and this module are run cyclically to perform the next node hierarchical grade, until all the nodes in the node set to be classified are hierarchically graded.

[0109] The pipe segment hierarchical classification module can hierarchically classify pipe segments based on the node classification results.

[0110] Determine whether the hierarchical grading values ​​of the nodes at both ends of the pipe segment are consistent. If they are consistent, the hierarchical grading value of the pipe segment is the same as the hierarchical grading of the nodes at both ends; if they are inconsistent, the hierarchical grading value of the pipe segment is the same as the node at the end with the larger hierarchical grading value of the nodes at both ends.

[0111] The result output module is used to collect the node stratification and grading results of the node stratification and grading module and the pipe segment stratification and grading results of the pipe segment stratification and grading module, and generate a data set including the node stratification and grading results and the pipe segment stratification and grading results.

[0112] Example 3

[0113] An electronic device disclosed in the present invention includes one or more processors, one or more memories and one or more programs. The programs are stored in the memories and are configured to be executed by the processors. When the programs are loaded into the processors, the steps of the pipe network grading method of Example 1 are implemented.

[0114] Example 4

[0115] The present invention discloses a computer-readable storage medium, which stores a computer program. The computer program includes program instructions, and when the program instructions are executed by a processor, the processor executes the steps of the pipe network classification method of Example 1.

Claims

1. A pipe network classification method, characterized in that: The following steps are included: S1: Obtain the pipe network data to construct a directed graph, and all the nodes of the directed graph constitute a set of nodes to be graded, and input the hierarchical grade n, and set the initial value of n to be 0; the pipe network data includes the node name of the connected pipe segment, pipe segment information, and maintenance management information; the nodes connecting the pipe segments in the pipe network data are defined as nodes in the directed graph, and the names of the nodes connecting the pipe segments are defined as node attributes in the directed graph; the pipe segments in the pipe network data are defined as edges of the directed graph, and the pipe segment information is defined as edge attributes of the directed graph; the pipe segment information includes the pipe segment name, the node names connected at both ends of the pipe segment, the drainage type, the pipe segment width, the cross-sectional area shape of the pipe segment, the pipe segment torsion rate, the pipe segment slope change rate, and the number of open channels; S2: Using a depth-first search method, recursively traverse all upstream paths in the directed graph according to the specified downstream nodes; S3: Identify whether there is a loop in the upstream path. If there is no loop, the upstream path proceeds to the next step; if there is a loop, the upstream path proceeds to step S5; S4: Use multi-index hierarchical decision-making to evaluate the upstream path, identify the main branch, and set n=n+1 after identifying the main branch; S4-1: Count the top 1 percentile values ​​of the pipe widths in all upstream paths; S4-2: Setting a threshold value for the pipe segment width, judging whether the upstream path meets the regulations based on the first 1% value of the pipe segment width in the upstream path and the threshold value, if there is a pipe segment width in the upstream path whose first 1% value is greater than or equal to the threshold value, judging that the upstream path to which the first 1% value of the pipe segment width in the upstream path belongs meets the regulations, and proceeding to the next step; if the first 1% values ​​of the pipe segment width in all the statistical upstream paths are less than the threshold value, resetting the threshold value until there is a pipe segment width in the upstream path whose first 1% value is greater than or equal to the threshold value; S4-3: Identify whether the drainage type of all pipe sections in the same upstream path that meet the regulations is consistent; If they are consistent, the following judgment is made: when n≤1, the upstream path is determined to be the highest level path, and the highest level path is used as the target path; when n>1, the upstream path that meets the requirements and has the same drainage type in all pipe sections is defined as the path to be judged, and one of the multiple screening methods or a combination of two or more of the multiple screening methods is specified to select the upstream path that meets the conditions in the path to be judged as the target path; If they are inconsistent, the following judgment is made: the upstream path to which the largest top 1% value belongs or the upstream path with inconsistent drainage type of the only pipe section is selected as the target path; The various screening methods include the following: Pipe segment twist rate screening: select the upstream path with the lowest pipe segment twist rate in the path to be judged as the target path; Pipeline slope change rate screening: select the upstream path with the lowest pipe slope change rate in the path to be judged as the target path; Screening of the number of open channels: Screening the upstream path with the largest number of open channels among the paths to be determined as the target path; Combining two or more of the plurality of screening methods means: selecting two or more of the plurality of screening methods; sorting the two or more screening methods; using the aforementioned screening methods to screen in the set order, and using the target path screened by the screening method that is sorted first as the path to be determined by the screening method that is sorted later; S4-4: define the target path as the main branch; S5: Based on the n value, the upstream path of the identified main branch and the nodes contained therein are assigned hierarchical values, and then based on the hierarchical values ​​of the nodes on the main branch, the nodes in the loop are assigned hierarchical values; S6: Determine whether all nodes in the node set to be classified have been classified and graded. If all nodes have been classified and graded, proceed to the next step; if not all nodes have been classified and graded, return to step S2; S7: classify the pipe segments based on the node classification results; S8: Generate a data set including node stratification and classification results and pipe segment stratification and classification results.

2. The pipe network classification method according to claim 1, characterized in that: The method of hierarchical and graded assignment of the nodes described in step S5 is as follows: for the upstream path identified as the main branch and the nodes contained therein, the hierarchical and graded assignment is the n value after the main branch is identified in step S5; the hierarchical and graded assignment of the nodes within the identified loop is the same as the hierarchical and graded assignment of the graded nodes outside the loop.

3. The pipe network classification method according to claim 2, characterized in that: The method for determining whether all nodes in the node set to be classified are hierarchically graded in step S6 is as follows: the nodes with hierarchical grading values ​​assigned to them are an intermediate set, the nodes in the intermediate set are used as downstream nodes for the next node hierarchical grading, and the intermediate set in the node set to be classified is deleted; determine whether the node set to be classified is an empty set, if it is an empty set, proceed to the next step, if it is a non-empty set, return to step S2 for the next node hierarchical grading, until the node set to be classified is an empty set.

4. The pipe network classification method according to claim 1, characterized in that: The method of layering and grading the pipe segment described in step S7 is: determine whether the hierarchical grading values ​​of the nodes at both ends of the pipe segment are consistent. If they are consistent, the hierarchical grading value of the pipe segment is the same as the hierarchical grading of the nodes at both ends; if they are inconsistent, the hierarchical grading value of the pipe segment is the same as the node at the end with the larger hierarchical grading value of the nodes at both ends.

5. A pipe network classification system, characterized in that: include, A directed graph construction module is used to obtain pipe network data to construct a directed graph, and all nodes of the directed graph constitute a set of nodes to be graded, and input the hierarchical grade n, and set the initial value of n to 0; wherein the pipe network data includes the node name of the connected pipe segment, pipe segment information, and maintenance management information; the nodes connecting the pipe segments in the pipe network data are defined as nodes in the directed graph, and the names of the nodes connecting the pipe segments are defined as node attributes in the directed graph; the pipe segments in the pipe network data are defined as edges of the directed graph, and the pipe segment information is defined as edge attributes of the directed graph; wherein the pipe segment information includes the pipe segment name, the node names connected at both ends of the pipe segment, the drainage type, the pipe segment width, the cross-sectional area shape of the pipe segment, the pipe segment twist rate, the pipe segment slope change rate, and the number of open channels; The recursive traversal module uses a depth-first search method to recursively traverse all upstream paths in the directed graph according to the specified downstream nodes; A loop identification module identifies whether there is a loop in the upstream path. If there is no loop, the upstream path is input into the multi-index hierarchical decision evaluation module; if there is a loop, the upstream path is input into the node stratification and classification module; The multi-index hierarchical decision-making evaluation module uses a multi-index hierarchical decision-making to evaluate the upstream path, identifies the main branch, and sets n=n+1 after identifying the main branch; the method of using a multi-index hierarchical decision-making to evaluate the upstream path is as follows: Ⅰ-1: Count the top 1% of the pipe width in all upstream paths; Ⅰ-2: Set a threshold for the pipe width, and determine whether the upstream path meets the requirements based on the top 1% value of the pipe width in the upstream path and the threshold. If there is a pipe width in the upstream path whose top 1% value is greater than or equal to the threshold, then the upstream path to which the top 1% value of the pipe width in the upstream path belongs is determined to meet the requirements, and proceed to the next step; if the top 1% values ​​of the pipe width in all the statistical upstream paths are less than the threshold, then reset the threshold until there is a pipe width in the upstream path whose top 1% value is greater than or equal to the threshold; I-3: Identify whether the drainage type of all pipe sections in the same upstream path or the same upstream path with loops that meet the regulations is consistent; If they are consistent, the following judgment is made: when n≤1, the upstream path is determined to be the highest level path, and the highest level path is used as the target path; when n>1, the upstream path that meets the requirements and has the same drainage type in all pipe sections is defined as the path to be judged, and one of the multiple screening methods or a combination of two or more of the multiple screening methods is specified to select the upstream path that meets the conditions in the path to be judged as the target path; If they are inconsistent, the following judgment is made: the upstream path to which the largest top 1% value belongs or the upstream path with inconsistent drainage type of the only pipe section is selected as the target path; The various screening methods include the following: Pipe segment twist rate screening: select the upstream path with the lowest pipe segment twist rate in the path to be judged as the target path; Pipeline slope change rate screening: select the upstream path with the lowest pipe slope change rate in the path to be judged as the target path; Screening of the number of open channels: Screening the upstream path with the largest number of open channels among the paths to be determined as the target path; Combining two or more of the plurality of screening methods means: selecting two or more of the plurality of screening methods; sorting the two or more screening methods; using the aforementioned screening methods to screen in the set order, and using the target path screened by the screening method that is sorted first as the path to be determined by the screening method that is sorted later; Ⅰ-4: Define the target path as the main branch; The node stratification and grading module stratifies and grades the upstream path of the main branch and the nodes contained therein identified by the multi-index hierarchical decision-making evaluation module based on the n value, and then stratifies and grades the nodes in the loop based on the node stratification and grading assignment on the main branch; A loop judgment module is used to judge whether all nodes in the node set to be classified are hierarchical and classified. If all nodes are hierarchical and classified, the results of node hierarchical and classified are transmitted to the pipe segment hierarchical and classified module and the result output module; If not all nodes have been hierarchically graded, the current node hierarchical grading result is input into the directed graph construction module and the recursive traversal module, and the recursive traversal module, the loop identification module, the multi-index hierarchical decision evaluation module, the node hierarchical grading module and this module are cyclically run until all nodes in the node set to be graded are hierarchically graded; The pipe segment stratification and grading module can stratify and grade pipe segments based on the node grading results; The result output module is used to collect the node stratification and grading results of the node stratification and grading module and the pipe segment stratification and grading results of the pipe segment stratification and grading module, and generate a data set including the node stratification and grading results and the pipe segment stratification and grading results.

6. An electronic device, characterized in that: The method comprises one or more processors, one or more memories and one or more programs, wherein the programs are stored in the memories and are configured to be executed by the processors, and when the programs are loaded into the processors, the steps of the pipe network classification method according to any one of claims 1 to 4 are implemented.

7. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores a computer program, wherein the computer program includes program instructions, and when the program instructions are executed by a processor, the processor executes the steps of the pipeline network classification method according to any one of claims 1 to 4.