A method for arranging monitoring points for defect diagnosis of drainage pipe networks

Abstract

A method for arranging monitoring points for the defect diagnosis of drainage pipe networks. Based on the pipe network geographic information system data, a grouped topology table is constructed through topological structure extraction and connectivity analysis. The nodes are stratified according to the flow aggregation path to form an upstream-downstream hierarchical relationship with closed flow. Combining point position backtracking, aggregation, and upstream-downstream query within the group, the point positions within each layer of node groups are adjusted to ensure flow closure. With the goal of minimizing the number of monitoring points and covering the longest pipe diameters, the optimal combination of node groups is selected through an optimization model, and the final monitoring points are generated by integrating pipe diameter thresholds and environmental factors. This method solves the problems of low efficiency, insufficient coverage, and lack of flow closure in traditional manual arrangement through a flow closure algorithm and a hierarchical optimization mechanism, realizes automatic and high-precision point position arrangement, significantly improves the timeliness and accuracy of defect diagnosis, reduces the monitoring cost at the same time, and provides systematic technical support for the operation and maintenance of urban drainage pipe networks.

Description

Technical Field

[0001] The present invention relates to the technology of drainage pipe network monitoring, and particularly to a method for arranging monitoring points for defect diagnosis of drainage pipe networks. Background Art

[0002] The diagnosis of functional defects in urban drainage pipe networks is an important means to ensure the normal operation of urban drainage systems. Traditional diagnosis methods mainly rely on manual inspections and empirical judgments, which have problems such as low efficiency, high cost, and high missed diagnosis rates.

[0003] Pipe network defect diagnosis technologies such as the water quality and quantity balance method require accurate closure of the flow in the monitored area to perform effective defect analysis. The traditional monitoring point arrangement methods currently used lack scientificity and are difficult to ensure flow closure, resulting in inaccurate diagnosis results - they mainly rely on population and socio-economic related data in the drainage area to give a rough numerical relationship between water use and drainage, and then compare with the measured data to give a diagnosis conclusion, lacking timeliness and accuracy.

[0004] Generally speaking, the current monitoring point arrangement methods mostly rely on historical data and manual experience, cannot be flexibly adjusted in real time according to the area where the pipe network is located, lack systematicness and scientificity, and are difficult to ensure the coverage range and arrangement efficiency of monitoring points.

[0005] It should be noted that the information disclosed in the above background art section is only used for understanding the background of the present application, and thus may include information that does not constitute the prior art known to those of ordinary skill in the art. Summary of the Invention

[0006] The main object of the present invention is to overcome the defects existing in the above background art, and provide a method for arranging monitoring points for defect diagnosis of drainage pipe networks.

[0007] To achieve the above object, the present invention adopts the following technical solutions:

[0008] A method for arranging monitoring points for defect diagnosis of drainage pipe networks includes the following steps:

[0009] S1. Pretreatment of pipe network information data: Based on the pipe network geographic information system data, extract the pipe network topological structure information, and construct a grouped topological structure table through connectivity analysis;

[0010] S2. Stratification of pipe network area nodes: According to the flow convergence path, divide the nodes in the pipe network area into levels to form an upstream and downstream hierarchical relationship with closed flow;

[0011] S3. Arrangement of flow closure points: Adjust the points within each hierarchical node group through point backtracking, point aggregation, and upstream and downstream query within the group to ensure flow closure;

[0012] S4. Optimal Point Layout Scheme Screening: Taking the minimum number of monitoring points and the longest covered pipe diameter as the optimization objectives, solve the combination of upstream and downstream node groups that meet the constraint conditions to generate the optimal point layout scheme;

[0013] S5. Generation of Final Monitoring Points: Combine the pipe diameter threshold, point characteristics, and environmental factors, screen and adjust the flow closure scheme to generate the final monitoring points.

[0014] Further, step S1 specifically includes:

[0015] Identify the interconnected node groups in the pipe network through the breadth-first search algorithm and construct a simplified storage table containing topological relationships; perform integrity verification on the data to ensure adaptation to subsequent layering and layout algorithms.

[0016] Further, the hierarchical division in step S2 is specifically:

[0017] Mark the starting node of the sewage inlet pipe as the first level, and sequentially mark the downstream nodes as the second level to the final level along the flow direction. The nodes at the same level form a flow-closed node group, and an upstream-downstream relationship is formed between the node groups at different levels.

