CN111102476B - Pipe burst searching method based on three-dimensional underground pipeline - Google Patents
Pipe burst searching method based on three-dimensional underground pipeline Download PDFInfo
- Publication number
- CN111102476B CN111102476B CN201911287302.0A CN201911287302A CN111102476B CN 111102476 B CN111102476 B CN 111102476B CN 201911287302 A CN201911287302 A CN 201911287302A CN 111102476 B CN111102476 B CN 111102476B
- Authority
- CN
- China
- Prior art keywords
- pipe
- pipe section
- entering
- upstream
- searching
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- F—MECHANICAL ENGINEERING; LIGHTING; HEATING; WEAPONS; BLASTING
- F17—STORING OR DISTRIBUTING GASES OR LIQUIDS
- F17D—PIPE-LINE SYSTEMS; PIPE-LINES
- F17D5/00—Protection or supervision of installations
- F17D5/02—Preventing, monitoring, or locating loss
- F17D5/06—Preventing, monitoring, or locating loss using electric or acoustic means
Landscapes
- Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- Acoustics & Sound (AREA)
- Mechanical Engineering (AREA)
- General Engineering & Computer Science (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention discloses a pipe burst searching method based on a three-dimensional underground pipeline, which is based on the flow direction, optimizes the flow direction and the flow direction by adopting a graph theory, abstracts pipelines with the flow direction by adopting a directed graph, abstracts pipelines without the flow direction by adopting an undirected graph, and finally searches for a valve to be closed by utilizing a breadth-first algorithm to close. According to the data characteristics of the urban underground pipe section and the requirement of pipe burst analysis, the breadth-first algorithm model is optimized based on the graph theory and the topological analysis model. The invention not only finds out the valve point to be closed, but also finds out all affected pipe sections, can adapt to the fixed flow direction of the pipe sections, and adopts different models aiming at different conditions.
Description
Technical Field
The invention belongs to the field of pipeline analysis, and particularly relates to a pipe burst searching method based on a three-dimensional underground pipeline.
Background
The pipe explosion accidents of urban underground pipelines (drainage, water supply and gas) are common, and the rush-repair work after the pipe explosion cannot be ignored. The realization of a perfect pipe burst valve closing analysis function can reduce the rush-repair time, reduce the affected range, minimize the loss caused by pipe burst and improve the modernized management level of a pipe network.
How to rapidly and accurately analyze the valve with the nearest pipe explosion position and the range of the affected pipeline, and provide rapid and accurate assistance for rush repair personnel is always a hot problem of research in the industry. At present, some pipe network systems realize the pipe explosion analysis function to different degrees, but have some defects. The existing tube explosion analysis algorithms generally have two types, one is a tube explosion analysis method not based on a flow direction, and the other is a tube explosion analysis method based on a flow direction. Both methods have benefits, but due to the individual characteristics of the urban underground network data, only some pipes, such as water supply pipes, have practical significance, and some do not flow, or do not flow, to practical significance. The analysis method adopting graph theory can ignore the flow direction for analysis, but only can find out the valve which may need to be closed, and the important data of 'flow direction' is lost for the data with flow direction per se because the flow direction is not used. The analysis method based on the flow direction can accurately find the valve to be closed, and only an alternative method can be thought of for analyzing the pipeline without the flow direction.
Disclosure of Invention
The invention aims to overcome the defects and provide a pipe burst searching method based on a three-dimensional underground pipeline, which can adapt to the condition that whether a pipe section has a fixed flow direction or not and adopt different models according to different conditions.
In order to achieve the above object, the present invention comprises the steps of:
s101, determining a pipe section where a pipe explosion point is located, determining the flow direction of the pipe section where the pipe explosion point is located, and entering S103; if the pipe section where the pipe explosion point is located has no flow direction information, the step S102 is carried out;
s102, specifying the flow direction information of the pipe section, and entering S103;
s103, acquiring upstream connection node information according to the flow direction of the pipe section, and entering S104;
s104, judging whether the connection node is a valve or not according to the upstream connection node information; if the valve is the valve, the searching process is completed; if not, entering S105;
s105, preferentially searching upstream connecting nodes according to the flow direction by using the breadth until all upstream valves are found; if the pipe section has no flow direction information, the step S106 is carried out;
s106, finding the downstream of the affected pipe section until finding all the pipe sections which are not visited, and finishing the searching process.
The specific method of preferentially searching the upstream connection node by using the breadth according to the flow direction is as follows:
s1051, searching all pipe sections which are closest to the upstream direction of the pipe section where the pipe explosion is located and have no access, and entering S1052;
s1052, judging whether the connecting node on the pipe section is a valve, if so, entering S1053, and if not, entering S1055;
s1053, searching for a pipe section which takes the valve as a starting point or an end point and has no access, and entering 1054;
s1054, judging whether the connecting node in the pipe section which is not visited is a valve, if so, stopping searching, otherwise, entering S1055;
s1055, finding the pipe section which is upstream of the connection node and has not been visited, and entering S1052.
The specific method of step S106 is as follows:
s1061, searching the downstream of the pipe section, finding a connecting node, and entering S107;
s1062, searching all pipe sections which are not visited in the downstream direction of the connection nodes, finding the connection nodes which are not visited in the pipe sections, and entering S1063;
s1063, searching the pipe sections which take the connection nodes which are not visited as a starting point or an end point and are not visited, determining the connection nodes of the pipe sections which are not visited, and entering S1064;
and S1064, searching all the connection nodes as starting points or end points, and completing the search process if no accessed pipe section exists.
When the flow direction of the pipe section is a positive flow direction, the upstream is the initial node of the pipe section; when the flow direction of the pipe section is negative, the upstream is the connecting node of the pipe section.
The flow of searching the optimized structure of the upstream valve is as follows:
step one, establishing a valve array V _ array, a node queue N _ queue and an effective edge set E _ set;
step two, judging the connecting nodes at the two ends of the pipe section where the burst point is located, stopping searching if the connecting nodes at the two ends are valves, and adding the two valves into a valve array V _ array; otherwise, adding the connecting node of the non-valve end into the node queue N _ queue;
step three, taking out a point from the connecting node queue, and adding all effective edges intersected with the point into an effective edge set E _ set;
step four, taking out one edge from the effective edge set E _ set, judging the flow direction of the edge, adding an upstream connecting node N of the edge into a node queue N _ queue, judging, if the upstream connecting node N is a valve point, adding the upstream connecting node N into a valve array V _ array, and if not, adding all effective edges intersected with the upstream connecting node N into the effective edge set E _ set;
and step five, repeating the step four until the effective edge set E _ set is empty.
The specific method for finding the affected pipe section is as follows:
s201, inputting pipe section information, and entering S202;
s202, acquiring an upstream connecting node P0 of the pipe section, and entering S203;
s203, judging whether the upstream connecting node P0 is a valve or not, if so, adding the valve into a valve array needing to be closed; if not, entering S204;
s205, acquiring all pipe sections connected with the upstream of the upstream connecting node P0, circularly traversing each pipe section, and entering S206;
s206, judging whether all the pipe sections connected with the upstream are traversed or not, and if so, entering S207; if not, the process goes to S201;
s207, inputting information of a pipe section, acquiring all pipe sections connected with the downstream of the pipe section, circularly traversing each pipe section, and entering S208;
s208, screening out the affected pipe sections, and entering S209; if all the pipe sections are not traversed, inputting pipe section information one by one, checking out the affected pipe sections, and entering S209;
s209, adding the affected pipe segments into the affected pipe segment set, and returning to S207.
Compared with the prior art, the method takes the flow direction as a basis, adopts graph theory to optimize the flow direction and the pipeline, adopts a directed graph to abstract the pipeline with the flow direction, adopts an undirected graph to abstract the pipeline without the flow direction, and finally utilizes a breadth-first algorithm to search the valve to be closed for closing. According to the data characteristics of the urban underground pipe section and the requirement of pipe burst analysis, the breadth-first algorithm model is optimized based on the graph theory and the topological analysis model. The invention not only finds out the valve point to be closed, but also finds out all affected pipe sections, can adapt to the fixed flow direction of the pipe sections, and adopts different models aiming at different conditions.
Drawings
FIG. 1 is a flow chart of the present invention for finding affected pipe segments;
FIG. 2 is a flow chart of the present invention for finding an upstream valve.
Detailed Description
The invention will be further explained with reference to the drawings.
The invention comprises the following steps:
s101, determining a pipe section where a pipe explosion point is located, determining the flow direction of the pipe section where the pipe explosion point is located, and entering S103; if the pipe section where the pipe explosion point is located has no flow direction information, the step S102 is carried out;
s102, specifying the flow direction information of the pipe section, and entering S103;
s103, acquiring upstream connection node information according to the flow direction of the pipe section, and entering S104;
s104, judging whether the connection node is a valve or not according to the upstream connection node information; if the valve is the valve, the searching process is completed; if not, entering S105;
s105, preferentially searching upstream connecting nodes according to the flow direction by using the breadth until all upstream valves are found; if the pipe section has no flow direction information, the step S106 is carried out;
s106, finding the downstream of the affected pipe section, wherein the specific method is as follows:
s1061, searching the downstream of the pipe section, finding a connecting node, and entering S107;
s1062, searching all pipe sections which are not visited in the downstream direction of the connection nodes, finding the connection nodes which are not visited in the pipe sections, and entering S1063;
s1063, searching the pipe sections which take the connection nodes which are not visited as a starting point or an end point and are not visited, determining the connection nodes of the pipe sections which are not visited, and entering S1064;
and S1064, searching all the connection nodes as starting points or end points, and completing the search process if no accessed pipe section exists.
The specific method of preferentially searching the upstream connection node by using the breadth according to the flow direction is as follows:
s1051, searching all pipe sections which are closest to the upstream direction of the pipe section where the pipe explosion is located and have no access, and entering S1052;
s1052, judging whether the connecting node on the pipe section is a valve, if so, entering S1053, and if not, entering S1055;
s1053, searching for a pipe section which takes the valve as a starting point or an end point and has no access, and entering 1054;
s1054, judging whether the connecting node in the pipe section which is not visited is a valve, if so, stopping searching, otherwise, entering S1055;
s1055, finding the pipe section which is upstream of the connection node and has not been visited, and entering S1052.
When the flow direction of the pipe section is a positive flow direction, the upstream is the initial node of the pipe section; when the flow direction of the pipe section is negative, the upstream is the connecting node of the pipe section.
Referring to fig. 1, the specific method of finding the affected pipe segment is as follows:
s201, inputting pipe section information, and entering S202;
s202, acquiring an upstream connecting node P0 of the pipe section, and entering S203;
s203, judging whether the upstream connecting node P0 is a valve or not, if so, adding the valve into a valve array needing to be closed; if not, entering S204;
s205, acquiring all pipe sections connected with the upstream of the upstream connecting node P0, circularly traversing each pipe section, and entering S206;
s206, judging whether all the pipe sections connected with the upstream are traversed or not, and if so, entering S207; if not, the process goes to S201;
s207, inputting information of a pipe section, acquiring all pipe sections connected with the downstream of the pipe section, circularly traversing each pipe section, and entering S208;
s208, screening out the affected pipe sections, and entering S209; if all the pipe sections are not traversed, inputting pipe section information one by one, checking out the affected pipe sections, and entering S209;
s209, adding the affected pipe segments into the affected pipe segment set, and returning to S207.
Referring to fig. 2, the flow of finding the optimized structure of the upstream valve is as follows:
step one, establishing a valve array V _ array, a node queue N _ queue and an effective edge set E _ set;
step two, judging the connecting nodes at the two ends of the pipe section where the burst point is located, stopping searching if the connecting nodes at the two ends are valves, and adding the two valves into a valve array V _ array; otherwise, adding the connecting node of the non-valve end into the node queue N _ queue;
step three, taking out a point from the connecting node queue, and adding all effective edges intersected with the point into an effective edge set E _ set;
step four, taking out one edge from the effective edge set E _ set, judging the flow direction of the edge, adding an upstream connecting node N of the edge into a node queue N _ queue, judging, if the upstream connecting node N is a valve point, adding the upstream connecting node N into a valve array V _ array, and if not, adding all effective edges intersected with the upstream connecting node N into the effective edge set E _ set;
and step five, repeating the step four until the effective edge set E _ set is empty.
The method combines two analysis methods, takes the flow direction as a basis, adopts graph theory to optimize the two analysis methods, adopts a directed graph to abstract the pipe section with the flow direction, adopts an undirected graph to abstract the pipe section without the flow direction, and finally utilizes a breadth-first search algorithm to search the valve needing to be closed and the pipeline which can be influenced.
Claims (4)
1. A tube burst searching method based on a three-dimensional underground pipeline is characterized by comprising the following steps:
s101, determining a pipe section where a pipe explosion point is located, determining the flow direction of the pipe section where the pipe explosion point is located, and entering S103; if the pipe section where the pipe explosion point is located has no flow direction information, the step S102 is carried out;
s102, specifying the flow direction information of the pipe section, and entering S103;
s103, acquiring upstream connection node information according to the flow direction of the pipe section, and entering S104;
s104, judging whether the connection node is a valve or not according to the upstream connection node information; if the valve is the valve, the searching process is completed; if not, entering S105;
s105, preferentially searching upstream connecting nodes according to the flow direction by using the breadth until all upstream valves are found; if the pipe section has no flow direction information, the step S106 is carried out;
s106, searching the downstream of the affected pipe section until all the pipe sections which are not visited are searched, and finishing the searching process;
the specific method of preferentially searching the upstream connection node by using the breadth according to the flow direction is as follows:
s1051, searching all pipe sections which are closest to the upstream direction of the pipe section where the pipe explosion is located and have no access, and entering S1052;
s1052, judging whether the connecting node on the pipe section is a valve, if so, entering S1053, and if not, entering S1055;
s1053, searching for a pipe section which takes the valve as a starting point or an end point and has no access, and entering 1054;
s1054, judging whether the connecting node in the pipe section which is not visited is a valve, if so, stopping searching, otherwise, entering S1055;
s1055, searching the pipe sections which are not visited in the upstream direction of the connecting node, and entering S1052;
the specific method of step S106 is as follows:
s1061, searching the downstream of the pipe section, finding a connecting node, and entering S1062;
s1062, searching all pipe sections which are not visited in the downstream direction of the connection nodes, finding the connection nodes which are not visited in the pipe sections, and entering S1063;
s1063, searching the pipe sections which take the connection nodes which are not visited as a starting point or an end point and are not visited, determining the connection nodes of the pipe sections which are not visited, and entering S1064;
and S1064, searching all the connection nodes as starting points or end points, and completing the search process if no accessed pipe section exists.
2. The pipe bursting search method based on the three-dimensional underground pipeline is characterized in that when the flow direction of the pipe section is a positive flow direction, the upstream is a starting node of the pipe section; when the flow direction of the pipe section is negative, the upstream is the connecting node of the pipe section.
3. The pipe bursting search method based on the three-dimensional underground pipeline as claimed in claim 1, wherein the flow of searching the optimized structure of the upstream valve is as follows:
step one, establishing a valve array V _ array, a node queue N _ queue and an effective edge set E _ set;
step two, judging the connecting nodes at the two ends of the pipe section where the burst point is located, stopping searching if the connecting nodes at the two ends are valves, and adding the two valves into a valve array V _ array; otherwise, adding the connecting node of the non-valve end into the node queue N _ queue;
step three, taking out a point from the connecting node queue, and adding all effective edges intersected with the point into an effective edge set E _ set;
step four, taking out one edge from the effective edge set E _ set, judging the flow direction of the edge, adding an upstream connecting node N of the edge into a node queue N _ queue, judging, if the upstream connecting node N is a valve point, adding the upstream connecting node N into a valve array V _ array, and if not, adding all effective edges intersected with the upstream connecting node N into the effective edge set E _ set;
and step five, repeating the step four until the effective edge set E _ set is empty.
4. The pipe bursting search method based on the three-dimensional underground pipeline as claimed in claim 1, wherein the specific method for searching the affected pipe section is as follows:
s201, inputting pipe section information, and entering S202;
s202, acquiring an upstream connecting node P0 of the pipe section, and entering S203;
s203, judging whether the upstream connecting node P0 is a valve or not, if so, adding the valve into a valve array needing to be closed; if not, entering S204;
s205, acquiring all pipe sections connected with the upstream of the upstream connecting node P0, circularly traversing each pipe section, and entering S206;
s206, judging whether all the pipe sections connected with the upstream are traversed or not, and if so, entering S207; if not, the process goes to S201;
s207, inputting information of a pipe section, acquiring all pipe sections connected with the downstream of the pipe section, circularly traversing each pipe section, and entering S208;
s208, screening out the affected pipe sections, and entering S209; if all the pipe sections are not traversed, inputting pipe section information one by one, checking out the affected pipe sections, and entering S209;
s209, adding the affected pipe segments into the affected pipe segment set, and returning to S207.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911287302.0A CN111102476B (en) | 2019-12-14 | 2019-12-14 | Pipe burst searching method based on three-dimensional underground pipeline |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911287302.0A CN111102476B (en) | 2019-12-14 | 2019-12-14 | Pipe burst searching method based on three-dimensional underground pipeline |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111102476A CN111102476A (en) | 2020-05-05 |
| CN111102476B true CN111102476B (en) | 2021-11-09 |
Family
ID=70423153
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911287302.0A Active CN111102476B (en) | 2019-12-14 | 2019-12-14 | Pipe burst searching method based on three-dimensional underground pipeline |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111102476B (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111814289B (en) * | 2020-09-08 | 2020-12-22 | 成都同飞科技有限责任公司 | Water supply pipe network pipe burst analysis method and analysis system based on schema theory |
| CN112214648A (en) * | 2020-10-13 | 2021-01-12 | 合肥小龟快跑信息科技有限公司 | Method for realizing tube burst analysis logic according to abnormal information fed back by acquisition points |
| CN116756895B (en) * | 2023-08-15 | 2023-11-10 | 西南石油大学 | GIS-based urban complex multi-source pipe network pipe explosion analysis method and system |
| CN117091079B (en) * | 2023-10-19 | 2024-01-16 | 杭州缥缈峰科技有限公司 | Valve closing method and system based on multi-air-source urban gas pipe network |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPS595951A (en) * | 1982-07-03 | 1984-01-12 | Yoshio Kawaguchi | Method for detecting bursting position of arranged pipe |
| CN101634398A (en) * | 2009-07-30 | 2010-01-27 | 苏州市数字城市工程研究中心有限公司 | Method for analyzing cartridge igniter of city integrated pipe network in three-dimensional visual environment |
| CN105225187A (en) * | 2015-10-09 | 2016-01-06 | 苏州盛景信息科技股份有限公司 | Based on the pipe network spacial analytical method of breadth-first search |
| CN105574136A (en) * | 2015-12-12 | 2016-05-11 | 重庆森鑫炬科技有限公司 | Method for searching valves of water supply network |
| CN110500512A (en) * | 2019-08-19 | 2019-11-26 | 北京讯腾智慧科技股份有限公司 | Combustion gas method for analyzing cartridge igniter and device |
-
2019
- 2019-12-14 CN CN201911287302.0A patent/CN111102476B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPS595951A (en) * | 1982-07-03 | 1984-01-12 | Yoshio Kawaguchi | Method for detecting bursting position of arranged pipe |
| CN101634398A (en) * | 2009-07-30 | 2010-01-27 | 苏州市数字城市工程研究中心有限公司 | Method for analyzing cartridge igniter of city integrated pipe network in three-dimensional visual environment |
| CN105225187A (en) * | 2015-10-09 | 2016-01-06 | 苏州盛景信息科技股份有限公司 | Based on the pipe network spacial analytical method of breadth-first search |
| CN105574136A (en) * | 2015-12-12 | 2016-05-11 | 重庆森鑫炬科技有限公司 | Method for searching valves of water supply network |
| CN110500512A (en) * | 2019-08-19 | 2019-11-26 | 北京讯腾智慧科技股份有限公司 | Combustion gas method for analyzing cartridge igniter and device |
Non-Patent Citations (1)
| Title |
|---|
| 基于广度优先的管网爆管分析模块的研究;董娟;《中国优秀硕士学位论文全文库》;20191031;论文摘要,论文正文第15-24页、图3.6 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111102476A (en) | 2020-05-05 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111102476B (en) | Pipe burst searching method based on three-dimensional underground pipeline | |
| CN109578816B (en) | Water supply pipe network pipe explosion detection method and device, control method and device | |
| CN103939749A (en) | Oil pipeline network leakage intelligent self-adaptation monitoring system and method based on big data | |
| CN105042339A (en) | Leakage rate estimation system and method for product oil pipelines based on zero dimension | |
| CN111814289B (en) | Water supply pipe network pipe burst analysis method and analysis system based on schema theory | |
| CN110500512B (en) | Gas pipe burst analysis method and device | |
| CN107463737B (en) | method and device for calculating leakage of liquid pipeline | |
| CN114297810A (en) | Method and system for analyzing and verifying DMA partition topology | |
| CN113701060B (en) | Intelligent diagnosis method for urban drainage pipe network based on drainage model | |
| CN117071706B (en) | Drainage pipe network control system for municipal road | |
| CN110848578A (en) | PDD model-based existing leakage positioning method for urban water supply pipe network | |
| CN113803647B (en) | Pipeline leakage detection method based on fusion of knowledge features and hybrid model | |
| CN112765862B (en) | Method for calculating running parameters of pipe cleaner in natural gas pipeline cleaning process | |
| Puust et al. | Real water network comparative calibration studies considering the whole process from engineer's perspective | |
| CN114912291A (en) | Newly-added monitoring point arrangement method and device serving water supply network hydraulic model checking | |
| JP2004092285A (en) | Water distribution pipe network route search device and water distribution control device using the device | |
| JP2886022B2 (en) | Pipe network analysis data generation method | |
| Qi et al. | Research on an optimized leakage locating model in water distribution system | |
| CN111832232A (en) | Technical method for diagnosing and identifying accumulated liquid in pipeline | |
| Huang et al. | An Efficient Lagrangian-Based Approach for Transient Modelling and Analysis in Urban Water Distribution Networks:(055) | |
| CN111188999A (en) | Water supply pipeline leakage detection method and system | |
| WO2024131638A1 (en) | Method for analyzing spatial redundancy of urban underground pipe network | |
| KR102600664B1 (en) | Multiple leakage detection method and system thereof | |
| Prytula et al. | Optimal scheduling of operating modes of the gas transmission system | |
| CN114857509B (en) | Pipe network pipe explosion leakage monitoring method and device and platform positioning and verifying method |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |