Monitoring point layout method for defect diagnosis of drainage pipe network

Abstract

A monitoring point layout method for defect diagnosis of a drainage pipe network comprises the following steps: based on pipe network geographic information system data, constructing a grouping topology table through topological structure extraction and connectivity analysis, layering nodes according to a flow collection path to form a flow-closed upstream and downstream hierarchical relationship, and combining point backtracking, collection and upstream and downstream query in a group to obtain a flow-closed upstream and downstream hierarchical relationship; point locations in each layer of node group are adjusted to ensure the flow closeness; and with the fewest monitoring points and the longest covered pipe diameter as targets, an optimal node group combination is screened through an optimization model, and a final monitoring point position is generated by fusing a pipe diameter threshold value and environmental factors. According to the method, through a flow closing algorithm and a hierarchical optimization mechanism, the problems of low efficiency, insufficient coverage and flow closing deficiency of traditional manual layout are solved, automatic and high-precision point location layout is realized, the timeliness and accuracy of defect diagnosis are remarkably improved, meanwhile, the monitoring cost is reduced, and systematic technical support is provided for operation and maintenance of the urban drainage network.

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 conduct 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, and cannot be flexibly adjusted in real time according to the area where the pipe network is located. They 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 purpose 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 purpose, the present invention adopts the following technical solutions: A method for arranging monitoring points for defect diagnosis of drainage pipe networks includes the following steps: 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; S2. Stratification of pipe network area nodes: According to the flow aggregation path, divide the nodes in the pipe network area into levels to form an upstream and downstream hierarchical relationship with closed flow; S3. Arrangement of flow closure points: Through point backtracking, point aggregation, and upstream and downstream query within the group, adjust the points within each hierarchical node group to ensure flow closure; S4. Optimal monitoring point layout plan screening: Taking the minimum number of monitoring points and the longest covered pipe diameter as the optimization objectives, solve the upstream and downstream node group combinations that meet the constraint conditions to generate the optimal monitoring point layout plan; S5. Generation of final monitoring points: Combine the pipe diameter threshold, point characteristics, and environmental factors to screen and adjust the flow closure plan to generate the final monitoring points.

[0008] Further, step S1 specifically includes: 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.

[0009] Further, the hierarchical division 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 flow-closed node group, and an upstream and downstream relationship is formed between different-level node groups.

[0010] Further, step S3 specifically includes: Perform the following operations on each level of node groups: Verify the flow completeness of the upstream first-level nodes of the nodes in the current level of node groups 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-convergence algorithm to reduce the number of points within the group; Delete redundant points with direct upstream and downstream relationships within the group through the in-group upstream and downstream query algorithm to ensure the flow closure of the nodes within the group; Finally, select the upstream and downstream node group combinations at different levels as the layout plan for flow closure.

[0011] Further, in step S4, the optimal monitoring point layout plan screening method 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 upstream and downstream node group combinations and sort them by priority; Select the node group combination 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 plan that meets the conditions is generated.

[0012] Further, the on-site layout principles in step S5 include: Exclude the points at pipe segments with a diameter smaller than the preset threshold; exclude the equipment points where water quality sampling cannot be carried out; preferentially select the points near the river channels to monitor the problem of river water flowing into the pipe network.

[0013] Further, 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.

[0014] Further, combined 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 quantity balance equations.

[0015] 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.

[0016] 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.

[0017] The present invention has the following beneficial effects: The present invention has the following advantages: The present invention provides a monitoring point layout method for drainage pipe network defect diagnosis. Through the flow-closed point selection and hierarchical optimization based on the pipe network topology structure, the present invention overcomes the deficiencies of traditional methods that rely on manual experience, historical data and lack of flow closure, realizes the automatic and scientific layout of monitoring points, significantly improves the layout efficiency and diagnosis accuracy; through the 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, reflects the operation status of the pipe network accurately 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 solves the problems of high missed diagnosis rate, poor timeliness and insufficient coverage of traditional methods, and provides systematic and highly operable technical support for the defect diagnosis of urban drainage pipe networks.

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