[0018] Further, step S3 specifically includes:

[0019] Perform the following operations on each level of node group:

[0020] Verify the flow completeness of the upstream first-level nodes of the nodes in the current level node group through the point backtracking algorithm; if the flow is incomplete, readjust the node group until the completeness condition is met;

[0021] Merge redundant nodes to the common downstream node through the point aggregation algorithm to reduce the number of points within the group;

[0022] Delete redundant points with direct upstream-downstream relationships within the group through the in-group upstream-downstream query algorithm to ensure the flow closure of the nodes within the group;

[0023] Finally, select the combination of upstream and downstream node groups at different levels as the layout scheme for flow closure.

[0024] Further, in step S4, the optimal point layout scheme screening method specifically includes:

[0025] Construct an objective function, taking the minimum number of monitoring points and the longest covered pipe diameter as the weighted optimization objectives;

[0026] Calculate the objective function values of all possible combinations of upstream and downstream node groups and sort them by priority;

[0027] Select the combination of node groups with the optimal objective function value and verify whether the total number of points meets the preset constraints;

[0028] If the total number of points does not meet the constraints, the sub-region is divided with the current optimal combination, and the iteration calculation is restarted until a layout plan that meets the conditions is generated.

[0029] Further, the on-site layout principles in step S5 include:

[0030] Exclude the points at pipe segments with a pipe diameter less than the preset threshold; exclude the equipment points where water quality sampling cannot be carried out; preferentially select the points near the river channel to monitor the problem of river water pouring into the pipe network.

[0031] Further, the method further includes:

[0032] Based on the final layout plan, establish the balance equations of water quality component concentration and flow rate and the total water volume balance equation in the flow closure area; according to the water quality component concentration and flow rate data of each monitoring point measured on-site, calculate the difference between the theoretical value and the measured value of the balance equation respectively; compare the difference value with the preset threshold standard, and if it exceeds the threshold, it is determined that there is a problem of water quality and water volume imbalance in this area to locate the potential defect area of the pipe network.

[0033] Further, in combination with the flow-closed layout plan obtained by the point backtracking, point aggregation and upstream and downstream query algorithms within the group in step S3, provide the basis of the flow closure area for the establishment of the water quality and water volume balance equation.

[0034] A computer-readable storage medium stores a computer program, and when the computer program is executed by a processor, it implements the monitoring point layout method for drainage pipe network defect diagnosis described above.

[0035] A computer program product includes a computer program, and when the computer program is executed by a processor, it implements the monitoring point layout method for drainage pipe network defect diagnosis described above.

[0036] The present invention has the following beneficial effects:

[0037] The present invention has the following advantages:

[0038] The present invention provides a method for arranging monitoring points for diagnosing defects in a drainage pipe network. Through flow closure point selection and hierarchical optimization based on the pipe network topology, the present invention overcomes the deficiencies of traditional methods that rely on manual experience, historical data, and lack of flow closure, realizes automatic and scientific arrangement of monitoring points, significantly improves the arrangement efficiency and diagnosis accuracy; through hierarchical node division, flow closure adjustment, and optimization screening mechanism, it ensures that the maximum pipe segment length is covered with the fewest monitoring points, accurately reflects the operation status of the pipe network while reducing the monitoring cost, and dynamically adjusts the plan in combination with the actual on-site environmental factors, with high efficiency, economy, and practical value, effectively solving the problems of high misdiagnosis rate, poor timeliness, and insufficient coverage of traditional methods, and providing systematic and highly operable technical support for diagnosing defects in urban drainage pipe networks.

[0039] Other beneficial effects in the embodiments of the present invention will be further described below. Brief Description of the Drawings

[0040] Figure 1 is the overall flowchart of the method for arranging monitoring points for diagnosing defects in a drainage pipe network according to the present invention.

[0041] Figure 2 is the flowchart of the algorithm for arranging monitoring points in the embodiment of the present invention.

[0042] Figure 3 is the flowchart of the algorithm for arranging pipe network nodes with flow closure in the embodiment of the present invention.

[0043] Figure 4 is the iterative flowchart for screening the optimal point arrangement scheme in the embodiment of the present invention.

[0044] Figure 5A is a schematic diagram of a traditional point arrangement scheme.

