Water supply network burst valve shut-off auxiliary decision-making and impact assessment system

Abstract

This invention discloses a system for assisting decision-making and impact assessment of valve closure in water supply network bursts, belonging to the field of smart water management technology. It includes a network data extraction module, a loop detection module, a valve status check module, a redundant path identification module, a topology sorting module, and a conflicting path verification module. By extracting node and edge relationships from network data, an initial path set is generated using a depth-first search algorithm. Through loop detection, duplicate path filtering, valve status checks, and path truncation, the path set is progressively optimized to form an uninterrupted and unique upstream path. A topology sorting algorithm is applied to determine the path hierarchy, verifying and adjusting conflicting branches to ensure the accuracy and uniqueness of the path description. Through multi-step path optimization and hierarchical sorting, accurate tracing from the burst point to the water source and rapid location of the valve closure position are achieved, effectively assisting decision-making, assessing the impact range of the burst, and significantly improving the efficiency of emergency response and the scientific nature of water supply network management.

Description

Technical Field

[0001] This invention belongs to the field of information technology for smart water management and urban emergency management, and in particular relates to a system and method for auxiliary decision-making and impact assessment of valve closure in water supply network bursts, which is used to quickly and accurately determine valve closure schemes and assess the scope of impact when a pipe burst accident occurs. Background Technology

[0002] Water supply networks are a core component of urban lifeline systems, and the accurate construction of their topological hierarchy directly affects the reliability of water supply scheduling, pressure management, fault tracing, and hydraulic simulation. In complex urban networks, establishing a complete and accurate water supply path from end users to water sources is crucial for ensuring water supply security and efficient emergency response.

[0003] Many current pipeline topology construction methods are based on simplified connection assumptions, making it difficult to effectively address the widespread loop structures and valve opening / closing status changes in actual pipeline networks. When performing reverse path searches (tracing back from the user to the water source), these methods are prone to generating numerous redundant or contradictory paths by ignoring the dynamic constraints of the actual pipeline flow direction. For example, the same end water meter may correspond to multiple inconsistent upstream paths, mainly due to the following two interrelated problems: Loop problem: The loop structure in the pipeline network makes it easy for reverse search to get stuck in the same node, forming a closed loop and failing to converge to the unique water source, resulting in a large number of duplicate or invalid paths.

[0004] Valve status issue: Valves on the pipeline may be in the closed state, causing a path that should be open to be physically blocked. If this status is ignored, the system will incorrectly identify the interrupted path as a valid path. This error will be amplified, especially when loops exist, resulting in conflicting path records.

[0005] In practical applications, such as after a pipe burst, it is crucial to quickly locate the valves that should be closed to isolate the accident site. If the system's topology contains redundancies and contradictions, it can lead to incorrect valve-closing decisions, potentially causing unnecessary expansion of the water supply area or accidental water outages for critical users, severely impacting emergency response efficiency and the scientific basis of decision-making. Therefore, the core technical challenge in constructing a reliable water supply network topology and supporting precise valve-closing decisions lies in how to synchronously and effectively detect and handle path interruptions and logical conflicts caused by loops and valve closures during reverse searching, thereby ensuring that the hierarchical relationship from any end water meter to the water source is accurate, unique, and continuous. Summary of the Invention

[0006] The technical problem to be solved by this invention is to provide a system and method for auxiliary decision-making and impact assessment of valve closure in water supply network bursts, addressing the shortcomings of the prior art. Through a series of automated data processing and path optimization steps, the system eliminates loops, valve closure interruptions, path redundancy, and logical contradictions in the network topology, constructing an accurate, unique, and continuous hierarchical path from end users to the water source. In the event of a pipe burst, the system can quickly and accurately locate the valves that need to be closed and accurately assess the scope of affected users, thereby significantly improving the speed of emergency response and the scientific nature of decision-making.

[0007] To solve the above-mentioned technical problems, the present invention adopts the following technical solution: The water supply network burst valve closure auxiliary decision-making and impact assessment system specifically includes a network data extraction module, a loop detection module, a valve status check module, a redundant path identification module, a topology sorting module, and a conflict path verification module; Among them, the pipeline data extraction module is used to extract node and edge relationships from water supply pipeline data through a preset pipeline map. It uses a depth-first search algorithm to traverse the edges starting from the end user along the reverse search direction to obtain an initial search path set. The loop detection module is used to detect loop structures based on the initial search path set. If there are duplicate nodes in the path, it is marked as a loop access path. The filtered path set is obtained by removing the marked paths. The valve status check module is used to check the status of valves along the filtered path set. If a valve is closed, the corresponding path segment is truncated, and an uninterrupted path set is obtained by updating the path segment. The redundant path identification module is used to identify redundant paths from the set of uninterrupted paths. If multiple paths point to the same water source, similar segments are merged, and a unique upstream path is determined by merging segments. The topology sorting module is used to sort the hierarchical relationship of the unique upstream path using a topology sorting algorithm, and to determine the progressive order of the path from the end user to the water source based on the sorting result, so as to obtain the sorted path sequence. The contradictory path verification module is used to verify contradictory paths through the sorted path sequence. If inconsistent branches appear in the sequence, the conflicting parts are deleted, and the final accurate and unique hierarchical relationship description is obtained by adjusting the branches.