[0019] Figure 1 It is the overall flowchart of the monitoring point layout method for drainage pipe network defect diagnosis of the present invention.

[0020] Figure 2 This is the flow chart of the monitoring point layout algorithm for the embodiments of the present invention.

[0021] Figure 3 This is the flow chart of the layout algorithm for the pipe network nodes with flow closure for the embodiments of the present invention.

[0022] Figure 4 This is the iterative flow chart for screening the optimal layout scheme for the embodiments of the present invention.

[0023] Figure 5A This is a schematic diagram of the traditional point layout scheme.

[0024] Figure 5B This is the schematic diagram of the layout scheme for the embodiments of the present invention. Specific Embodiments

[0025] The following provides 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 and application of the present invention.

[0026] 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, the 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.

[0027] Refer to Figure 1 and Figure 2 , the embodiments of the present invention provide a method for laying out monitoring points for diagnosing defects in a drainage pipe network, including the following steps: 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.

[0028] In some embodiments, step S1 specifically includes: identifying the interconnected 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 hierarchical and layout algorithms.

[0029] Step S2, hierarchical division of pipe network area nodes: According to the flow aggregation path, divide the nodes in the pipe network area into levels to form an upstream-downstream hierarchical relationship with flow closure.

[0030] In some embodiments, the hierarchical division in step S2 is specifically as follows: The starting node of the sewage inlet pipe is marked as the first level, and the downstream nodes are sequentially marked 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-downstream relationship is formed between node groups at different levels.

[0031] Step S3, Layout of flow closure points: By point backtracking, point aggregation, and upstream-downstream query within the group, adjust the points within each level of node group to ensure flow closure.

[0032] In some embodiments, refer 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-downstream relationships within the group through the upstream-downstream query algorithm within the group to ensure the flow closure of the nodes within the group; finally, selecting combinations of upstream-downstream node groups at different levels as the layout scheme for flow closure.

[0033] Step 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-downstream node groups that meet the constraint conditions to generate the optimal point layout scheme.

[0034] In some embodiments, refer to Figure 4 , on the basis of dividing levels through regional hierarchical summary calculation and selecting and adjusting node groups through flow closure node groups in the foregoing steps S2 and S3, in step S4, the method for screening the optimal point layout scheme specifically includes: constructing an objective function, taking the minimum number of monitoring points and the longest covered pipe diameter as the weighted optimization objectives; calculating the objective function values of all possible combinations of upstream-downstream node groups and sorting them by 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, divide the sub-region with the current optimal combination and recalculate iteratively until a layout scheme that meets the conditions is generated.

[0035] Step S5, Generation of the final monitoring points: Combining the pipe diameter threshold, point characteristics, and environmental factors, screen and adjust the flow closure scheme to generate the final monitoring points.

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

[0037] In some embodiments, the method for laying out the monitoring points further includes: Based on the final layout plan, establish the balance equations for water quality component concentration and flow rate, as well as the 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 in the field, 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 potential defect areas in the pipe network.

[0038] In some embodiments, in combination with the layout plan with flow closure obtained through point backtracking, point aggregation, and upstream and downstream query within the group in step S3, provide a basis for the flow closure area for the establishment of the water quality and quantity balance equations.

[0039] The method for arranging monitoring points for defect diagnosis of drainage pipe networks in 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.

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

[0041] A method for arranging monitoring points of a drainage pipe network based on basic data information such as the pipe network topology structure of an urban drainage pipe network, see Figure 2 the flow chart of the point layout algorithm shown, which specifically includes the following steps: Preprocessing of pipe network information data: Use the Python programming language and the Geopandas library to read and analyze the pipe network GIS (Geographic Information System) data, including point information, pipe segment information, etc.

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

[0043] Through the breadth-first search algorithm, filter out the interconnected points in the pipe network (that is: perform a breadth-first traversal on all points in the pipe network information to obtain several groups of interconnected points, and there is no connection between groups), and construct a pipe network topology structure diagram to form a simplified storage table with pipe network topology structure information.

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

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