[0045] Figure 5B is a schematic diagram of the arrangement scheme in the embodiment of the present invention. Detailed Embodiments

[0046] The following makes a detailed description of the embodiments of the present invention. It should be emphasized that the following description is merely exemplary and not intended to limit the scope of the present invention and its applications.

[0047] In addition, the terms "first" and "second" are only used for descriptive purposes and cannot be construed as indicating or implying relative importance or implicitly specifying the quantity of the indicated technical features. Thus, features defined with "first" and "second" may explicitly or implicitly include one or more of such features. In the description of the embodiments of the present invention, "a plurality" means two or more unless otherwise specifically defined.

[0048] Refer to Figure 1 andFigure 2 , an embodiment of the present invention provides a method for arranging monitoring points for diagnosing defects in a drainage pipe network, including the following steps:

[0049] Step S1, preprocessing of pipe network information data: Based on the pipe network geographic information system data, extract the pipe network topology structure information, and construct a grouped topology structure table through connectivity analysis.

[0050] In some embodiments, step S1 specifically includes: identifying connected node groups in the pipe network through the breadth-first search algorithm, and constructing a simplified storage table containing topological relationships; performing integrity verification on the data to ensure adaptation to subsequent layering and arrangement algorithms.

[0051] Step S2, stratifying the nodes in the pipe network area: According to the flow convergence path, divide the nodes in the pipe network area into levels to form an upstream and downstream hierarchical relationship with closed flow.

[0052] In some embodiments, the level division in step S2 is specifically: marking the starting node of the sewage inlet pipe as the first level, and sequentially marking the downstream nodes as the second level to the final level along the flow direction. Nodes at the same level form a node group with closed flow, and an upstream and downstream relationship is formed between node groups at different levels.

[0053] Step S3, arranging the flow closure points: Adjust the points within each level of node group through point backtracking, point aggregation, and upstream and downstream query within the group to ensure flow closure.

[0054] In some embodiments, referring to Figure 3 , step S3 specifically includes: performing the following operations on each level of node group: verifying the flow completeness of the upstream first-level nodes of the nodes in the current level of node group through the point backtracking algorithm; if the flow is incomplete, readjust the node group until the completeness condition is met; merging redundant nodes to the common downstream node through the point aggregation algorithm to reduce the number of points within the group; deleting redundant points with direct upstream and downstream relationships within the group through the upstream and downstream query algorithm within the group to ensure the flow closure of the nodes within the group; finally, selecting combinations of upstream and downstream node groups at different levels as the layout scheme for flow closure.

[0055] Step S4, screening the optimal layout scheme: Taking the minimum number of monitoring points and the longest covered pipe diameter as the optimization objectives, solve the combination of upstream and downstream node groups that meet the constraint conditions to generate the optimal layout scheme.

[0056] In some embodiments, referring to Figure 4, on the basis of dividing levels through regional hierarchical summary calculation in the aforesaid steps S2 and S3 and selecting an adjustment node group through a flow closure node group, in step S4, the optimal layout point scheme screening method specifically includes: constructing an objective function with the least number of monitoring points and the longest covered pipe diameter as weighted optimization objectives; calculating the objective function values of all possible upstream and downstream node group combinations and sorting them according to priority; selecting the node group combination with the optimal objective function value and verifying whether the total number of points meets the preset constraints; if the total number of points does not meet the constraints, dividing the sub-region with the current optimal combination and re-iterating the calculation until a layout scheme that meets the conditions is generated.

[0057] Step S5, generating the final monitoring points: Combining the pipe diameter threshold, point characteristics and environmental factors, screening and adjusting the flow closure scheme to generate the final monitoring points.

[0058] In some embodiments, the on-site layout principles in step S5 include: excluding the points at pipe segments with a pipe diameter smaller than the preset threshold; excluding the equipment points where water quality sampling cannot be carried out; preferentially selecting the points near the river channels to monitor the problem of river water pouring into the pipe network.

[0059] In some embodiments, the monitoring point layout method further includes:

[0060] Based on the final layout scheme, establishing a balance equation of water quality component concentration and flow rate and a total water volume balance equation within the flow closure area; according to the water quality component concentration and flow rate data measured at each monitoring point on-site, respectively calculating the difference between the theoretical value and the measured value of the balance equation; comparing the difference value with the preset threshold standard, and if it exceeds the threshold, determining that there is a problem of water quality and water volume imbalance in this area to locate the potential defect area of the pipe network.