[0008] As a further preferred embodiment of the water supply network burst valve closure auxiliary decision-making and impact assessment system of the present invention, the network data extraction module specifically includes: The node connection and edge relationship information of water supply data are obtained from the preset pipeline network. Data extraction technology is used to perform structured processing on the raw data to obtain the sorted pipeline network topology dataset. Determine the specific location information of the end user, and construct a preliminary set of traversal starting points by reverse search, starting from the starting edge corresponding to the end user; A depth-first search algorithm is used to explore the starting edge layer by layer along the traversal direction, obtain the connection nodes and edge relationships at each level, and obtain a preliminary path record; Determine whether each path covers all relevant nodes. If not, continue to expand the search range along the traversal direction to determine the complete path coverage information. Obtain the connection order and edge relationships between nodes in the path, construct the detailed structure of the initial path, and obtain ordered path sequence data; The path set is categorized and organized, duplicate or redundant path information is extracted, the completeness and consistency of the path set are judged, and the final search path set is obtained.

[0009] As a further preferred embodiment of the water supply network burst valve closure auxiliary decision-making and impact assessment system of the present invention, the loop detection module specifically includes: Obtain the node connection relationships and edge information of the water supply network to obtain the sorted network topology dataset; Determine the location of the end user, and construct an initial search starting point set starting from the starting edge corresponding to the end user; A depth-first search algorithm is used to traverse the connecting edges and nodes layer by layer in the reverse direction, starting from the initial search starting point set, to obtain a preliminary path record set; Detect whether there are duplicate nodes in each path. If duplicate nodes are found, mark them as loop paths. By removing the marked loop paths, the filtered set of paths is obtained. Extract the node order and edge connection relationships of each path to construct a complete path structure and obtain acyclic path sequence data; Determine whether the path covers all water supply nodes. If it does not cover all nodes, rebuild the search starting point set from the starting edges corresponding to the remaining uncovered nodes, and continue traversing using the depth-first search algorithm to obtain a supplementary path record set. The supplementary path record set is merged with the filtered path set to obtain the final complete acyclic path set.

[0010] As a further preferred embodiment of the water supply network burst valve closure auxiliary decision-making and impact assessment system of the present invention, the valve status inspection module specifically includes: For the filtered path set, a state detection method is used to analyze the valve status involved in the inspection along the path one by one, and obtain the distribution record of valve status. If a closed valve is detected, the corresponding path is marked, the path segments that need to be truncated are determined, and a list of path segments to be processed is obtained. For each path segment that needs to be truncated, perform a path segment update operation to remove invalid path portions after the valve is closed, and obtain an updated set of path segments; Check the path integrity to determine if there are still path segments that contain closed valves. If so, divide these path segments again to obtain the adjusted path segment data. Integrate all uninterrupted path segments, construct complete path connection relationships, and determine the final set of uninterrupted paths; A depth-first search algorithm is used to traverse and verify the path set to determine whether all path segments have achieved uninterrupted connection, thus obtaining the verified path dataset. Generate the final path connection record, store the segment division information of all uninterrupted paths, and determine the complete path structure of the pipeline network system.

[0011] As a further preferred embodiment of the water supply network burst valve closure auxiliary decision-making and impact assessment system of the present invention, the redundant path identification module specifically includes: All path data is acquired, and the directional information for each path is categorized and organized to obtain a preliminary record of the water source distribution. Analyze the destination information of each group of paths. If multiple paths point to the same water source, mark these paths as repeated segments and obtain a list of repeated segments. Extract the common paragraph data of similar paths, and use a comparison method to check the overlapping parts of path nodes one by one to determine the scope of merging similar paths; Perform a paragraph merging operation to integrate overlapping parts into a single path segment, construct a path structure pointing to a single upstream, and obtain the preliminary framework of the optimized path; Check the uninterruptedness of the path, analyze the connection status of each path segment, and if a connection interruption is found, readjust the path direction to determine the uninterrupted path combination. Integrate all path data, construct a complete path connection relationship, and use a depth-first search algorithm to traverse path nodes to determine the completeness of the optimized path; Generate the final path data record, store the path structure pointing to a single upstream, and obtain the final path set data.

[0012] As a further preferred embodiment of the water supply network burst valve closure auxiliary decision-making and impact assessment system of the present invention, the topology sorting module specifically includes: A topological sorting algorithm is used to process the relationships between all nodes and directed edges in the unique upstream path set, generating an initial hierarchical relationship sort. Extract the set of direct predecessor nodes and the set of direct successor nodes for each node to determine the dependency order between nodes; Traverse the path nodes according to the dependency order. If all direct predecessor nodes of a certain node have been sorted, add it to the current level to obtain the progressive sequence. Check the connection direction between adjacent nodes. If the successor node always points to the upstream direction, mark the connection direction of this segment as consistent and determine the hierarchical path sequence. Scan all directed edges. If a reverse edge pointing downstream is found, remove the edge and record the conflicting node to obtain a path permutation without reverse cycles. Recalculate the in-degree and out-degree of each node. If the in-degree and out-degree are balanced, the stability of the node is confirmed, and the stability verification result is obtained. The final ordered path sequence is generated by filtering the path set where all nodes have passed the balance check.