[0046] Layout of points with closed flow: Adjust the points within each level of node groups through point backtracking, point aggregation, and upstream-downstream query operations within the group to ensure closed flow.

[0047] Optimal point layout and iteration: Taking the minimum number of monitoring points and the longest covered pipe diameter as the optimization objectives, combined with pipe diameter thresholds, point characteristics, and environmental factors, an optimal point layout plan is generated.

[0048] See Figure 3 , the algorithm for laying out pipe network nodes with closed flow specifically includes the following processes: For each level of node group, apply the point backtracking algorithm, point aggregation algorithm, and upstream-downstream query algorithm within the group to adjust the points to ensure closed flow.

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

[0050] Use the point aggregation algorithm to reduce the number of points in the node group by merging existing nodes to their common downstream nodes (and this downstream node is not downstream of the nodes at this level) to ensure that the flow remains unchanged.

[0051] The upstream-downstream query algorithm within the group is used to delete the points that are in an upstream-downstream relationship within the node group to avoid duplicate calculation of flow.

[0052] After the above adjustment process is completed for the node groups at all levels, arbitrarily select two node groups at different levels, 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 layout plan for points with closed flow.

[0053] See Figure 4, in order to screen the optimal point layout plan, an iterative process for screening the optimal point layout plan is designed: based on the pipe network topology and flow direction, regional hierarchical summary calculations are carried out, the starting node is marked as the first level, and subsequent levels are marked sequentially along the flow direction. Through point position backtracking, aggregation, and upstream and downstream query operations within the group, the point positions within the node group are verified and adjusted to ensure flow closure, and then the node group combinations are selected. By establishing an optimization model, with the goal of minimizing the number of monitoring points and maximizing the covered pipe diameter, an objective function is constructed, and the total number of points in the point layout plan is constrained according to the actual situation. The objective function values of all upstream and downstream node group combinations are calculated, and this optimization model is solved to obtain the optimal upstream and downstream node group combination, thereby determining the optimal point layout plan. 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 points in the combination meets the actual conditions. If it meets, retain this combination as the layout plan and end; if it does not meet, divide the sub-region with the current combination and re-perform the above process.

[0054] Principles for on-site layout of point positions are considered: Considering factors such as pipe section diameter, point position characteristics, point position connectivity attributes, and river channels around the point positions, on-site layout principles are formulated. Specifically, for example: no point positions are arranged for pipe sections 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, point positions near the river channel are preferentially selected when choosing point positions.

[0055] According to the actual needs of drainage pipe network defect detection, considering the above factors, on-site principles are formulated, the point layout plan with flow closure is screened, and the optimal screening model is assisted for screening to obtain a flow closure layout plan that meets the on-site principle constraints. This plan can combine the water quality and water volume balance method to establish a water quality and water volume balance equation for the area with flow closure (see the following formulas (1.1), (1.2)), measure the water quality and water volume data at the layout point positions on-site, calculate the difference between the left and right sides of the equation, and preliminarily determine whether there is a problem of water quality and water volume imbalance in this area in combination with the threshold of relevant standards (such as 10% - 12% given in GB50013 - 2018), so as to provide a basis for diagnosing drainage pipe network defects.

[0056]

[0057]

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

[0059] Example 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 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). The method provided by the present invention is used for monitoring point layout: Preprocessing of pipe network information: There are a total of 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.

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

[0061] Screening of the optimal layout plan: 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. Finally, only 108 node groups in the core area of the entire pipe network (the total pipe diameter length accounts for about 10%) are determined as the alternative plan set.

[0062] Determination of on-site principles: 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 to narrow down the above alternative plan set.

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

[0064] Figure 5A And Figure 5B shows the result comparison between the traditional point layout plan and the point layout plan of the present invention.

[0065] In summary, the present invention provides a method for monitoring point layout for drainage pipe network defect diagnosis, designs a flow closed point selection algorithm based on the pipe network topological structure, and can ensure the flow closure of monitoring points. The present invention fully considers the actual on-site situation, formulates point layout principles, and significantly improves the operability and practical application value of monitoring points.