[0061] In some embodiments, combining the flow closure layout scheme obtained through point backtracking, point aggregation and upstream and downstream query within the group in step S3 provides a basis for the flow closure area for establishing the water quality and water volume balance equation.

[0062] The monitoring point layout method for drainage pipe network defect diagnosis of the present invention effectively solves the problems of low efficiency, insufficient coverage and lack of flow closure in traditional manual layout through a flow closure algorithm and a hierarchical optimization mechanism, realizes automatic and high-precision point layout, significantly improves the timeliness and accuracy of defect diagnosis, reduces the monitoring cost at the same time, and provides systematic technical support for the operation and maintenance of urban drainage pipe networks.

[0063] The following further describes the specific embodiments of the present invention, its algorithm examples and experimental verification.

[0064] A method for laying out monitoring points for a drainage pipe network based on basic data information such as the pipe network topology of a city, see Figure 2The algorithm process for the layout of the indicated points specifically includes the following steps:

[0065] Pretreatment of pipe network information data:

[0066] Use the Python programming language and the Geopandas library to read and analyze pipe network GIS (Geographic Information System) data, including point information, pipe segment information, etc.

[0067] Check the data adaptability requirements to ensure data integrity and accuracy.

[0068] Through the breadth-first search algorithm, filter out the interconnected points in the pipe network (that is, perform a breadth-first traversal of all points in the pipe network information to obtain several groups of interconnected points, and the groups are not interconnected with each other), and construct a pipe network topology graph to form a simplified storage table with pipe network topology structure information.

[0069] Stratification of pipe network nodes:

[0070] Adopt the hierarchical summary calculation method. According to the pipe network topology and the flow collection situation, divide the pipe network nodes into different levels (that is, let the starting nodes of all sewage inlet pipes be the first level. Starting from a starting node, traverse the intermediate nodes until the final sewage treatment plant node is reached. According to the flow-through order, mark these nodes as the second, third,... levels in turn; mark all starting nodes in this way).

[0071] According to the above method, the nodes marked at the same level form a node group, and a flow-closed upstream and downstream relationship is formed between the node groups at different levels.

[0072] Layout of points with closed flow:

[0073] Adjust the points within each level of node group through point backtracking, point aggregation, and upstream and downstream query operations within the group to ensure closed flow.

[0074] Optimal point layout and iteration:

[0075] Taking the minimum number of monitoring points and the longest covered pipe diameter as the optimization objectives, combined with the pipe diameter threshold, point characteristics, and environmental factors, generate the optimal layout plan.

[0076] See Figure 3 , the algorithm for the layout of pipe network nodes with closed flow specifically includes the following process:

[0077] For each level of node group, apply the point backtracking algorithm, point aggregation algorithm, and upstream and downstream query algorithm within the group to adjust the points to ensure closed flow.

[0078] Find all the first-level nodes corresponding to the upstream of each node through point position backtracking, and determine whether the flow is complete (that is, whether the set of all first-level nodes corresponding to the upstream of the nodes in this layer is equal to the set composed of the first-level nodes of this pipe network).

[0079] Use the point position aggregation algorithm to reduce the number of point positions in the node group by merging existing nodes to their common downstream nodes (and this downstream node is not downstream of the nodes in this layer), ensuring that the flow remains unchanged.

[0080] The upstream and downstream query algorithm within the group is used to delete the point positions that are in the upstream and downstream relationship in the node group to avoid duplicate calculation of the flow.

[0081] After the above adjustment process is completed for the node groups at all levels, arbitrarily select two node groups from different layers, with the one with a smaller level as the upstream and the one with a larger level as the downstream. Such a combination of the upstream node group and the downstream node group can be used as a point position layout scheme with a closed flow.