[0013] As a further preferred embodiment of the water supply network burst valve closure auxiliary decision-making and impact assessment system of the present invention, the conflict path verification module specifically includes: Traverse all adjacent node pairs according to the sorted path sequence, and determine whether the direction of the directed edge between adjacent nodes is consistent with the upstream pointing to the downstream. If the directions are opposite, mark the adjacent node pair as a conflicting path branch. Extract the branch start node from the marked conflicting path branches as the branch point identifier, and obtain all the forked path segments starting from that branch point; For each branching path segment identified by a branch point, calculate the ratio of the number of nodes in each path segment to the direction of the edge, and determine the path segment with the lowest ratio as the conflicting branch segment. Delete all nodes and associated directed edges in the conflicting branch segment, and update the node set and edge set of the remaining path sequence; A breadth-first search is used to traverse backwards from the end node of the remaining path sequence, obtaining the unique upstream node of each node until the water source node is reached, thus obtaining the adjusted single continuous path. On the adjusted single continuous path, re-examine the consistency of edge directions between all adjacent nodes. If all edges point to the upstream direction, the path direction is confirmed to be unified, and the final single-level path description is determined. The output nodes are arranged in a progressive sequence from the end to the water source, resulting in a hierarchical arrangement without branch conflicts.

[0014] An evaluation method for the auxiliary decision-making and impact system of valve closure in water supply network bursts includes the following steps: Step 1: Extract node and edge relationships from water supply network data using a preset network diagram, and use a depth-first search algorithm to traverse the edges starting from the end user along the reverse search direction to obtain an initial search path set; Step 2: Detect loop structures based on the initial search path set. If there are duplicate nodes in the path, mark it as a loop access path. Obtain the filtered path set by removing the marked paths. Step 3: Check the valve status along the filtered path set. If the valve is closed, cut off the corresponding path segment and obtain an uninterrupted path set by updating the path segment. Step 4: Identify redundant paths from the set of uninterrupted paths. If multiple paths point to the same water source, merge similar segments and determine the unique upstream path by merging segments. Step 5: Use a topological sorting algorithm to sort the hierarchical relationship of the unique upstream path, and determine the progressive order of the path from the end user to the water source based on the sorting result to obtain the sorted path sequence. Step 6: Verify contradictory paths through the sorted path sequence. If inconsistent branches appear in the sequence, delete the conflicting parts and obtain the final accurate and unique hierarchical relationship description by adjusting the branches.

[0015] Compared with the prior art, the present invention, employing the above technical solution, has the following technical effects: This invention extracts node and edge relationships from pipeline network data, generates an initial path set using a depth-first search algorithm, and gradually optimizes the path set through steps such as loop detection, duplicate path filtering, valve status checks, and path truncation, ultimately forming an uninterrupted and unique upstream path. A topology sorting algorithm is applied to determine the path hierarchy, verifying and adjusting contradictory branches to ensure the accuracy and uniqueness of the path description. Through multi-step path optimization and hierarchical sorting, this invention achieves precise tracing from the burst pipe point to the water source and rapid location of valve shut-off points, effectively assisting decision-making, assessing the impact range of the burst pipe, and significantly improving the efficiency of emergency response and the scientific nature of water supply network management. Attached Figure Description

[0016] Figure 1 This is a schematic diagram of the structural principle of the water supply network burst valve closure auxiliary decision-making and impact assessment system of the present invention; Figure 2 This is a flowchart of the auxiliary decision-making and impact assessment method for shutting off valves in a burst water supply network, as described in this invention. Detailed Implementation

[0017] The technical solution of the present invention will be further described in detail below with reference to the accompanying drawings: The technical solutions of the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of the present invention, and not all embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those of ordinary skill in the art without creative effort are within the scope of protection of the present invention. The present invention will be described in detail below with reference to the accompanying drawings and preferred embodiments. The purpose and effects of the present invention will become clearer. It should be understood that the specific embodiments described herein are merely illustrative of the present invention and are not intended to limit the present invention.

[0018] Water supply network burst valve closure auxiliary decision-making and impact assessment system, such as Figure 1 As shown, it specifically includes a pipeline data extraction module, a loop detection module, a valve status check module, a redundant path identification module, a topology sorting module, and a conflicting path verification module; Among them, the pipeline data extraction module is used to extract node and edge relationships from water supply pipeline data through a preset pipeline map. It uses a depth-first search algorithm to traverse the edges starting from the end user along the reverse search direction to obtain an initial search path set. The loop detection module is used to detect loop structures based on the initial search path set. If there are duplicate nodes in the path, it is marked as a loop access path. The filtered path set is obtained by removing the marked paths. The valve status check module is used to check the status of valves along the filtered path set. If a valve is closed, the corresponding path segment is truncated, and an uninterrupted path set is obtained by updating the path segment. The redundant path identification module is used to identify redundant paths from the set of uninterrupted paths. If multiple paths point to the same water source, similar segments are merged, and a unique upstream path is determined by merging segments. The topology sorting module is used to sort the hierarchical relationship of the unique upstream path using a topology sorting algorithm, and to determine the progressive order of the path from the end user to the water source based on the sorting result, so as to obtain the sorted path sequence. The contradictory path verification module is used to verify contradictory paths through the sorted path sequence. If inconsistent branches appear in the sequence, the conflicting parts are deleted, and the final accurate and unique hierarchical relationship description is obtained by adjusting the branches.

[0019] Preferably, the pipeline data extraction module specifically includes: The node connection and edge relationship information of water supply data are obtained from the preset pipeline network. Data extraction technology is used to perform structured processing on the raw data to obtain the sorted pipeline network topology dataset. Determine the specific location information of the end user, and construct a preliminary set of traversal starting points by reverse search, starting from the starting edge corresponding to the end user; A depth-first search algorithm is used to explore the starting edge layer by layer along the traversal direction, obtain the connection nodes and edge relationships at each level, and obtain a preliminary path record; Determine whether each path covers all relevant nodes. If not, continue to expand the search range along the traversal direction to determine the complete path coverage information. Obtain the connection order and edge relationships between nodes in the path, construct the detailed structure of the initial path, and obtain ordered path sequence data; The path set is categorized and organized, duplicate or redundant path information is extracted, the completeness and consistency of the path set are judged, and the final search path set is obtained.

[0020] Preferably, the loop detection module specifically includes: Obtain the node connection relationships and edge information of the water supply network to obtain the sorted network topology dataset; Determine the location of the end user, and construct an initial search starting point set starting from the starting edge corresponding to the end user; A depth-first search algorithm is used to traverse the connecting edges and nodes layer by layer in the reverse direction, starting from the initial search starting point set, to obtain a preliminary path record set; Detect whether there are duplicate nodes in each path. If duplicate nodes are found, mark them as loop paths. By removing the marked loop paths, the filtered set of paths is obtained. Extract the node order and edge connection relationships of each path to construct a complete path structure and obtain acyclic path sequence data; Determine whether the path covers all water supply nodes. If it does not cover all nodes, rebuild the search starting point set from the starting edges corresponding to the remaining uncovered nodes, and continue traversing using the depth-first search algorithm to obtain a supplementary path record set. The supplementary path record set is merged with the filtered path set to obtain the final complete acyclic path set.

[0021] Preferably, the valve status check module specifically includes: For the filtered path set, a state detection method is used to analyze the valve status involved in the inspection along the path one by one, and obtain the distribution record of valve status. If a closed valve is detected, the corresponding path is marked, the path segments that need to be truncated are determined, and a list of path segments to be processed is obtained. For each path segment that needs to be truncated, perform a path segment update operation to remove invalid path portions after the valve is closed, and obtain an updated set of path segments; Check the path integrity to determine if there are still path segments that contain closed valves. If so, divide these path segments again to obtain the adjusted path segment data. Integrate all uninterrupted path segments, construct complete path connection relationships, and determine the final set of uninterrupted paths; A depth-first search algorithm is used to traverse and verify the path set to determine whether all path segments have achieved uninterrupted connection, thus obtaining the verified path dataset. Generate the final path connection record, store the segment division information of all uninterrupted paths, and determine the complete path structure of the pipeline network system.

[0022] Preferably, the redundant path identification module specifically includes: All path data is acquired, and the directional information for each path is categorized and organized to obtain a preliminary record of the water source distribution. Analyze the destination information of each group of paths. If multiple paths point to the same water source, mark these paths as repeated segments and obtain a list of repeated segments. Extract the common paragraph data of similar paths, and use a comparison method to check the overlapping parts of path nodes one by one to determine the scope of merging similar paths; Perform a paragraph merging operation to integrate overlapping parts into a single path segment, construct a path structure pointing to a single upstream, and obtain the preliminary framework of the optimized path; Check the uninterruptedness of the path, analyze the connection status of each path segment, and if a connection interruption is found, readjust the path direction to determine the uninterrupted path combination. Integrate all path data, construct a complete path connection relationship, and use a depth-first search algorithm to traverse path nodes to determine the completeness of the optimized path; Generate the final path data record, store the path structure pointing to a single upstream, and obtain the final path set data.

[0023] Preferably, the topology sorting module specifically includes: A topological sorting algorithm is used to process the relationships between all nodes and directed edges in the unique upstream path set, generating an initial hierarchical relationship sort. Extract the set of direct predecessor nodes and the set of direct successor nodes for each node to determine the dependency order between nodes; Traverse the path nodes according to the dependency order. If all direct predecessor nodes of a certain node have been sorted, add it to the current level to obtain the progressive sequence. Check the connection direction between adjacent nodes. If the successor node always points to the upstream direction, mark the connection direction of this segment as consistent and determine the hierarchical path sequence. Scan all directed edges. If a reverse edge pointing downstream is found, remove the edge and record the conflicting node to obtain a path permutation without reverse cycles. Recalculate the in-degree and out-degree of each node. If the in-degree and out-degree are balanced, the stability of the node is confirmed, and the stability verification result is obtained. The final ordered path sequence is generated by filtering the path set where all nodes have passed the balance check.

[0024] Preferably, the contradictory path verification module specifically includes: Traverse all adjacent node pairs according to the sorted path sequence, and determine whether the direction of the directed edge between adjacent nodes is consistent with the upstream pointing to the downstream. If the directions are opposite, mark the adjacent node pair as a conflicting path branch. Extract the branch start node from the marked conflicting path branches as the branch point identifier, and obtain all the forked path segments starting from that branch point; For each branching path segment identified by a branch point, calculate the ratio of the number of nodes in each path segment to the direction of the edge, and determine the path segment with the lowest ratio as the conflicting branch segment. Delete all nodes and associated directed edges in the conflicting branch segment, and update the node set and edge set of the remaining path sequence; A breadth-first search is used to traverse backwards from the end node of the remaining path sequence, obtaining the unique upstream node of each node until the water source node is reached, thus obtaining the adjusted single continuous path. On the adjusted single continuous path, re-examine the consistency of edge directions between all adjacent nodes. If all edges point to the upstream direction, the path direction is confirmed to be unified, and the final single-level path description is determined. The output nodes are arranged in a progressive sequence from the end to the water source, resulting in a hierarchical arrangement without branch conflicts.

[0025] The core of this invention lies in purifying and reconstructing the original pipeline network data, which may contain loops, valve shut-offs, and redundancy, into an accurate, directed acyclic hierarchical topology graph through a series of rigorous algorithmic steps.

[0026] Example 1: System Module Collaboration Workflow (described in this example) Figure 1 How do the modules of the system shown work together?

[0027] When the system starts up and analyzes a specific area of ​​the pipeline network: First, the pipeline data extraction module receives the burst pipe point or analysis starting point (end user) specified by the user and retrieves the pipeline network "node-edge" data for that area from the backend database. It executes a reverse DFS algorithm: for example, starting from user point U1, it explores all its connected pipes (edges), recording this as the first step of the path; then it explores upstream nodes along each pipe, recursively repeating this process until it cannot continue (possibly encountering a water source or physical endpoint). This process generates an "initial search path set" {P_initial} that may contain multiple branches and multiple endpoints. This set reflects all possible connections but contains a large amount of invalid information.

[0028] Next, the loop detection module processes {P_initial}. It analyzes each path one by one. For example, if it finds the path "U1 -> A -> B -> C -> A -> ..." where node A appears repeatedly, it immediately determines this to be a loop path, marks it, and removes it. After this step, it outputs {P_filtered_loop}, ensuring that all paths are logically free of loops.

[0029] Then, the valve status check module accesses the valve SCADA (Supervisory Control and Data Acquisition) status table. It iterates through each path in {P_filtered_loop}, querying the valve corresponding to each pipe segment on the path. For example, if valve V_BD is in the "closed" state in the path "U1 -> A -> B -> D", the module truncates the path after the "B -> D" segment, making the effective part of the path "U1 -> A -> B". After all paths are processed in this way, {P_no_interrupt} is formed, and all paths in this set are physically connected at the current moment.

[0030] Next, the redundant path identification module analyzes {P_no_interrupt}. Assume there are two paths: "U1 -> A -> B -> Source1" and "U1 -> A -> C -> Source1", both pointing to Source1 and sharing the segment "U1 -> A". The module identifies the common segment "U1 -> A", merges the two paths to form a representative sub-path "U1 -> A -> {B, C} -> Source1", or selects a main path based on business rules. This step extracts the path to each user point that points to its actual and unique water source.

[0031] Next, the topology sorting module integrates the "unique upstream paths" of all user points into a global directed graph. The topology sorting algorithm is then run on this graph. The algorithm first finds all nodes with an in-degree of 0 (i.e., source nodes) and places them in the first layer; then it removes these nodes and their outgoing edges, finds new nodes with an in-degree of 0, places them in the second layer, and so on. Finally, it outputs a global "sorted path sequence," clearly defining the upstream and downstream dependencies of all nodes in the entire network.

[0032] Finally, the contradictory path verification module performs a "check-up" on the aforementioned global sequence. For example, during the global sorting, it might find that node X is ranked upstream of node Y, but there's an original record showing an edge pointing from Y to X (a contradiction with the hierarchy). The module identifies such contradictory edges, judges the conflicting parts based on preset rules (such as the weight of the path containing the edge and the consistency ratio of directions), and removes or adjusts them. Ultimately, it outputs a clean and consistent final topology description, stored in the system knowledge base for subsequent pipe burst analysis.

[0033] An evaluation method for auxiliary decision-making and impact assessment based on valve closure in water supply network bursts, such as... Figure 2 As shown, the specific steps include: Step 101: Extract node and edge relationships from water supply network data using a preset network diagram, and use a depth-first search algorithm to traverse the edges starting from the end user along the reverse search direction to obtain an initial search path set. Step 102: Detect loop structures based on the initial search path set. If there are duplicate nodes in the path, mark it as a loop access path. Obtain the filtered path set by removing the marked paths. Step 103: Check the valve status along the filtered path set. If the valve is closed, cut off the corresponding path segment and obtain an uninterrupted path set by updating the path segment. Step 104: Identify redundant paths from the set of uninterrupted paths. If multiple paths point to the same water source, merge similar segments and determine the unique upstream path by merging segments. Step 105: Use a topological sorting algorithm to sort the hierarchical relationship of the unique upstream path, and determine the progressive order of the path from the end user to the water source based on the sorting result to obtain the sorted path sequence. Step 106: Verify contradictory paths through the sorted path sequence. If inconsistent branches appear in the sequence, delete the conflicting parts. Adjust the branches to obtain the final accurate and unique hierarchical relationship description.

[0034] Example 2: Application of the method steps in a pipe burst scenario: This embodiment combines Figure 2 The process describes how to make decisions using the above methods when a pipe bursts.

[0035] Suppose the monitoring system alarms that a pipe burst has occurred at segment_E-F.

[0036] Steps S101-S106 (Constructing an accurate topology) typically run continuously or periodically in the background. The accurate topology model of the entire network has been constructed in advance and stored in the system.

[0037] When the pipe burst event is triggered: Location and Tracing: Based on the burst point (located between nodes E and F), the system immediately locates the pipe segment from the topology model. Then, the system traces upstream: starting from node E (or F, determined by the flow direction), it quickly finds one or more controllable valves (e.g., valve V_CD) along the pre-constructed "unique upstream path" and "final hierarchical description." These valves are the target valves that need to be closed to cut off the water flow to the burst point.

[0038] Impact Assessment: Simultaneously, the system iterates downstream: starting from node F (downstream of the burst pipe point), using the same topology model, it traverses all downstream nodes (users) that depend on this point for water supply. This process can quickly list all users affected by this valve closure and may also provide statistics on the number of affected households, key users, etc.

[0039] Solution Output: The system will output a "list of valves recommended for closure (e.g., V_CD)" and a "list of users expected to be affected" to the dispatcher to assist them in making quick and informed decisions. The dispatcher can then issue valve closure commands and notify affected users in advance.

[0040] It should be noted that the node, edge, valve names, and specific paths in the above embodiments are merely examples to clearly illustrate the logic of the present invention and do not represent a limitation on the technical solution of the present invention. Those skilled in the art can adjust the specific parameters and implementation methods of the algorithm according to the structure of actual pipeline network data, but its core lies in following the technical concept embodied in the series of steps of "reverse search -> loop removal -> valve verification -> redundancy removal -> global sorting -> contradiction verification" to solve the problems pointed out in the background art.

[0041] The water supply network burst valve shut-off auxiliary decision-making and impact assessment system provided by this invention significantly improves the efficiency and scientific nature of emergency response to pipe bursts: through a multi-level path optimization mechanism combining depth-first search and topology sorting, the system can quickly and accurately trace the complete water supply path from the burst point to the water source, and intelligently cut off invalid paths based on valve status, thereby quickly determining the optimal valve shut-off scheme after a pipe burst occurs, greatly shortening the water outage impact time and improving the timeliness and pertinence of emergency repairs.

[0042] Ensuring accurate and unique hierarchical relationships and avoiding path conflicts and redundancy: The system effectively eliminates path inconsistencies caused by factors such as pipe network loops, valve closures, and path overlaps through multiple steps including loop detection, redundant path identification, and contradictory branch verification. It ultimately outputs a unique, continuous, and conflict-free hierarchical path description from the end user to the water source, providing a reliable data foundation for valve closure decisions and impact assessments. Enhancing the system's adaptability and robustness in real-world complex pipe networks: Traditional methods often ignore valve state changes and loop structures, leading to path search failures or contradictory results. This invention significantly improves the system's practicality and anti-interference capabilities in real-world pipe network environments by real-time detection of valve states and dynamic path truncation, as well as identifying and removing loop paths. Supporting multi-dimensional impact assessment and pipe network state analysis: The accurate and unique hierarchical relationships generated by the system can not only be used for valve closure decisions but also for subsequent assessment tasks such as pipe burst impact range analysis, pressure simulation, and hydraulic simulation, providing structured and reliable topology support for the operation management, optimized scheduling, and risk warning of water supply networks. Promoting the digital and intelligent transformation of water supply network management: This invention deeply integrates graph theory algorithms with network business logic to achieve full-process automation from data extraction and path cleaning to hierarchical construction, reducing the burden and error of manual judgment, providing core algorithm support for the construction of smart water systems, and helping to manage water supply systems safely, efficiently, and with precision.

[0043] In summary, this invention not only solves the operational pain points of unclear decision-making paths and inaccurate impact assessments in emergency valve shut-off during pipe bursts, but also provides reliable technical means for the daily operation and maintenance and long-term planning of water supply networks, and has significant engineering application value and promotion prospects.

[0044] It will be understood by those skilled in the art that the above descriptions are merely preferred examples of the invention and are not intended to limit the invention. Although the invention has been described in detail with reference to the foregoing examples, those skilled in the art can still modify the technical solutions described in the foregoing examples or make equivalent substitutions for some of the technical features. All modifications and equivalent substitutions made within the spirit and principles of the invention should be included within the scope of protection of the invention. All technical features in this embodiment can be freely combined according to actual needs.

[0045] Finally, it should be noted that the above description is only a preferred embodiment of the present invention and is not intended to limit the present invention. Although the present invention has been described in detail with reference to the foregoing embodiments, those skilled in the art can still modify the technical solutions described in the foregoing embodiments or make equivalent substitutions for some of the technical features. Any modifications, equivalent substitutions, improvements, etc., made within the spirit and principles of the present invention should be included within the protection scope of the present invention.

Claims

1. A system for assisting decision-making and impact assessment of valve closure in water supply network bursts, characterized in that: Specifically, it includes a pipeline data extraction module, a loop detection module, a valve status check module, a redundant path identification module, a topology sorting module, and a conflicting path verification module; Among them, the pipeline data extraction module is used to extract node and edge relationships from water supply pipeline data through a preset pipeline map. It uses a depth-first search algorithm to traverse the edges starting from the end user along the reverse search direction to obtain an initial search path set. The loop detection module is used to detect loop structures based on the initial search path set. If there are duplicate nodes in the path, it is marked as a loop access path. The filtered path set is obtained by removing the marked paths. The valve status check module is used to check the status of valves along the filtered path set. If a valve is closed, the corresponding path segment is truncated, and an uninterrupted path set is obtained by updating the path segment. The redundant path identification module is used to identify redundant paths from the set of uninterrupted paths. If multiple paths point to the same water source, similar segments are merged, and a unique upstream path is determined by merging segments. The topology sorting module is used to sort the hierarchical relationship of the unique upstream path using a topology sorting algorithm, and to determine the progressive order of the path from the end user to the water source based on the sorting result, so as to obtain the sorted path sequence. The contradictory path verification module is used to verify contradictory paths through the sorted path sequence. If inconsistent branches appear in the sequence, the conflicting parts are deleted, and the final accurate and unique hierarchical relationship description is obtained by adjusting the branches.

2. The water supply network burst valve closure auxiliary decision-making and impact assessment system according to claim 1, characterized in that, The pipeline data extraction module specifically includes: The node connection and edge relationship information of water supply data are obtained from the preset pipeline network. Data extraction technology is used to perform structured processing on the raw data to obtain the sorted pipeline network topology dataset. Determine the specific location information of the end user, and construct a preliminary set of traversal starting points by starting from the starting edge corresponding to the end user through reverse search; A depth-first search algorithm is used to explore the starting edge layer by layer along the traversal direction, obtain the connection nodes and edge relationships at each level, and obtain a preliminary path record; Determine whether each path covers all relevant nodes. If not, continue to expand the search range along the traversal direction to determine the complete path coverage information. Obtain the connection order and edge relationships between nodes in the path, construct the detailed structure of the initial path, and obtain ordered path sequence data; The path set is categorized and organized, duplicate or redundant path information is extracted, the completeness and consistency of the path set are judged, and the final search path set is obtained.

3. The water supply network burst valve closure auxiliary decision-making and impact assessment system according to claim 1, characterized in that, The loop detection module specifically includes: Obtain the node connection relationships and edge information of the water supply network to obtain the sorted network topology dataset; Determine the location of the end user, and construct an initial search starting point set starting from the starting edge corresponding to the end user; A depth-first search algorithm is used to traverse the connecting edges and nodes layer by layer in the reverse direction, starting from the initial search starting point set, to obtain a preliminary path record set; Detect whether there are duplicate nodes in each path. If duplicate nodes are found, mark them as loop paths. By removing the marked loop paths, the filtered set of paths is obtained. Extract the node order and edge connection relationships of each path to construct a complete path structure and obtain acyclic path sequence data; Determine whether the path covers all water supply nodes. If it does not cover all nodes, rebuild the search starting point set from the starting edges corresponding to the remaining uncovered nodes, and continue traversing using the depth-first search algorithm to obtain a supplementary path record set. The supplementary path record set is merged with the filtered path set to obtain the final complete acyclic path set.

4. The water supply network burst valve closure auxiliary decision-making and impact assessment system according to claim 1, characterized in that, The valve status check module specifically includes: For the filtered path set, a state detection method is used to analyze the valve status involved in the inspection along the path one by one, and obtain the distribution record of valve status. If a closed valve is detected, the corresponding path is marked, the path segments that need to be truncated are determined, and a list of path segments to be processed is obtained. For each path segment that needs to be truncated, perform a path segment update operation to remove invalid path portions after the valve is closed, and obtain an updated set of path segments; Check the path integrity to determine if there are still path segments that contain closed valves. If so, divide these path segments again to obtain the adjusted path segment data. Integrate all uninterrupted path segments, construct complete path connection relationships, and determine the final set of uninterrupted paths; A depth-first search algorithm is used to traverse and verify the path set to determine whether all path segments have achieved uninterrupted connection, thus obtaining the verified path dataset. Generate the final path connection record, store the segment division information of all uninterrupted paths, and determine the complete path structure of the pipeline network system.