[0066] Compared with the prior art, the present invention has the following outstanding advantages: High efficiency: The point layout is automatically carried out by the algorithm without manual point selection, improving work efficiency.

[0067] Accuracy: Based on the pipe network topology and the flow closure principle, it is ensured that the monitoring points can accurately reflect the operation status of the pipe network.

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

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

[0070] An embodiment of the present invention also provides a storage medium for storing a computer program, which when executed performs at least the method described above.

[0071] An 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 configured to perform at least the method described above when executing the computer program.

[0072] An embodiment of the present invention also provides a processor, which executes a computer program and performs at least the method described above.

[0073] 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, Read Only Memory), a programmable read-only memory (PROM, Programmable Read-Only Memory), an erasable programmable read-only memory (EPROM, Erasable Programmable Read-Only Memory), an electrically erasable programmable read-only memory (EEPROM, Electrically Erasable Programmable Read-Only Memory), a ferromagnetic random access memory (FRAM, Ferromagnetic Random Access Memory), a flash memory (Flash Memory), a magnetic surface memory, an optical disc, or a compact disc read-only memory (CD-ROM, Compact Disc Read-Only Memory); 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.

[0074] 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. In actual implementation, there may be other division methods. 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 couplings, direct couplings, or communication connections between the various components shown or discussed can be through some interfaces. The indirect couplings or communication connections of devices or units can be electrical, mechanical, or other forms.

[0075] The units described above as separate components may or may not be physically separated. 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.

[0076] 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-mentioned integrated units can be implemented in the form of hardware, or in the form of a combination of hardware and software functional units.

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

[0078] Alternatively, if the above-mentioned integrated units of the present invention are implemented in the form of software functional modules and sold or used as independent products, they can also be stored in a computer-readable storage medium. Based on this understanding, the technical solutions of the embodiments of the present invention, in essence, or the part that contributes to the prior art can be embodied in the form of a software product. The 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 foregoing storage medium includes: removable storage devices, ROM, RAM, magnetic disks, or optical discs and other various media that can store program codes.

[0079] In the method disclosed in several method embodiments provided by the present invention, they can be arbitrarily combined without conflict to obtain new method embodiments.

[0080] In the features disclosed in several product embodiments provided by the present invention, they can be arbitrarily combined without conflict to obtain new product embodiments.

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

[0082] The above content is a further detailed description of the present invention in combination with specific preferred embodiments. 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 pertains, without departing from the concept of the present invention, several equivalent substitutions or obvious variations can be made, and as long as the performance or use is the same, they should all be regarded as belonging to 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 aggregation path, divide the nodes in the pipeline network area into levels to form an upstream-downstream hierarchical relationship with closed flow; S3. Layout of flow closed points: Adjust the points within each level node group through point backtracking, point aggregation, and upstream-downstream query within the group to ensure flow closure; S4. Screening of the optimal layout plan: 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, and generate the optimal layout plan; S5. Generation of the final monitoring points: Combine the pipe diameter threshold, point characteristics, and environmental factors, screen and adjust the flow closure plan to generate the final monitoring points.

2. The monitoring point layout method according to claim 1, wherein, 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 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 along the flow direction as the second level to the final level. The nodes at the same level form a node group with closed flow, and an upstream-downstream relationship is formed between different level node groups.

4. The monitoring point layout method according to claim 1, characterized in that, Step S3 specifically includes: Perform the following operations on each level node group: 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; Merge redundant nodes into the common downstream node through the point aggregation algorithm to reduce the number of points within the group; Delete the redundant points with direct upstream-downstream relationships within the group through the upstream-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 plan for flow closure.

5. The monitoring point layout method according to claim 1, wherein In step S4, the method for screening the optimal layout plan 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 node group combination 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 plan that meets the conditions is generated.

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

7. 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 water volume imbalance in this area to locate the potential defect area of the pipe network.

8. The monitoring point layout method according to claim 7, 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 water volume balance equations.

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

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

Images