[0082] See Figure 4 , in order to realize the screening of the optimal point layout scheme, an iterative process for screening the optimal point layout scheme is designed: carry out regional hierarchical summary calculation according to the pipe network topology structure and flow direction, mark the starting node as the first level and mark the subsequent levels in turn along the flow direction. Through point position backtracking, aggregation and upstream and downstream query operations within the group, verify and adjust the point positions within the node group to ensure that the flow is closed and then select the node group combination. By establishing an optimization model, with the goal of the least number of monitoring points and the longest covered pipe diameter, construct an objective function, and determine the total number constraint of the point position layout scheme according to the actual situation, calculate the objective function values of all upstream and downstream node group combinations, solve this optimization model, obtain the optimal upstream and downstream node group combination, and thus determine the optimal point layout scheme. Methods such as exhaustive method, branch and bound method, ant colony algorithm, simulated annealing algorithm, etc. can be used to solve the optimization model ( Figure 4 the exhaustive method is adopted in the solution process shown). Judge whether the total number of combinations meets the actual conditions. If it meets, retain this combination as the layout scheme and end; if it does not meet, divide the sub-region with the current combination and re-perform the above process.

[0083] Consider the principles for on-site layout of point positions:

[0084] Consider factors such as pipe segment diameter, point position characteristics, point position connectivity attributes, and river channels around the point position, and formulate on-site layout principles. Specifically, for example: no point positions are arranged for pipe segments with a diameter less than 300mm; no point positions are arranged for point positions where water quality sampling cannot be carried out (such as: pumping stations, sewage treatment equipment, sewage storage tanks, etc.); if it is necessary to focus on monitoring the problem of river water pouring into the pipe network, priority is given to selecting point positions near river channels when selecting point positions.

[0085] According to the actual needs of drainage pipe network defect detection, considering the above factors, formulate on-site principles, screen the point layout schemes for flow closure, assist the optimal screening model for screening, and obtain the flow closure layout scheme that meets the on-site principle constraints. This scheme can combine the water quality and quantity balance method to establish water quality and quantity balance equations for the areas with flow closure (see the following formulas (1.1) and (1.2)), measure the water quality and quantity data at the layout points on-site, calculate the differences between the left and right sides of the equations, and preliminarily determine whether there are problems of water quality and quantity imbalance in the area by combining the thresholds of relevant standards (such as 10% - 12% given in GB50013 - 2018), so as to provide a basis for diagnosing the defects of the drainage pipe network.

[0086]

[0087]

[0088] Among them, represents the upstream node number, represents the downstream node number, represents the water quality component number, ( ) represents the measured flow at the node numbered , ( ) represents the concentration of the water quality component numbered at the node numbered .

[0089] Example

[0090] Taking the drainage pipe network in a certain area as an example, this area has complete pipe network information required by the present invention (each drainage pipe network node has a unique number information and geographical location information, and each drainage pipe network section has unique number information of upstream and downstream nodes and geographical location information of the pipe section), and the method provided by the present invention is used for monitoring point layout:

[0091] Preprocessing of pipe network information: There are 36,968 effective nodes in the drainage pipe network of this area. The main structure of the pipe network is automatically extracted by the present invention, redundant points are removed, and a pipe network information table including topological relationships is formed after 3.18 minutes of calculation.

[0092] Stratification of pipe network nodes: All nodes in this area are divided into 215 layers, and the stratification calculation takes about 26 hours.

[0093] Screening of the optimal layout scheme: The number of points is determined to be limited to 100. After 6 iterations, it takes 10 hours, 3 hours, 2 hours, 32 minutes, 10 minutes, and 8 minutes in sequence, and finally 108 node groups in only the core area of the whole pipe network (the total pipe diameter length accounts for about 10%) are determined as the alternative scheme set.

[0094] On-site principle determination: Delete the points at pipe sections with a pipe diameter less than 300 mm and the points where water quality sampling cannot be carried out; Select two points near the river channels, which limits the above-mentioned alternative solution set.

[0095] Finally, 34 monitoring points were determined, covering the main pipe sections of the demonstration area. Compared with the traditional point layout scheme (a total of 42 points were selected), the scheme formed by the present invention can more efficiently and economically diagnose the defects of the pipe network.

[0096] Figure 5A and Figure 5B It shows the result comparison between the traditional point layout scheme and the point layout scheme of the present invention.

[0097] In summary, the present invention provides a method for arranging monitoring points for diagnosing defects in a drainage pipe network, designs a flow-closed point selection algorithm based on the pipe network topology structure, and can ensure the flow closure of the monitoring points. The present invention fully considers the actual on-site situation, formulates the principle of arranging points, and significantly improves the operability and practical application value of the monitoring points.

