CN118260312B - Method and system for updating drainage pipe network data - Google Patents
Method and system for updating drainage pipe network data Download PDFInfo
- Publication number
- CN118260312B CN118260312B CN202410697505.1A CN202410697505A CN118260312B CN 118260312 B CN118260312 B CN 118260312B CN 202410697505 A CN202410697505 A CN 202410697505A CN 118260312 B CN118260312 B CN 118260312B
- Authority
- CN
- China
- Prior art keywords
- point
- pipe
- data
- pipeline
- points
- 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
- 238000000034 method Methods 0.000 title claims abstract description 30
- 239000013598 vector Substances 0.000 claims abstract description 90
- 238000012216 screening Methods 0.000 claims abstract description 13
- 238000012545 processing Methods 0.000 claims abstract description 7
- 238000005259 measurement Methods 0.000 claims description 7
- 238000010586 diagram Methods 0.000 description 15
- 238000010276 construction Methods 0.000 description 3
- 238000001514 detection method Methods 0.000 description 3
- 239000010865 sewage Substances 0.000 description 3
- 238000003780 insertion Methods 0.000 description 2
- 230000037431 insertion Effects 0.000 description 2
- 238000007689 inspection Methods 0.000 description 2
- 239000000463 material Substances 0.000 description 2
- 230000008569 process Effects 0.000 description 2
- 238000003339 best practice Methods 0.000 description 1
- 230000003139 buffering effect Effects 0.000 description 1
- 238000013329 compounding Methods 0.000 description 1
- 230000004927 fusion Effects 0.000 description 1
- 238000012625 in-situ measurement Methods 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000006855 networking Effects 0.000 description 1
- 238000005457 optimization Methods 0.000 description 1
- 230000001172 regenerating effect Effects 0.000 description 1
- 230000003252 repetitive effect Effects 0.000 description 1
- 230000000717 retained effect Effects 0.000 description 1
- 238000010845 search algorithm Methods 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/24—Querying
- G06F16/242—Query formulation
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/23—Updating
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/20—Administration of product repair or maintenance
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Databases & Information Systems (AREA)
- Data Mining & Analysis (AREA)
- General Engineering & Computer Science (AREA)
- Human Resources & Organizations (AREA)
- Tourism & Hospitality (AREA)
- Marketing (AREA)
- General Business, Economics & Management (AREA)
- Entrepreneurship & Innovation (AREA)
- Economics (AREA)
- Operations Research (AREA)
- Strategic Management (AREA)
- Quality & Reliability (AREA)
- Mathematical Physics (AREA)
- Computational Linguistics (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention relates to the technical field of pipe network data processing, and provides a method and a system for updating drainage pipe network data, wherein the method comprises the following steps: acquiring regional field data and generating new library pipe network data; searching a main pipeline and a main pipe point from the new library pipe network data; screening out edge connecting points from the main pipe points; extracting the pipeline types and Y-axis coordinate values of all the edge connecting points; for each pipeline type, taking the edge joint point with the largest Y-axis coordinate value as an edge joint path starting point pipe point, and taking the rest edge joint points as edge joint path ending point pipe points; creating a road netlist; obtaining a space vector of the shortest path of the road netlist according to the starting point pipe point of the edge connecting path and the ending point pipe point of the edge connecting path; obtaining intersecting main pipelines according to space vectors in an original pipe network database and space vectors of shortest paths of the netlist, and obtaining intersecting main points according to the intersecting main pipelines; and searching pipelines and pipe points which need to be updated in the original pipe network database according to the intersected main pipe points, and updating data. The scheme can automatically update pipe network data.
Description
Technical Field
The invention relates to the technical field of pipe network data processing, in particular to a method and a system for updating drainage pipe network data.
Background
The urban underground pipe network is an important infrastructure of the city, and the safe operation of the urban underground pipe network is the guarantee of high-efficiency and high-quality transportation of modern cities. The construction work of underground pipe networks is carried out in a plurality of cities in the whole country, the general flow mainly comprises three links of field pipe network detection, field pipe network data archiving and data warehouse entry, pipe network information management platform and display, wherein the core is the updating of pipe network data, and the timeliness of supervision and the accuracy of problem analysis can be facilitated only if new and old data are continuously updated and changed, but the links are always ignored.
In the existing working mode of underground pipe network construction in the whole country, main efforts are focused on the construction of pipe network outside industry detection or pipe network management platforms, and the investment in data is mostly fusion edge processing of data in different areas so as to form large-area data. The updating work after the pipe network basic data is built basically stays in the manual replacement stage of the industry, the automatic updating means is almost omitted, and the related articles are few.
The existing pipe network data updating mainly comprises two methods, namely range level updating and element level updating. The range level updating method is to delete all historical data in the range according to the preset range and then introduce new data according to the range to complete updating. The range-level updating method can realize the updating of large-range or batch data, and excessive operation details are not needed to be considered in the updating process, but the method still needs to perform direct or indirect intervention manually when the new data and the old data are fused and connected to each other to ensure the integrity, the accuracy and the consistency of the data before and after the updating. The optimization method proposed by part of the literature reduces the workload of manual intervention to a certain extent, but the step can not be completely omitted, and meanwhile, the technical standards and the data quality requirements for links such as field measurement, internal inspection, achievement warehouse entry and the like are more strict, and the steps of data processing are more complicated. The element level updating method is to modify, delete and the like specific pipe points and pipelines, and the updating of the specified elements is completed in a targeted manner. The element-level pipeline updating method can not cause data redundancy due to smaller granularity, can accurately operate data, and cannot damage the original integrity and consistency of the data. However, the method is not attractive for updating large-scale or batch data, and meanwhile, the operation process is relatively complex due to small operation elements and more operation details, the possibility of data errors is also higher, and the method is generally required to be carried out in a networking environment, so that the production work in an offline intranet environment is not facilitated.
Therefore, it is necessary to provide a method and a system for updating the drainage pipe network data, which solve the problem of automatic updating of the pipe network data, and can simply, quickly, efficiently and automatically complete the data updating while removing the labor in the industry.
The above information disclosed in the background section is only for enhancement of understanding of the background of the application and therefore it may contain information that does not form the prior art that is already known to a person of ordinary skill in the art.
Disclosure of Invention
The invention mainly aims to solve the problem of automatic updating of pipe network data, and provides a method and a system for updating the drainage pipe network data, which can simply, quickly, efficiently and automatically complete data updating while removing the labor in the industry.
In order to achieve the above object, a first aspect of the present invention provides a method for updating data of a drainage pipe network, including the steps of:
S1: acquiring regional field data of a regional pipe point, and generating new library pipe network data; the drainage pipe network data is the drainage pipe network data in a designated area; the field data are drainage pipe network data obtained by field measurement;
S2: searching a main pipeline from the new library pipe network data, and finding all main pipe points from the main pipeline;
s3: screening out edge connecting points from the main pipe points;
S4: extracting the pipeline types and Y-axis coordinate values of all the edge connecting points, wherein the Y axis is in the direction from the south to the north;
S5: for each pipeline type, taking the edge joint point with the largest Y-axis coordinate value as an edge joint path starting point pipe point, and taking the rest edge joint points as edge joint path ending point pipe points;
s6: creating a road netlist;
s7: obtaining a space vector of the shortest path of the road netlist according to the starting point pipe point of the edge connecting path and the ending point pipe point of the edge connecting path;
s8: obtaining intersecting main pipelines according to space vectors in an original pipe network database and space vectors of shortest paths of the netlist, and obtaining intersecting main points according to the intersecting main pipelines;
s9: and searching pipelines and pipe points which need to be updated in the original pipe network database according to the intersected main pipe points, and updating data.
As an exemplary embodiment of the present invention, in step S1, after the new library pipe network data is generated, the data problem is checked, if the data problem exists, the outside-pipe data is checked and modified, and the new library pipe network data is regenerated.
In step S1, the field data includes whether the field data is a main pipe, a well number, a pipeline type, and well coordinates, the well coordinates include X-axis coordinate values and Y-axis coordinate values, and the X-axis is in a west-east direction. One well corresponds to one point.
As an example embodiment of the present invention, the field data further includes a starting well number and a finishing well number.
As an exemplary embodiment of the present invention, in step S3, the screening the junction point from the main pipe point includes: and screening out a main pipe point which is connected with only one main pipeline as a joint point.
As an example embodiment of the present invention, in step S6, the creating a netlist includes:
Creating a road netlist, wherein the road netlist comprises a cost value and a space vector of the road netlist;
And (3) taking all pipe points in the new library pipe network data as a buffer area, intersecting the pipelines of the original pipe network data with the buffer area, and reserving the intersected pipelines to obtain a space vector of the road netlist.
As an example embodiment of the present invention, the buffering all pipe points in the new pipe network data includes:
drawing a circle by taking each pipe point in the pipe network data of the new library as a circle center, wherein the radius of the circle is a specified length; the set of circles drawn by all the pipe points is the buffer.
As an exemplary embodiment of the present invention, in step S7, obtaining a space vector of a shortest path of the netlist according to a starting point and an ending point of the edge path includes:
s71: creating a road network node table;
S72: acquiring an original space vector of a starting point pipe point of the edge connecting path and an original space vector of an ending point pipe point of the edge connecting path from an original pipe network database according to the starting point pipe point of the edge connecting path and the ending point pipe point of the edge connecting path;
S73: according to the original space vector of the starting point pipe point of the edge connecting path and the original space vector of the ending point pipe point of the edge connecting path, the node numbers of the same space vector are obtained from the road network node table, and the starting node numbers and the ending node numbers are obtained;
s74: and inquiring the shortest path from the path list according to the starting node number and the ending node number.
As an exemplary embodiment of the present invention, in step S8, obtaining the intersecting main pipeline according to the space vector in the original pipe network database and the space vector of the shortest path of the netlist includes:
and (3) searching out the pipelines which are the same as the space vectors of all the shortest path sets from the original pipe network database, namely the intersecting main pipeline.
Obtaining the intersecting main pipe point from the intersecting main pipe line includes:
and performing intersection processing on the intersection main pipeline and the pipe points in the original pipe network database to obtain the intersection main pipe points.
As an example embodiment of the present invention, in step S9, searching for the pipeline and pipe point data that needs to be updated in the original pipe network database includes:
S911: searching a pipeline connected with the main pipe point through the intersecting main pipe point;
S912: searching a pipe point of a non-joint point connected with the pipeline through the pipeline;
s913: searching a pipeline connected with the pipe point of the non-joint point through the pipe point of the non-joint point;
s913: steps S912 and S913 are repeated until no new pipeline and pipe point are found.
As an exemplary embodiment of the present invention, in step S9, performing data update includes:
deleting the pipeline and pipe point data which need to be updated in the searched original pipe network database from the original pipe network database;
and inserting the pipe point and pipeline data of the non-joint point in the pipe network data of the new pipe network into the original pipe network database.
As a second aspect of the present invention, the present invention provides a system for updating data of a drainage network, including: the system comprises a new library, a border path starting and ending point acquisition module, a road netlist, an intersection main point data acquisition module and a searching and updating module;
The new library is used for acquiring regional industry data, generating and storing new library pipe network data; the drainage pipe network data is the drainage pipe network data in a designated area; the field data are drainage pipe network data obtained by field measurement;
The edge connecting path starting and ending pipe point obtaining module is used for searching a main pipeline from the new library pipe network data and finding all main pipe points from the main pipeline; screening out edge connecting points from the main pipe points; extracting the pipeline types and Y-axis coordinate values of all the edge connecting points, wherein the Y-axis is the direction from the south to the north; for each pipeline type, taking the edge joint point with the largest Y-axis coordinate value as an edge joint path starting point pipe point, and taking the rest edge joint points as edge joint path ending point pipe points;
A road netlist comprising a space vector of the road netlist;
the intersecting main pipe point data acquisition module is used for acquiring a space vector of the shortest path of the road netlist according to the starting point pipe point of the joint edge path and the ending point pipe point of the joint edge path, acquiring an intersecting main pipe line according to the space vector in the original pipe network database and the space vector of the shortest path of the road netlist, and acquiring an intersecting main pipe point according to the intersecting main pipe line;
And the searching and updating module is used for searching the pipeline and pipe point data which need to be updated in the original pipe network database according to the intersected main pipe points and updating the data.
The invention has the advantages that the invention uses the edge connecting path selected by the new pipe mesh screen to start and finish the pipe point, searches the pipeline and pipe point data needing to be updated in the original pipe network database, and can simply, quickly, efficiently and automatically complete the update of new and old data while removing the labor of the industry.
Drawings
The above and other objects, features and advantages of the present application will become more apparent by describing in detail exemplary embodiments thereof with reference to the attached drawings. The drawings described below are only some embodiments of the present application and other drawings may be obtained from these drawings without inventive effort for a person of ordinary skill in the art.
Fig. 1 schematically shows a step diagram of a method for updating drain network data.
Fig. 2 schematically shows a schematic of a main pipeline.
Fig. 3 schematically shows a schematic diagram of a main pipe point.
Fig. 4 schematically shows a schematic view of a junction point.
Fig. 5 schematically shows a schematic diagram of the junction point corresponding to the upper well number.
FIG. 6 schematically illustrates a schematic diagram of the ordering of the junction point data.
Fig. 7 schematically shows a schematic view of the junction path.
Fig. 8 schematically shows a schematic of a netlist.
Fig. 9 schematically shows a schematic diagram of all points in the new library pipe network data.
Fig. 10 schematically shows a schematic of a buffer.
FIG. 11 schematically illustrates a schematic of the intersection of a pipeline of an original pipe network database with a buffer zone.
Fig. 12 schematically shows a pipeline diagram of the original pipe network database retained after the pipeline intersects the buffer.
Fig. 13 schematically shows a schematic diagram of the principle of Dijkstra algorithm.
Fig. 14 schematically shows a schematic of intersecting main pipelines of an original pipe network database.
Fig. 15 schematically illustrates a schematic diagram of intersecting primary pipe points of an original pipe network database.
Fig. 16 schematically shows a schematic diagram of pipeline and pipe point data that needs to be updated.
Fig. 17 schematically shows a schematic diagram after insertion of new data.
Detailed Description
Example embodiments will now be described more fully with reference to the accompanying drawings. However, the exemplary embodiments can be embodied in many forms and should not be construed as limited to the embodiments set forth herein; rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the concept of the example embodiments to those skilled in the art. The same reference numerals in the drawings denote the same or similar parts, and thus a repetitive description thereof will be omitted.
Furthermore, the described features, structures, or characteristics may be combined in any suitable manner in one or more embodiments. In the following description, numerous specific details are provided to give a thorough understanding of embodiments of the application. One skilled in the relevant art will recognize, however, that the application may be practiced without one or more of the specific details, or with other methods, components, devices, steps, etc. In other instances, well-known methods, devices, implementations, or operations are not shown or described in detail to avoid obscuring aspects of the application.
The block diagrams depicted in the figures are merely functional entities and do not necessarily correspond to physically separate entities. That is, the functional entities may be implemented in software, or in one or more hardware modules or integrated circuits, or in different networks and/or processor devices and/or microcontroller devices.
The flow diagrams depicted in the figures are exemplary only, and do not necessarily include all of the elements and operations/steps, nor must they be performed in the order described. For example, some operations/steps may be decomposed, and some operations/steps may be combined or partially combined, so that the order of actual execution may be changed according to actual situations.
It will be understood that, although the terms first, second, third, etc. may be used herein to describe various components, these components should not be limited by these terms. These terms are used to distinguish one element from another element. Accordingly, a first component discussed below could be termed a second component without departing from the teachings of the present inventive concept. As used herein, the term "and/or" includes any one of the associated listed items and all combinations of one or more.
Those skilled in the art will appreciate that the drawings are schematic representations of example embodiments and that the modules or flows in the drawings are not necessarily required to practice the application and therefore should not be taken to limit the scope of the application.
According to a first embodiment of the present invention, the present invention provides a system for updating data of a drainage network, including: the system comprises a new library, a border path starting and ending point acquisition module, a road netlist, an intersection main point data acquisition module and a searching and updating module;
The new library is used for acquiring regional industry data, generating and storing new library pipe network data; the drainage pipe network data is the drainage pipe network data in a designated area; the field data are drainage pipe network data obtained by field measurement;
The edge connecting path starting and ending pipe point obtaining module is used for searching a main pipeline from the new library pipe network data and finding all main pipe points from the main pipeline; screening out edge connecting points from the main pipe points; extracting the pipeline types and Y-axis coordinate values of all the edge connecting points, wherein the Y-axis is the direction from the south to the north, and the Y-axis coordinate values are larger towards the north; for each pipeline type, taking the edge joint point with the largest Y-axis coordinate value as an edge joint path starting point pipe point, and taking the rest edge joint points as edge joint path ending point pipe points;
The road netlist comprises a sequence number, a starting point, a stopping point, a cost value and a road netlist space vector field.
The intersecting main pipe point data acquisition module is used for acquiring a space vector of the shortest path of the road netlist according to the starting point pipe point of the joint edge path and the ending point pipe point of the joint edge path, acquiring an intersecting main pipe line according to the space vector in the original pipe network database and the space vector of the shortest path of the road netlist, and acquiring an intersecting main pipe point according to the intersecting main pipe line;
And the searching and updating module is used for searching the pipeline and pipe point data which need to be updated in the original pipe network database according to the intersected main pipe points and updating the data.
According to a second embodiment of the present invention, the present invention provides a method for updating data of a drainage pipe network, as shown in fig. 1, including the following steps:
S1: acquiring regional field data and generating new library pipe network data; the drainage pipe network data is the drainage pipe network data in a designated area; the field data are drainage pipe network data obtained by field measurement.
The designated area includes one or more areas, which may be, for example, a city or a cell.
And checking the data problem after the new library pipe network data is generated, checking and modifying the field data if the data problem exists, and then regenerating the new library pipe network data.
The field data includes pipe point field data and pipeline field data.
The data problems comprise logic problems and attribute problems, wherein the logic problems comprise table names, table structures, necessary filling fields, pipe codes, geophysical prospecting point numbers, point numbers on the graph, XY coordinates on the graph, eccentricity, well bottom depth, pipe point angles, pipe diameters, reducing pipeline points, starting and stopping pipeline points, point table other attributes, detection time, drainage flow direction, pipeline length, variable material diameter, large pipe flow small pipe, field values, comprehensive pipe ditch embedding, auxiliary geometric types and the like. Attribute questions include feature attributes, attachment attributes, pipeline material attributes, equity unit attributes, usage status attributes, and embedded type attributes, among others.
The point of pipe field data includes well number, pipeline type, well coordinates. The pipeline is connected with each pipe point, and the pipeline field data comprises whether the pipeline is a main pipe, a starting point well number and a terminal point well number. The graph of pipe network data is a top view, one well corresponds to one pipe point, the well coordinates comprise X-axis coordinates and Y-axis coordinates, the X-axis is in the east-west direction, the Y-axis is in the north-south direction, and the Y-axis coordinates are larger towards the north.
And checking the pipe network field data comprises compounding field workers and quality inspection by internal workers.
S2: and searching a main pipeline from the new library pipe network data, and finding all the main pipe points from the main pipeline.
The pipeline outside industry data comprises a field of whether the pipeline is a master or not, and the attribute value of the field is filled in when the new library pipe network data is generated by the inside industry operation and is divided into a master and a branch pipe. As shown in fig. 2, fig. 2 shows a main pipeline with the transverse direction being the X-axis, i.e. from west to east, and the longitudinal direction being the Y-axis, i.e. from north to south. The thicker lines are main pipelines, and the main pipelines are two in the north-south direction and four in the east-west direction.
Finding out all main pipe points from the main pipe lines, and dividing the main pipe lines connected with the main pipe points into two cases according to the number of the main pipe lines connected with the main pipe points, wherein one case is that only one main pipe line is connected, and the other case is that a plurality of main pipe lines are connected. As shown in fig. 3, there are multiple main pipe points on the main pipe, and the larger dots are main pipe points.
S3: and screening out the border points from the main pipe points.
Screening the border points from the main pipe points comprises the following steps: and screening out a main pipe point which is connected with only one main pipeline as a joint point.
The border point is the main pipe point connected with only one main pipe line. In pipe network data, the border point of a zone is located near the boundary of the zone, so that only one main pipeline is connected to form the main pipeline.
The edge point is a link which is under the control of the scheme, is obtained from the network data of the new base, forms an edge path starting/ending point, is applied to the original network database, and is the beginning of all the subsequent steps (main pipeline, main pipeline point, pipeline/pipeline point needing to be updated) of the original network database. If the joint point is not available, the data to be updated in the original pipe network database cannot be found, i.e. the scheme cannot be established.
As shown in fig. 4, fig. 4 shows a schematic view of a junction point connected to only one main pipeline, indicating that the junction point is connected as a well at the edge of the zone.
S4: extracting the pipeline types and Y-axis coordinate values of all the edge connecting points, wherein the Y-axis is the direction from the south to the north.
As shown in fig. 5, the well number at the junction is displayed. The well number is written during the internal operation, and the naming rule of the well number is as follows: pipeline type (2 bits) +flow number (3 bits).
For example, when in-situ measurement is started in a zone to acquire drainage pipe network data, the well number of the first rainwater well measured by default is generally YS001, and the well numbers of the rainwater wells measured subsequently are written in sequence from 002; the measured well number of the first bilge well is WS001, and the well numbers of the next measured bilge wells are sequentially written from 002.
S5: and for each pipeline type, taking the edge joint point with the largest Y-axis coordinate value as an edge joint path starting point pipe point, and taking the rest edge joint points as edge joint path ending point pipe points.
As shown in fig. 6, the pipeline types include rainwater (YS), sewage (WS), and in fig. 6, the rainwater pipeline is arranged in a reverse order to the Y-axis coordinate value alone, and the sewage pipeline is arranged in a reverse order to the Y-axis coordinate value alone.
As can be seen, in fig. 6, the starting point of the edge connecting path of the rainwater pipeline is YS162, and the rest of edge connecting points are end point of the edge connecting path; the starting point pipe point of the edge connecting path of the sewage pipeline is WS093, and the rest edge connecting points are the end point pipe points of the edge connecting path. As shown in fig. 7, the junction point path is obtained from the junction path start point pipe point and the junction path end point pipe point.
S6: creating a road netlist.
As shown in FIG. 8, the netlist includes fields such as a sequence number, a start point, an end point, a cost value, a space vector of the netlist, and the like.
Creating a way netlist includes:
Creating a road netlist, wherein the road netlist comprises a cost value and a space vector of the road netlist; the road netlist also comprises a sequence number, a starting point and a termination point;
And (3) taking all pipe points in the new library pipe network data as a buffer area, intersecting the pipelines of the original pipe network data with the buffer area, and reserving the intersected pipelines to obtain a space vector of the road netlist. And calculating a space vector, and obtaining the length value of each pipeline, namely the cost value. The cost value is obtained by calculating the space vector of the road netlist, obtaining the length value of each pipeline and inserting the length value into the cost field of the road netlist.
The buffer area of all the pipe points in the new library pipe network data comprises the following steps:
drawing a circle by taking each pipe point in the pipe network data of the new library as a circle center, wherein the radius of the circle is a specified length; the set of circles drawn by all the pipe points is the buffer.
Fig. 9 shows a schematic diagram of all the pipe points in the new library pipe network, wherein each pipe point is used as a circle center to draw a circle, the set of the circles drawn by all the pipe points is shown in fig. 10, and fig. 10 is a buffer zone. Preferably, the radius of the circle is 20 meters. The radius value is an empirical value, and in order to determine the spatial range of the required update data in the original pipe network database, the spatial vector data required by the road netlist is obtained.
As shown in FIG. 11, the pipelines of the original pipe network data intersect the buffer, and after intersection, the intersecting pipelines of FIG. 12 are reserved, and space vectors of the corresponding pipelines are also reserved.
S7: and obtaining a space vector of the shortest path of the road netlist according to the starting point and the ending point of the edge connecting path.
The obtaining the space vector of the shortest path of the path netlist according to the starting point tube point of the edge connecting path and the ending point tube point of the edge connecting path comprises the following steps:
S71: creating a road network node table; the road network node table comprises a node number and a space vector of the road network node table;
S72: acquiring an original space vector of a starting point pipe point of the edge connecting path and an original space vector of an ending point pipe point of the edge connecting path from an original pipe network database according to the starting point pipe point of the edge connecting path and the ending point pipe point of the edge connecting path;
S73: according to the original space vector of the starting point pipe point of the edge connecting path and the original space vector of the ending point pipe point of the edge connecting path, the node numbers of the same space vector are obtained from the road network node table, and the starting node numbers and the ending node numbers are obtained;
s74: and inquiring the shortest path from the path list according to the starting node number and the ending node number.
Specifically, a road network node table is created in the PostgreSQL database by the pgr _ createtopology function. The function generates a starting point space vector and an ending point space vector of each pipeline according to the space vector of the road list, removes repeated nodes, generates a non-repeated starting and ending point space vector of the pipeline, numbers the generated starting and ending point space vectors from the number 1 in sequence, acquires node numbers, and the node sets with the numbers and the space vectors form a road network node table. The program automatically inserts the node numbers into the initial point and end point fields of the netlist according to the principle of insertion: and generating the corresponding relation when the pipeline space vectors of the road network list generate the start and stop endpoint space vectors of the road network node list.
The PostgreSQL database stores a plurality of data tables associated with the network. PostgreSQL is a powerful open source object relational database management system (ordms). For securely storing data, support best practices, and allow retrieval of requests as they are processed.
And acquiring a starting point and an ending point, namely inserting the node number of the road network node table into the starting point field and the ending point field of the road network table according to the corresponding relation between the space vector of the road network table and the space vector of the road network node table after the road network node table is formed.
And finding a shortest path set corresponding to the starting point and the corresponding ending point according to the Dijkstra algorithm, taking the node number of the starting point and the ending point as the starting vertex parameter and the ending vertex parameter of the pgr _dijkstra function, and inquiring the shortest path from the netlist.
The present solution employs the Dijkstra algorithm, proposed by the netherlands computer scientist Ai Cige ·w·dikoscher (Edsger Wybe Dijkstra) in 1959, which is the shortest path algorithm from one vertex to the remaining vertices. The algorithm is a graph search algorithm, and solves the shortest path problem of a non-negative cost edge path graph, namely the shortest path from a starting vertex to an ending vertex.
The basic principle of this algorithm is shown in fig. 13, where weighted refers to the cost spent from one node to another adjacent node, undirected refers to the possibility of movement in any direction between interconnected nodes. Assuming that the shortest path from node 1 to node 4 is to be acquired, the steps include:
The path from node 1 to all neighboring nodes is first found and the path cost is calculated. In fig. 13, the path and cost from node 1 to all neighboring nodes is: 1- & gt 2,2; 1- & gt 3,6. Then, the adjacent node with the minimum path cost is selected as the next node of the node 1, and whether the node is the node 4 is judged. In fig. 13, the next node to node 1 is node 2. Paths from node 2 to all neighboring nodes that do not contain nodes in the determined path are then found and path costs are calculated. In fig. 13, the eligible paths and costs are: 1- & gt 2- & gt 4,7; 1- > 2- > 3, 11. Then, the adjacent node with the minimum path cost is selected as the next node of the node 2, and whether the node is the node 4 is judged. In fig. 13, the next node to node 2 is node 4, and the query is stopped. Finally, the shortest path from node 1 to node 4 is 1→2→4.
Specifically, the corresponding space vector is found out from the pipe point data of the original pipe network database through the pipe point well number of the starting point of the edge connecting path and the pipe point well number of the ending point of the edge connecting path. And then, the corresponding start point node numbers and end point node numbers are found out from the road network node table through the space vector.
The start point node number and the end point node number are then used as the start vertex parameter, the end vertex parameter of pgr _dijkstra functions in the PostgreSQL database and begin to query in the netlist. The function query results contain seq, path_ seq, node, edge, cost, agg _cost fields, wherein seq represents a default numerical sequence number of each query result; path_seq represents the default numerical sequence number for each query path; node represents the node number of each path, namely the node number in the road network node table; edge represents the number of the next path, namely the sequence number in the path netlist; cost represents the weight value of the next path, i.e., the cost in the netlist; the agg_cost represents the total weight value from the starting node to the current node.
And finally, matching the edge field in the query result with the sequence number field in the road list, wherein the set of space vectors of all the matching results is the shortest path corresponding to the starting point pipeline point and the ending point pipeline point of the edge connecting path, and the pipelines which are the same as the space vectors of all the shortest path sets are searched from the original pipe network database, and are the intersecting main pipelines in the original pipe network database. Intersecting main pipelines and the pipe points of the original pipe network database are subjected to intersecting treatment, and the intersecting pipe points are reserved, namely the intersecting main pipe points.
Steps S1-S5 may be performed simultaneously with steps S6-S7.
S8: and obtaining an intersecting main pipeline according to the space vector in the original pipe network database and the space vector of the shortest path of the netlist, and obtaining an intersecting main pipe point according to the intersecting main pipeline.
Obtaining the intersecting main pipeline according to the space vector in the original pipe network database and the space vector of the shortest path of the netlist comprises the following steps:
and (3) searching out the pipelines which are the same as the space vectors of all the shortest path sets from the original pipe network database, namely the intersecting main pipeline.
Obtaining the intersecting main pipe point from the intersecting main pipe line includes:
and performing intersection processing on the intersection main pipeline and the pipe points in the original pipe network database to obtain the intersection main pipe points.
Fig. 14 is a schematic diagram of intersecting main lines in an original pipe network database, and fig. 15 is a schematic diagram of intersecting main points in an original pipe network database.
S9: and searching the pipeline and pipe point data which need to be updated in the original pipe network database according to the intersected main pipe point and updating the data.
The searching of pipeline and pipe point data which need to be updated in the original pipe network database comprises the following steps:
S911: searching a pipeline connected with the intersecting main pipe point through the intersecting main pipe point;
S912: searching a pipe point of a non-joint point connected with the pipeline through the pipeline;
s913: searching a pipeline connected with the pipe point of the non-joint point through the pipe point of the non-joint point;
S914: steps S912 and S913 are repeated as shown in fig. 16 until a new pipeline and pipe point are not found.
The data updating comprises the following steps:
S921: deleting the pipeline and pipe point data which need to be updated in the searched original pipe network database from the original pipe network database;
S922: as shown in fig. 17, pipe points and pipeline data of non-junction points in the new pipe network data are inserted into the original pipe network database.
The invention uses the edge connecting path selected by the new pipe mesh screen to start and finish the pipe point, searches the pipeline and pipe point data needing to be updated in the original pipe network database, and can simply, quickly, efficiently and automatically complete the update of new and old data while removing the labor in the industry.
The exemplary embodiments of the present invention have been particularly shown and described above. It is to be understood that this invention is not limited to the precise arrangements, instrumentalities and instrumentalities described herein; on the contrary, the invention is intended to cover various modifications and equivalent arrangements included within the spirit and scope of the appended claims.
Claims (8)
1. The method for updating the drainage pipe network data is characterized by comprising the following steps of:
s1: acquiring regional field data and generating new library pipe network data; the drainage pipe network data is the drainage pipe network data in a designated area; the field data are drainage pipe network data obtained by field measurement;
S2: searching a main pipeline from the new library pipe network data, and finding all main pipe points from the main pipeline;
s3: screening out edge connecting points from the main pipe points;
S4: extracting the pipeline types and Y-axis coordinate values of all the edge connecting points, wherein the Y axis is in the direction from the south to the north;
S5: for each pipeline type, taking the edge joint point with the largest Y-axis coordinate value as an edge joint path starting point pipe point, and taking the rest edge joint points as edge joint path ending point pipe points;
s6: creating a road netlist; the road netlist comprises a sequence number, a starting point, a termination point, a cost value and a space vector of the road netlist;
s7: obtaining a space vector of the shortest path of the road netlist according to the starting point pipe point of the edge connecting path and the ending point pipe point of the edge connecting path;
s8: obtaining intersecting main pipelines according to space vectors in an original pipe network database and space vectors of shortest paths of the netlist, and obtaining intersecting main points according to the intersecting main pipelines;
S9: searching a pipeline and pipe point data to be updated in an original pipe network database according to the intersected main pipe points and updating data;
In step S6, the creating a path netlist includes:
All pipe points in the new library pipe network data are used as buffer areas, the pipelines of the original pipe network data are intersected with the buffer areas, and the intersected pipelines are reserved to obtain space vectors of the netlist; calculating a space vector, and acquiring a length value of each pipeline, namely a cost value; the cost value is obtained by calculating the space vector of the road netlist, and the length value of each pipeline is obtained and inserted into the cost field of the road netlist;
in step S7, obtaining a space vector of the shortest path of the netlist according to the starting point and the ending point of the edge connecting path includes:
S71: creating a road network node table; the road network node table comprises a node number and a space vector of the road network node table;
S72: acquiring an original space vector of a starting point pipe point of the edge connecting path and an original space vector of an ending point pipe point of the edge connecting path from an original pipe network database according to the starting point pipe point of the edge connecting path and the ending point pipe point of the edge connecting path;
S73: according to the original space vector of the starting point pipe point of the edge connecting path and the original space vector of the ending point pipe point of the edge connecting path, the node numbers of the same space vector are obtained from the road network node table, and the starting node numbers and the ending node numbers are obtained;
s74: and inquiring the shortest path from the path list according to the starting node number and the ending node number.
2. The method according to claim 1, wherein in step S1, after the new bank pipe network data is generated, the data problem is checked, if the data problem exists, the field data is checked and modified, and the new bank pipe network data is regenerated.
3. The method according to claim 1, wherein in step S1, the field data includes whether the field data is a main pipe, a well number, a pipeline type, and a well coordinate, the well coordinate includes an X-axis coordinate value and a Y-axis coordinate value, and the X-axis is in a west-east direction.
4. The method for updating data of a drainage network according to claim 1, wherein in step S3, the screening out the junction point from the main pipe points includes: and screening out a main pipe point which is connected with only one main pipeline as a joint point.
5. The method for updating drainage network data according to claim 1, wherein in step S8, obtaining the intersecting main pipeline according to the space vector in the original network database and the space vector of the shortest path of the netlist comprises:
finding out the pipelines which are the same as the space vectors of all the shortest paths from the original pipe network database, namely intersecting main pipelines;
Obtaining the intersecting main pipe point from the intersecting main pipe line includes:
and performing intersection processing on the intersection main pipeline and the pipe points in the original pipe network database to obtain the intersection main pipe points.
6. The method for updating drain pipe network data according to claim 1, wherein in step S9, searching the original pipe network database for the pipeline and pipe network data to be updated comprises:
S911: searching a pipeline connected with the main pipe point through the intersecting main pipe point;
S912: searching a pipe point of a non-joint point connected with the pipeline through the pipeline;
s913: searching a pipeline connected with the pipe point of the non-joint point through the pipe point of the non-joint point;
s914: step S912 and step S913 are repeated until the search is ended when no new pipeline and pipe point are found.
7. The method for updating data of a drain pipe network according to claim 1, wherein in step S9, the data updating includes:
deleting the pipeline and pipe point data which need to be updated in the searched original pipe network database from the original pipe network database;
and inserting the pipe point and pipeline data of the non-joint point in the pipe network data of the new pipe network into the original pipe network database.
8. A system for updating data of a drainage network, comprising: the system comprises a new library, a border path starting and ending point acquisition module, a road netlist, an intersection main point acquisition module and a searching and updating module;
The new library is used for acquiring regional industry data, generating and storing new library pipe network data; the drainage pipe network data is the drainage pipe network data in a designated area; the field data are drainage pipe network data obtained by field measurement;
The edge connecting path starting and ending pipe point obtaining module is used for searching a main pipeline from the new library pipe network data and finding all main pipe points from the main pipeline; screening out edge connecting points from the main pipe points; extracting the pipeline types and Y-axis coordinate values of all the edge connecting points, wherein the Y axis is in the direction from the south to the north; for each pipeline type, taking the edge joint point with the largest Y-axis coordinate value as an edge joint path starting point pipe point, and taking the rest edge joint points as edge joint path ending point pipe points;
A road netlist comprising sequence numbers, a starting point, a stopping point, a cost value and a road netlist space vector field; creating a way netlist includes: all pipe points in the new library pipe network data are used as buffer areas, the pipelines of the original pipe network data are intersected with the buffer areas, and the intersected pipelines are reserved to obtain space vectors of the netlist; calculating a space vector, and acquiring a length value of each pipeline, namely a cost value; the cost value is obtained by calculating the space vector of the road netlist, and the length value of each pipeline is obtained and inserted into the cost field of the road netlist;
the intersecting main pipe point data acquisition module is used for acquiring a space vector of the shortest path of the road netlist according to the starting point pipe point of the joint path and the ending point pipe point of the joint path, acquiring intersecting main pipes according to the space vector in the original pipe network database and the space vector of the road netlist, and acquiring intersecting main pipe points according to the intersecting main pipes;
The searching and updating module is used for searching the pipeline and pipe point data needing to be updated in the original pipe network database according to the intersected main pipe points and updating the data;
The obtaining the space vector of the shortest path of the path netlist according to the starting point tube point of the edge connecting path and the ending point tube point of the edge connecting path comprises the following steps:
creating a road network node table; the road network node table comprises a node number and a space vector of the road network node table;
Acquiring an original space vector of a starting point pipe point of the edge connecting path and an original space vector of an ending point pipe point of the edge connecting path from an original pipe network database according to the starting point pipe point of the edge connecting path and the ending point pipe point of the edge connecting path;
According to the original space vector of the starting point pipe point of the edge connecting path and the original space vector of the ending point pipe point of the edge connecting path, the node numbers of the same space vector are obtained from the road network node table, and the starting node numbers and the ending node numbers are obtained;
And inquiring the shortest path from the path list according to the starting node number and the ending node number.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202410697505.1A CN118260312B (en) | 2024-05-31 | 2024-05-31 | Method and system for updating drainage pipe network data |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202410697505.1A CN118260312B (en) | 2024-05-31 | 2024-05-31 | Method and system for updating drainage pipe network data |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN118260312A CN118260312A (en) | 2024-06-28 |
| CN118260312B true CN118260312B (en) | 2024-07-26 |
Family
ID=91607225
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202410697505.1A Active CN118260312B (en) | 2024-05-31 | 2024-05-31 | Method and system for updating drainage pipe network data |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN118260312B (en) |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103235848A (en) * | 2013-04-15 | 2013-08-07 | 中国科学院软件研究所 | Light-weight map matching method based on simplified map model |
| CN108280137A (en) * | 2017-12-27 | 2018-07-13 | 武汉众智鸿图科技有限公司 | A kind of edit methods and device of the pipe network data of task based access control |
Family Cites Families (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR100314596B1 (en) * | 1998-12-05 | 2001-12-12 | 김일복 | A Water Pipe Network Analysis and Management System |
| CN111813886A (en) * | 2020-09-07 | 2020-10-23 | 成都同飞科技有限责任公司 | Method and system for building pipe network database based on pipeline detection result |
| CN113190937A (en) * | 2021-01-25 | 2021-07-30 | 中国电建集团华东勘测设计研究院有限公司 | Automatic construction method for three-dimensional model of drainage pipe network |
| CN113721969B (en) * | 2021-09-08 | 2024-02-06 | 广州城市规划技术开发服务部有限公司 | Multi-scale space vector data cascade update method |
| CN113722872B (en) * | 2021-11-04 | 2022-01-25 | 长安大学 | Method for extracting start and end point attributes of roads in batch in urban area road network |
| CN115114688A (en) * | 2022-06-20 | 2022-09-27 | 天津大学 | A leak monitoring method for fluid pipeline network based on shortest path planning |
| CN116011740A (en) * | 2022-12-15 | 2023-04-25 | 成都秦川物联网科技股份有限公司 | Intelligent gas pipe network inspection method, internet of things system and medium |
| CN116861602A (en) * | 2023-07-04 | 2023-10-10 | 泰华智慧产业集团股份有限公司 | Method and device for checking comprehensive pipe network topology structure |
| CN117094672B (en) * | 2023-08-15 | 2024-11-08 | 河北华勘地质勘查有限公司 | Integrated cloud platform solution method for pipe network detection service |
-
2024
- 2024-05-31 CN CN202410697505.1A patent/CN118260312B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103235848A (en) * | 2013-04-15 | 2013-08-07 | 中国科学院软件研究所 | Light-weight map matching method based on simplified map model |
| CN108280137A (en) * | 2017-12-27 | 2018-07-13 | 武汉众智鸿图科技有限公司 | A kind of edit methods and device of the pipe network data of task based access control |
Also Published As
| Publication number | Publication date |
|---|---|
| CN118260312A (en) | 2024-06-28 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109359351B (en) | Three-dimensional modeling method for pipeline and pipeline design method | |
| CN112035589A (en) | Intelligent verification method for single line diagram updating of distribution network automation master station | |
| CN112580175B (en) | Method and system for establishing BIM (building information modeling) for current pipe network | |
| CN114757019B (en) | Cable channel design method, device, computer equipment and storage medium | |
| CN113705019A (en) | Cable laying design system based on digital design process | |
| CN112182871A (en) | System and method for converting three-dimensional pipeline model into MapGIS model | |
| CN111985014B (en) | Modeling method and system based on standard atlas | |
| CN118260312B (en) | Method and system for updating drainage pipe network data | |
| CN116861602A (en) | Method and device for checking comprehensive pipe network topology structure | |
| CN112948911A (en) | System and method for converting S3D bridge model into MapGIS model | |
| CN115525952A (en) | Forward construction method for pipeline support and hanger model design | |
| CN111241228B (en) | Comprehensive drawing method based on vector data and graphic processing technology | |
| US7844419B1 (en) | Method of detecting potential topology problems in a network | |
| Kieler et al. | Matching river datasets of different scales | |
| CN117631618B (en) | A real-time optimization method and system for DCS logic configuration screen connection | |
| KR20210085265A (en) | Piping Modeling Method Using Performed Data and Computer-readable Recording Medium Recording Program Implementing The Same | |
| CN115659474A (en) | Method for realizing integration of BIM and SAP2000 foundation pit excavation calculation | |
| CN116090048A (en) | Dynamo-based pipe gallery tunnel engineering equipment layout modeling method | |
| CN115033961A (en) | Method for rapidly generating municipal pipeline by using Dynamo | |
| CN113554751A (en) | Super-efficient terrain construction method | |
| CN110298913B (en) | Automatic drainage pipe network model data conversion method based on drainage pipe network planning drawing information | |
| Zhou et al. | The Research on Approach of BIM-Based 3D Design for Transmission Line Project | |
| CN115270250B (en) | BIM-based automatic checking method, system and medium for basic large sample detailed diagram | |
| CN114117586A (en) | Method for establishing incidence relation between supporting and hanging bracket and rooting object thereof in S3D software | |
| CN106599044A (en) | Recognition and processing method for road network target information |
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 |