5. The water supply network burst valve closure auxiliary decision-making and impact assessment system according to claim 1, characterized in that, The redundant path identification module specifically includes: All path data is acquired, and the directional information for each path is categorized and organized to obtain a preliminary record of the water source distribution. Analyze the destination information of each group of paths. If multiple paths point to the same water source, mark these paths as repeated segments and obtain a list of repeated segments. Extract the common paragraph data of similar paths, and use a comparison method to check the overlapping parts of path nodes one by one to determine the scope of merging similar paths; Perform a paragraph merging operation to integrate overlapping parts into a single path segment, construct a path structure pointing to a single upstream, and obtain the preliminary framework of the optimized path; Check the uninterruptedness of the path, analyze the connection status of each path segment, and if a connection interruption is found, readjust the path direction to determine the uninterrupted path combination. Integrate all path data, construct a complete path connection relationship, and use a depth-first search algorithm to traverse path nodes to determine the completeness of the optimized path; Generate the final path data record, store the path structure pointing to a single upstream, and obtain the final path set data.

6. The water supply network burst valve closure auxiliary decision-making and impact assessment system according to claim 1, characterized in that, The topology sorting module specifically includes: A topological sorting algorithm is used to process the relationships between all nodes and directed edges in the unique upstream path set, generating an initial hierarchical relationship sort. Extract the set of direct predecessor nodes and the set of direct successor nodes for each node to determine the dependency order between nodes; Traverse the path nodes according to the dependency order. If all direct predecessor nodes of a certain node have been sorted, add it to the current level to obtain the progressive sequence. Check the connection direction between adjacent nodes. If the successor node always points to the upstream direction, mark the connection direction of this segment as consistent and determine the hierarchical path sequence. Scan all directed edges. If a reverse edge pointing downstream is found, remove the edge and record the conflicting node to obtain a path permutation without reverse cycles. Recalculate the in-degree and out-degree of each node. If the in-degree and out-degree are balanced, the stability of the node is confirmed, and the stability verification result is obtained. The final ordered path sequence is generated by filtering the path set where all nodes have passed the balance check.

7. The water supply network burst valve closure auxiliary decision-making and impact assessment system according to claim 1, characterized in that, The contradictory path verification module specifically includes: Traverse all adjacent node pairs according to the sorted path sequence, and determine whether the direction of the directed edge between adjacent nodes is consistent with the upstream pointing to the downstream. If the directions are opposite, mark the adjacent node pair as a conflicting path branch. Extract the branch start node from the marked conflicting path branches as the branch point identifier, and obtain all the forked path segments starting from that branch point; For each branching path segment identified by a branch point, calculate the ratio of the number of nodes in each path segment to the direction of the edge, and determine the path segment with the lowest ratio as the conflicting branch segment. Delete all nodes and associated directed edges in the conflicting branch segment, and update the node set and edge set of the remaining path sequence; A breadth-first search is used to traverse backwards from the end node of the remaining path sequence, obtaining the unique upstream node of each node until the water source node is reached, thus obtaining the adjusted single continuous path. On the adjusted single continuous path, re-examine the consistency of edge directions between all adjacent nodes. If all edges point to the upstream direction, the path direction is confirmed to be unified, and the final single-level path description is determined. The output nodes are arranged in a progressive sequence from the end to the water source, resulting in a hierarchical arrangement without branch conflicts.

8. An evaluation method for an auxiliary decision-making and impact system for valve closure in a water supply network as described in any one of claims 1 to 7, characterized in that, Specifically, it includes the following steps: Step 1: Extract node and edge relationships from water supply network data using a preset network diagram, and use a depth-first search algorithm to traverse the edges starting from the end user along the reverse search direction to obtain an initial search path set; Step 2: Detect loop structures based on the initial search path set. If there are duplicate nodes in the path, mark it as a loop access path. Obtain the filtered path set by removing the marked paths. Step 3: Check the valve status along the filtered path set. If the valve is closed, cut off the corresponding path segment and obtain an uninterrupted path set by updating the path segment. Step 4: Identify redundant paths from the set of uninterrupted paths. If multiple paths point to the same water source, merge similar segments and determine the unique upstream path by merging segments. Step 5: Use a topological sorting algorithm to sort the hierarchical relationship of the unique upstream path, and determine the progressive order of the path from the end user to the water source based on the sorting result to obtain the sorted path sequence. Step 6: Verify contradictory paths through the sorted path sequence. If inconsistent branches appear in the sequence, delete the conflicting parts and obtain the final accurate and unique hierarchical relationship description by adjusting the branches.

Images