[0098] Compared with the prior art, the present invention has the following outstanding advantages:

[0099] High efficiency: Automatically arrange points through the algorithm, without manual point selection, improving work efficiency.

[0100] Accuracy: Based on the pipe network topology structure and the flow closure principle, ensure that the monitoring points can accurately reflect the operation status of the pipe network.

[0101] Economy: The optimization model can cover a longer pipe section length with fewer monitoring points, reducing the monitoring cost.

[0102] Practical value: Combined with the on-site layout principle, it can meet the actual application requirements.

[0103] The embodiment of the present invention also provides a storage medium for storing a computer program, and when the computer program is executed, it at least executes the method as described above.

[0104] The embodiment of the present invention also provides a control device, including a processor and a storage medium for storing a computer program; wherein, the processor is used to execute the computer program and at least execute the method as described above.

[0105] The embodiment of the present invention also provides a processor, and the processor executes a computer program and at least executes the method as described above.

[0106] The storage medium can be implemented by any type of non-volatile storage device, or a combination thereof. Among them, the non-volatile memory can be a read-only memory (ROM), a programmable read-only memory (PROM), an erasable programmable read-only memory (EPROM), an electrically erasable programmable read-only memory (EEPROM), a ferromagnetic random access memory (FRAM), a flash memory, a magnetic surface memory, an optical disc, or a compact disc read-only memory (CD-ROM); the magnetic surface memory can be a disk memory or a tape memory. The storage medium described in the embodiments of the present invention is intended to include, but not limited to, these and any other suitable types of memories.

[0107] In several embodiments provided by the present invention, it should be understood that the disclosed systems and methods can be implemented in other ways. The device embodiments described above are merely illustrative. For example, the division of the units is only a logical function division, and there may be other division methods in actual implementation. For example, multiple units or components can be combined, or can be integrated into another system, or some features can be ignored, or not executed. In addition, the coupling, direct coupling, or communication connection between the components shown or discussed with each other can be through some interfaces, and the indirect coupling or communication connection of the devices or units can be electrical, mechanical, or other forms.

[0108] The units described above as separate components may or may not be physically separated, and the components shown as units may or may not be physical units, that is, they can be located in one place or distributed to multiple network units; some or all of the units can be selected according to actual needs to achieve the purpose of the solution of this embodiment.

[0109] In addition, each functional unit in the embodiments of the present invention can be all integrated in a processing unit, or each unit can be separately used as a unit, or two or more units can be integrated in a unit; the above integrated units can be implemented in the form of hardware, or in the form of a combination of hardware and software functional units.

[0110] Those of ordinary skill in the art will understand that all or part of the steps of implementing the above method embodiments can be completed by hardware related to program instructions. The aforementioned program can be stored in a computer-readable storage medium. When the program is executed, it performs the steps including those of the above method embodiments; and the aforementioned storage medium includes: various media such as removable storage devices, read-only memory (ROM), random access memory (RAM), magnetic disks, or optical discs that can store program codes.

[0111] Alternatively, if the above integrated units are implemented in the form of software function modules and sold or used as independent products, they can also be stored in a computer-readable storage medium. Based on such an understanding, the technical solutions of the embodiments of the present invention, in essence or the parts that contribute to the prior art, can be embodied in the form of a software product. This computer software product is stored in a storage medium and includes several instructions for causing a computer device (which can be a personal computer, a server, or a network device, etc.) to execute all or part of the methods described in the various embodiments of the present invention. And the aforementioned storage medium includes: various media such as removable storage devices, ROM, RAM, magnetic disks, or optical discs that can store program codes.

[0112] The methods disclosed in several method embodiments provided by the present invention can be arbitrarily combined without conflict to obtain new method embodiments.

[0113] The features disclosed in several product embodiments provided by the present invention can be arbitrarily combined without conflict to obtain new product embodiments.

[0114] The features disclosed in several method or device embodiments provided by the present invention can be arbitrarily combined without conflict to obtain new method embodiments or device embodiments.

[0115] The above content is a further detailed description of the present invention in combination with specific preferred implementation manners. It cannot be determined that the specific implementation of the present invention is only limited to these descriptions. For those skilled in the technical field to which the present invention belongs, without departing from the concept of the present invention, several equivalent substitutions or obvious modifications can be made, and as long as the performance or use is the same, they should all be regarded as falling within the protection scope of the present invention.

Claims

1. A method for arranging monitoring points for defect diagnosis of a drainage pipe network, characterized in that, It includes the following steps: S1. Pretreatment of pipeline network information data: Based on the pipeline network geographic information system data, extract the pipeline network topology structure information, and construct a grouped topology structure table through connectivity analysis; S2. Hierarchical division of pipeline network area nodes: According to the flow convergence path, divide the nodes in the pipeline network area into levels to form an upstream and downstream hierarchical relationship with closed flow; S3. Layout of flow closed points: Adjust the points within each hierarchical node group through point backtracking, point aggregation, and upstream and downstream query within the group to ensure flow closure; Step S3 specifically includes: Perform the following operations on each hierarchical node group: Verify the flow completeness of the upstream first-level nodes of the nodes in the current hierarchical node group through the point backtracking algorithm; if the flow is incomplete, readjust the node group until the completeness condition is met; Merge redundant nodes into the common downstream node through the point aggregation algorithm to reduce the number of points within the group; Delete redundant points with direct upstream and downstream relationships within the group through the upstream and downstream query algorithm within the group to ensure the flow closure of the nodes within the group; Finally, select the combination of upstream and downstream node groups at different levels as the layout scheme with closed flow; S4. Screening of the optimal point layout scheme: Taking the minimum number of monitoring points and the longest covered pipe diameter as the optimization objectives, solve the combination of upstream and downstream node groups that meet the constraint conditions to generate the optimal point layout scheme; In step S4, the method for screening the optimal point layout scheme specifically includes: Construct an objective function, taking the minimum number of monitoring points and the longest covered pipe diameter as the weighted optimization objectives; Calculate the objective function values of all possible combinations of upstream and downstream node groups and sort them according to the priority; Select the combination of node groups with the optimal objective function value and verify whether the total number of points meets the preset constraints; If the total number of points does not meet the constraints, divide the sub-region with the current optimal combination and re-iterate the calculation until a layout scheme that meets the conditions is generated; S5. Generation of the final monitoring points: Combine the pipe diameter threshold, point characteristics, and environmental factors to screen and adjust the flow closure scheme to generate the final monitoring points.

2. The monitoring point layout method according to claim 1, characterized in that, Step S1 specifically includes: Identify the interconnected node groups in the pipeline network through the breadth-first search algorithm and construct a simplified storage table containing topological relationships; perform integrity verification on the data to ensure adaptation to the subsequent hierarchical and layout algorithms.

3. The monitoring point layout method according to claim 1, characterized in that The hierarchical division described in step S2 is specifically: Mark the starting node of the sewage inlet pipe as the first level, and sequentially mark the downstream nodes as the second level to the final level along the flow direction. The nodes at the same level form a node group with closed flow, and an upstream and downstream relationship is formed between the node groups at different levels.

4. The monitoring point layout method according to claim 1, wherein The following on-site layout principles are adopted in step S5: Exclude the points at pipe segments with a diameter smaller than the preset threshold; exclude the equipment points where water quality sampling cannot be performed; preferentially select the points near the river channel to monitor the problem of river water pouring into the pipeline network.

5. The monitoring point layout method according to claim 1, characterized in that The method further includes: Based on the final layout plan, establish the balance equations of water quality component concentration and flow rate and the total water volume balance equation within the flow closure area; according to the water quality component concentration and flow rate data of each monitoring point measured on-site, calculate the differences between the theoretical values and the measured values of the balance equations respectively; compare the difference values with the preset threshold standard, and if it exceeds the threshold, it is determined that there is a problem of water quality and quantity imbalance in this area to locate the potential defect area of the pipe network.

6. The monitoring point layout method according to claim 5, wherein, Combined with the layout plan with flow closure obtained through point backtracking, point aggregation and upstream and downstream query within the group in step S3, it provides the basis of the flow closure area for the establishment of the water quality and quantity balance equations.

7. A computer-readable storage medium storing a computer program, characterized in that, When executed by a processor, the computer program implements the monitoring point layout method for drainage pipe network defect diagnosis according to any one of claims 1 to 6.

8. A computer program product, comprising a computer program, characterized in that, When executed by a processor, the computer program implements the monitoring point layout method for drainage pipe network defect diagnosis according to any one of claims 1 to 6.

Images