CN116681215A - Urban gas pipeline gridding minimum management unit division method - Google Patents

Abstract

The application discloses a town gas pipeline gridding minimum management unit dividing method, which comprises the following steps: step S1, acquiring key structure data of a target city; s2, acquiring target pipe network data; step S3, unifying a coordinate system and an encryption offset mode for the data acquired in the step S1 and the step S2; s4, pruning operation is carried out on the pipeline network data; s5, pruning operation is carried out on the road data; and S6, calculating each pipeline in the pipeline data, and determining the management unit division of the pipeline data. The pipe network fusion and pruning algorithm, the road pruning algorithm and the unit division algorithm adopted by the application divide the pipe network, remove equivalent redundancy in the pipe network and the road, effectively avoid over-fitting calculation and improve the operation efficiency of the algorithm through the plane boundary box; based on the fast calculation and filtration mode of the boundary box, the calculated amount is greatly reduced, and the automatic dividing efficiency is effectively improved.

Description

Urban gas pipeline gridding minimum management unit division method

Technical Field

The application belongs to the technical field of gas pipeline management, and particularly relates to a method for dividing minimum management units of town gas pipeline grids.

Background

Due to the complexity of urban construction and distribution, urban gas pipelines are used as communication bodies and generally have complex reticular topological logic structures;

in the daily operation management and risk control process of town gas pipelines, when various daily detection (such as negative potential detection), maintenance, overhaul, evaluation (such as integrity evaluation), risk evaluation and other management and maintenance works, a gas pipeline set in a small range is usually required to be used as a management and service execution unit, so that the management unit is required to be clearly divided, and accumulation of various data in a time dimension, superposition of various data in a space dimension and comprehensive analysis of the data are facilitated; meanwhile, the daily management and responsibility are clear, and the service is returned; in daily operation management of town gas pipelines, meshing and dividing the minimum management unit is a necessary way for fine management.

The existing dividing mode mainly depends on manual work, mainly comprises two main modes, namely manual field visit record or personal experience and memory, and is divided by named correlation in early pipeline construction, and on one hand, if a GIS system is constructed and a map is overlapped with a pipeline center line, the manual mode is adopted to confirm the pipelines one by one;

the current division depends on manual checking and confirmation on the map item by item, even on-site investigation, has huge workload, high cost, low division efficiency, long time consumption, larger randomness and more uncontrollable factors; when the topology logic of streets, administrative districts and pipe networks is dynamically changed, the change cannot be responded in time.

Disclosure of Invention

The application aims to provide a minimum management unit dividing method for town gas pipeline grids, which aims to solve the problems of large workload, high cost, low dividing efficiency, long time consumption, larger randomness and more uncontrollable factors due to the fact that in the prior art, the map is checked and confirmed manually one by one, and even the map is subjected to on-site stepping.

In order to solve the technical problems, the application adopts the following technical scheme:

a town gas pipeline gridding minimum management unit dividing method comprises the following steps:

step S1, acquiring key structure data of a target city; the structure data includes road data, cell data, and public building unit data: wherein the road data is a set of the following mappingsThe method comprises the steps of carrying out a first treatment on the surface of the The cell data is a set of the following mappings +.>Public building unit data is a set of the following mappings；

S2, acquiring target pipe network data; the pipe network data is the set of the following mapping；

Step S3, unifying a coordinate system and an encryption offset mode for the data acquired in the step S1 and the step S2;

s4, preprocessing data, and pruning the pipeline network data;

s5, pruning operation is carried out on the road data;

step S6, each pipeline in the pipeline data is calculated as follows, and the management unit division of each pipeline is determined;

step S601, if the plane boundary box of each line in a pipeline is contained in the closed polygon range of a certain cell, the pipeline is directly divided into the cell management units;

step S602, if the plane boundary box of each line in a pipeline is contained in the closed polygon range of a public unit, the plane boundary box is directly divided into public unit management units;

step S603, if each line of a pipeline is contained in the closed polygon range of a certain cell, dividing the line into the cell management units directly;

step S604, if each line of a pipeline is contained in the closed polygon range of a public unit, dividing the pipeline into public unit management units directly;

step S605 of managing each line in the network dataThe position relation between the target city and all the structural units in the target city is calculated by traversing, and the algorithm is as follows:

step N1, selecting pipelineMaking a judgment if the selected pipeline is +.>If the plane boundary box of the road is not intersected with the plane boundary box of the selected road, neglecting the road, and transferring to the correlation calculation of the next city structure unit;

step N2, if the selected pipelineIf the plane boundary box of the closed polygon boundary line of the cell is not intersected with the plane boundary box of the closed polygon boundary line of the cell, ignoring the cell, and transferring to the correlation calculation of the next city structural unit;

step N3, if the selected pipelineIf the plane boundary box of the (2) is not intersected with the plane boundary box of the boundary line of the public building unit, neglecting the public building unit, and transferring to the correlation calculation of the next city structure unit;

step N4, respectively calculating the selected pipeline linesAnd each line in the urban structural unit +.>Similarity betweenAnd takeCalculating the minimum value as the overall similarity between the pipeline and the urban structural unit;

step N5, traversing and calculating all the city structure units, taking the city structure unit with the smallest similarity calculation value, and taking the city structure unit as a gridding division result of the pipeline if the calculated similarity value meets the threshold requirement;

step S606, repeat step S601 to step S605 until the calculation of all the pipes is completed.

According to the above technical solution, in step S4, the pipe network pruning specifically includes the following steps:

step A1, finding out the line satisfying the following condition：

Step A2, for each line in the terminal line set, calculating its maximum adjacency length as follows：

Step A201, taking one line in the terminal line setInitializing->；

Step A202, takingCalculate->；

Step A203, repeating step A202 untilStopping the calculation, the currently obtained +.>Namely +.>Is a maximum contiguous length of (2);

step SA3, according to the maximum adjacency length of each line in the terminal line set calculated in step A2The method comprises the steps of carrying out a first treatment on the surface of the Comparing all calculated maximum adjacency lengths +.>Taking the maximum contiguous length +.>The end line with the largest value and all lines in the adjacent relation chain form a directed acyclic graph DAG, namely the end line is considered to be the end line which is combined with the original pipe network after pruning>Equivalent result pipe network->。

According to the above technical solution, in step S5, the road pruning specifically includes the following steps:

step B1, arbitrarily extracting two lines from the road RCalculate its similarity +.>And calculates the average similarity:

step B2, if the average similarityGreater than threshold requirement->Returning to step B1, replacing the two lines and retrying: if average similarity->Less than or equal to threshold requirement->Removing a shorter line from the road R;

step B3, repeating steps B1 and B2 until the average similarity between all lines in the road R is greater than the threshold requirementAnd (5) pruning the road.

According to the above technical solution, in step N5, the wireAnd line->The similarity calculation between the two is specifically as follows: line->And lineThe similarity measure between them is:

wherein ,for measuring space +.>，/>For definition in the metric space->Inner curve, ++>Is a line->，/>Similarity measure between->Is a line->，/>Distance measurement value between->Is a line->，/>A measure of directional consistency between +.>Weight factor for distance measure, +.>，/>Weight factor for the measure of directional consistency, +.>。

According to the technical scheme, the distance measurement value calculation method specifically comprises the following steps:

wherein ,for parameterizing the free parameters->，/>Respectively->Defined as->Continuous non-subtractive injection of->Lines are respectively->Expression function in original metric space, +.>Is->Along the intersection perpendicular to +.>Two closed connecting lines are respectively arranged in the directions: self->To the direction ofFrom->To->By arranging two closed connecting lines, the closed polygon is ensured to be formed.

According to the technical scheme, the method for calculating the direction consistency measurement value comprises the following steps:

wherein ,for parameterizing the free parameters->，/>Respectively->Defined as->Continuous non-subtractive injection of->Lines are respectively->The expression function in the original metric space.

According to the technical scheme, the definition of the road is specifically as follows:

a set of wires is provided:

wherein ,；

roadDefined as the set satisfying the following conditions +.>：

For a pair ofAny two lines +.>A set of points->Satisfies the following conditions。

According to the technical scheme, the definition of the pipe network is specifically as follows:

a set of wires is provided:

wherein ,；

pipe networkDefined as an arithmetic system based on a set of simultaneous satisfying the following conditions +.>The method comprises the steps of constructing a special directed acyclic graph DAG, and defining adjacency logic operation on the constructed DAG, wherein the method specifically comprises the following steps of:

step C1, pairAny two lines +.>Set of points->Satisfies the following conditions。

In the step C2, the step of setting the temperature of the liquid,all the line elements in (a) have directionality, and keep the topological logic direction consistent, namely, any two lines in N are provided with:

；

；

somewhat aggregated；

If it isThen there should beOr->；

Step C3, defining an adjacency logic operation relation on the constructed DAG:

the logical relation operatorIdentifying that there is at most one contiguous edge on any edge on the DAG in a defined direction, wherein +.>Is->Since there will be part of the edge without the next edge, defined herein as empty +.>。

Compared with the prior art, the application has the following beneficial effects:

the method of the application realizes the full-flow algorithm processing from data acquisition, input, calculation and result output, and has full-automatic division, high division efficiency and extremely small manual workload; according to the application, the space distance between geometric shapes is considered, trend consistency information between geometric shapes is also considered, linear similarity indexes are uniformly defined, and the correlation between town gas pipelines and urban structural units is effectively and accurately measured; the method is based on the reachability calculation of the directed acyclic graph, and provides powerful support for the correlation calculation between pruning and line segment groups of a pipe network;

the pipe network fusion, pruning and road pruning algorithm is adopted, equivalent redundancy in the pipe network and the road is removed, the fitting calculation is effectively avoided, and the operation efficiency of the algorithm is improved; the calculation amount is greatly reduced based on a rapid calculation and filtration mode of the boundary box, and the automatic dividing efficiency is effectively improved; the method is based on the calculation of the geographic position information completely, is not influenced by the change of any administrative division information and street information, and provides continuous and consistent division results under a large time span.

According to the application, each algorithm is tightly combined with the actual service requirement, and a precise and reliable dividing result is provided; the method is not affected by artificial interference, has no randomness of artificial division, and provides a division result with good robustness; moreover, the application is based on the geographic coordinate system and the pure algebraic algorithm completely, and can be expanded to any other city structure correlation calculation comprising geographic coordinate positions, and is not limited to roads, cells and public building units.

Drawings

FIG. 1 is a block diagram of a block division process according to the present application;

FIG. 2 is a schematic diagram of the unit composition of the present application;

FIG. 3 is a schematic diagram of town gas pipe network locations;

FIG. 4 is one of the exemplary pruning diagrams;

FIG. 5 is a second exemplary pruning schematic;

fig. 6 is a typical road construction diagram.

Detailed Description

The following description of the embodiments of the present application will be made clearly and completely with reference to the accompanying drawings, in which it is apparent that the embodiments described are only some embodiments of the present application, but not all embodiments. All other embodiments, which can be made by those skilled in the art based on the embodiments of the application without making any inventive effort, are intended to be within the scope of the application.

Example 1

As shown in fig. 1, a town gas pipe gridding minimum management unit dividing method includes the following steps:

step S1, acquiring key structure data of a target city; the structure data includes road data, cell data, and public building unit data: wherein the road data is a set of the following mappingsThe method comprises the steps of carrying out a first treatment on the surface of the The cell data is a set of the following mappings +.>Public building unit data is a set of the following mappings；

S2, acquiring target pipe network data; the pipe network data is the set of the following mapping；

Step S3, unifying a coordinate system and an encryption offset mode for the data acquired in the step S1 and the step S2;

s4, preprocessing data, and pruning the pipeline network data;

s5, pruning operation is carried out on the road data;

step S6, each pipeline in the pipeline data is calculated as follows, and the management unit division of each pipeline is determined;

step S601, if the plane boundary box of each line in a pipeline is contained in the closed polygon range of a certain cell, the pipeline is directly divided into the cell management units;

step S602, if the plane boundary box of each line in a pipeline is contained in the closed polygon range of a public unit, the plane boundary box is directly divided into public unit management units;

step S603, if each line of a pipeline is contained in the closed polygon range of a certain cell, dividing the line into the cell management units directly;

step S604, if each line of a pipeline is contained in the closed polygon range of a public unit, dividing the pipeline into public unit management units directly;

step S605 of managing each line in the network dataThe position relation between the urban structural units and all the urban structural units is calculated by traversing, and the algorithm is as follows:

step N1, selecting pipelineMaking a judgment if the selected pipeline is +.>If the plane boundary box of the road is not intersected with the plane boundary box of the selected road, neglecting the road, and transferring to the correlation calculation of the next city structure unit;

step N2, if the selected pipelineIs not intersected with the plane boundary box of the closed polygon boundary line of the taken cell, and the small cell is ignoredThe region is transferred to the correlation calculation of the next city structure unit;

step N3, if the selected pipelineIf the plane boundary box of the (2) is not intersected with the plane boundary box of the boundary line of the public building unit, neglecting the public building unit, and transferring to the correlation calculation of the next city structure unit;

step N4, respectively calculating the selected pipeline linesAnd each line in the urban structural unit +.>Similarity betweenTaking the calculated minimum value as the overall similarity between the pipeline and the urban structural unit;

step N5, traversing and calculating all the city structure units, taking the city structure unit with the smallest similarity calculation value, and taking the city structure unit as a gridding division result of the pipeline if the calculated similarity value meets the threshold requirement;

step S606, repeat step S601 to step S605 until the calculation of all the pipes is completed.

The method of the application realizes the full-flow algorithm processing from data acquisition, input, calculation and result output, and has full-automatic division, high division efficiency and extremely small manual workload; according to the application, the space distance between geometric shapes is considered, trend consistency information between geometric shapes is also considered, linear similarity indexes are uniformly defined, and the correlation between town gas pipelines and urban structural units is effectively and accurately measured; the method is based on the reachability calculation of the directed acyclic graph, and provides powerful support for the correlation calculation between pruning and line segment groups of a pipe network;

the pipe network fusion, pruning and road pruning algorithm is adopted, equivalent redundancy in the pipe network and the road is removed, the fitting calculation is effectively avoided, and the operation efficiency of the algorithm is improved; the calculation amount is greatly reduced based on a rapid calculation and filtration mode of the boundary box, and the automatic dividing efficiency is effectively improved; the method is based on the calculation of the geographic position information completely, is not influenced by the change of any administrative division information and street information, and provides continuous and consistent division results under a large time span.

According to the application, each algorithm is tightly combined with the actual service requirement, and a precise and reliable dividing result is provided; the method is not affected by artificial interference, has no randomness of artificial division, and provides a division result with good robustness; moreover, the application is based on the geographic coordinate system and the pure algebraic algorithm completely, and can be expanded to any other city structure correlation calculation comprising geographic coordinate positions, and is not limited to roads, cells and public building units.

Example two

The application is characterized in that:

the calculation flow is shown in fig. 2, and specifically comprises the following steps: according to the current grid management division requirement, the urban street data, the cell data and the public building data are taken, and the details are as follows:

the data sources are public data on commercial maps including, but not limited to, hundred degree maps, high-german maps, tencel maps, dog search maps, and the like.

The first step: and obtaining geographic information data of the target pipe network to be analyzed, wherein the geographic information data mainly comprise names and coordinate sequences of trunks and branches. The positions of partial town gas pipe networks are shown in figure 1.

Second, key data definition:

point definition, setting point:

wherein B, L, H is the latitude, longitude, and elevation values of the point, X, Y, Z is the value of the plane coordinate system after GK projection is performed.

Wherein the distance between points is defined by the Euclidean distance:

line definition, set point set:

wherein ,；

line L is a setThe points in (a) are connected in sequence from front to back to form a one-way communication structure.

Wherein, length of line L:

planar bounding box of line L:

hereinafter referred to as。

Line similarity:

to measure the degree of correlation from line to line, the present application defines a lineAnd line->The similarity measure between them is:

wherein F is a measurement space;

to define a curve in the metric space F;

is a line->Similarity measurement values between the two;

is a line->A distance measurement value between the two;

is a line->A measure of directional consistency between;

weight factor for distance measure, +.>；

Weight factor for the measure of directional consistency, +.>；

Note that:. Default case->。

Distance metric value definition:

wherein ：

for parameterizing the free parameters->；

Respectively->Defined as->And the continuous non-subtractive full shot.

Lines are respectively->The expression function in the original metric space.

Road definition:

a set of wires is provided:

wherein ,。

roadDefined as the set satisfying the following conditions +.>；

For a pair ofAny two lines +.>A set of points->Satisfies the following conditions。

Pipe network definition:

a set of wires is provided:

wherein ,。

pipe networkDefined as an arithmetic system based on a set of simultaneous satisfying the following conditions +.>Constructing a special directed acyclic graph DAG, and defining an adjacency logical operation on the constructed DAG;

1. for a pair ofAny two lines +.>A set of points->Satisfies the following conditions

2、All line elements in (a) have directionality and keep the topological logic direction consistent, namely: for->Any two lines of (a) have:

；

；

；

if it is，

Then there should beOr->；

3. Adjacency logic relation defined on the constructed DAG:

the logical relation operatorIdentifying that there is at most one contiguous edge on any edge on the DAG in a defined direction, wherein +.>Is->Since there may be a partial edge without a contiguous edge, defined herein as empty +.>。

Thirdly, data preprocessing:

coordinate system

Since the coordinate data acquired from different data sources may be based on different coordinate systems, in order to facilitate subsequent calculation, it is necessary to unify all coordinate data to the same coordinate system (consider unifying the geographic coordinate system to the CGCS2000 national geodetic coordinate system, the projection coordinate system adopts a gaussian-grid 3 ° band, if there is a cross band, a free central meridian should be used), and other coordinate systems (Beijing 54, xian 80, etc.) should be converted into the coordinate system and then calculated.

If the coordinate data is offset (such as GCJ-02, BD-09, etc.), the coordinate data should be offset-processed and then calculated.

Pipe network pruning

Considering the characteristics of town gas pipe structures (as shown in FIG. 3): there are huge numbers of tiny branch structures (mainly including a small entering section, a household entering section, a head leaving section and the like), in order to improve the algorithm efficiency of the application and eliminate equivalent redundancy, pipe network pruning operation is needed before division calculation is started, only pipe network trunks are reserved, and tiny branch structures which do not affect the division structures are removed, as shown in fig. 4 and 5.

Core pruning strategy: reserving a pipe network trunk;

algorithm principle: the longest combined line was found:

the algorithm is realized: realizing based on a stack backtracking algorithm;

the specific algorithm comprises the following steps:

1. pipe-to-pipe networkAccording to the adjacent logical operation relation on the DAG, all the terminal lines are analyzed, and a terminal line set is constructed, namely, all the lines meeting the following conditions are found out +.>：

2. For each line in the set of end lines, its maximum contiguous length is calculated as follows：

(1) Taking one line of the terminal line setInitializing->；

(2) Taking outCalculate->；

(3) Repeating step 2 repeatedly untilStopping the calculation, the currently obtained +.>Namely +.>Maximum vicinities of (2)And (5) connecting the length.

3. Taking the end line with the largest adjacent length value and the DAG consisting of all lines in the adjacent relation chain, namely the end line and the original pipe network after pruningEquivalent result pipe network->。

4. The algorithm is based on DAG, and for a unidirectional communicable structure, the algorithm is divided into independent main lines for non-communicable parts.

Road pruning

A typical road structure is shown in fig. 6 by the lines:

road structural characteristics: 1. because the main road and the auxiliary road exist at the same time, a large number of parallel branches in the same direction exist in the road topology structure;

2. there are a small number of small branch structures that are opposite to the main road.

Object of road pruning: and removing equivalent redundant branches, reserving road trunk and trend information, and realizing based on a linear similarity algorithm. Note that for the accuracy of the final partitioning calculation, the road trunks should be reserved to include all boundary trunks, respectively.

The specific algorithm comprises the following steps:

1. arbitrarily extracting two lines from the road RCalculate its similarity +.>And further calculates the average similarity:

2. if average similarityGreater than threshold requirement->Returning to the step 1, replacing two lines and retrying:

3. if average similarityLess than or equal to threshold requirement->Removing a shorter line from the road R;

4. repeating steps 1-3 until the average similarity between all lines in the road R is greater than the threshold requirement；

5. The present algorithm uses a threshold value。

The DAG in the application is: DAG is Directed Acyclic Graph, directed acyclic graph. Because the conveying media (namely natural gas) in the town gas pipe network have determined flow directions, the graph structure formed by the town gas pipe network can be further defined as a directed acyclic graph according to the conveying flow directions (acyclic refers to the condition that no circulating conveying exists in the town gas pipe network).

It is noted that relational terms such as first and second, and the like are used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. Moreover, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus.

Finally, it should be noted that: the foregoing description is only a preferred embodiment of the present application, and the present application is not limited thereto, but it is to be understood that modifications and equivalents of some of the technical features described in the foregoing embodiments may be made by those skilled in the art, although the present application has been described in detail with reference to the foregoing embodiments. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present application should be included in the protection scope of the present application.

Claims (8)

1. A town gas pipeline gridding minimum management unit dividing method is characterized in that: the method comprises the following steps:

step S1, acquiring key structure data of a target city; the structure data includes road data, cell data, and public building unit data: wherein the road data is a set of the following mappingsThe method comprises the steps of carrying out a first treatment on the surface of the The cell data is a set of the following mappings +.>Public building unit data is a set of the following mappings；

S2, acquiring target pipe network data; the pipe network data is the set of the following mapping；

Step S3, unifying a coordinate system and an encryption offset mode for the data acquired in the step S1 and the step S2;

s4, preprocessing data, and pruning the pipeline network data;

s5, pruning operation is carried out on the road data;

step S6, each pipeline in the pipeline data is calculated as follows, and the management unit division of each pipeline is determined;

step S601, if the plane boundary box of each line in a pipeline is contained in the closed polygon range of a certain cell, the pipeline is directly divided into the cell management units;

step S602, if the plane boundary box of each line in a pipeline is contained in the closed polygon range of a public unit, the plane boundary box is directly divided into public unit management units;

step S603, if each line of a pipeline is contained in the closed polygon range of a certain cell, dividing the line into the cell management units directly;

step S604, if each line of a pipeline is contained in the closed polygon range of a public unit, dividing the pipeline into public unit management units directly;

step S605 of managing each line in the network dataThe position relation between the target city and all the structural units in the target city is calculated by traversing, and the algorithm is as follows:

step N1, selecting pipelineMaking a judgment if the selected pipeline is +.>If the plane boundary box of the road is not intersected with the plane boundary box of the selected road, neglecting the road, and transferring to the correlation calculation of the next city structure unit;

step N2, if the selected pipelineIf the plane boundary box of the closed polygon boundary line of the cell is not intersected with the plane boundary box of the closed polygon boundary line of the cell, ignoring the cell, and transferring to the correlation calculation of the next city structural unit;

step N3, if the selected pipelineIf the plane boundary box of the (2) is not intersected with the plane boundary box of the boundary line of the public building unit, neglecting the public building unit, and transferring to the correlation calculation of the next city structure unit;

step N4, respectively calculating the selected pipeline linesAnd each line in the urban structural unit +.>Similarity betweenTaking the calculated minimum value as the overall similarity between the pipeline and the urban structural unit;

step N5, traversing and calculating all the city structure units, taking the city structure unit with the smallest similarity calculation value, and taking the city structure unit as a gridding division result of the pipeline if the calculated similarity value meets the threshold requirement;

step S606, repeat step S601 to step S605 until the calculation of all the pipes is completed.

2. The town gas pipe gridding minimum management unit partitioning method of claim 1, wherein: in step S4, the pipe network pruning specifically includes the following steps:

step A1, finding out the line satisfying the following condition：

Step A2, for each line in the terminal line set, calculating its maximum adjacency length as follows；

Step A201, taking one line in the terminal line setInitializing->；

Step A202, takingCalculate->；

Step A203, repeating step A202 untilStopping the calculation, the currently obtained +.>Namely +.>Is a maximum contiguous length of (2);

step SA3, according to the maximum adjacency length of each line in the terminal line set calculated in step A2The method comprises the steps of carrying out a first treatment on the surface of the Comparing all calculated maximum adjacency lengths +.>Taking the maximum contiguous length +.>The end line with the largest value and all lines in the adjacent relation chain form a directed acyclic graph DAG, namely the end line is considered to be the end line which is combined with the original pipe network after pruning>Equivalent result pipe network。

3. The town gas pipe gridding minimum management unit partitioning method of claim 1, wherein: in step S5, the road pruning specifically includes the following steps:

step B1, arbitrarily extracting two lines from the road RCalculate its similarity +.>And calculates the average similarity:

step B2, if the average similarityGreater than threshold requirement->Returning to step B1, replacing the two lines and retrying: if average similarity->Less than or equal to threshold requirement->Removing a shorter line from the road R;

step B3, repeating steps B1 and B2 until the average similarity between all lines in the road R is greater than the threshold requirementAnd (5) pruning the road.

4. The town gas pipe gridding minimum management unit partitioning method of claim 1, wherein: in step N5, the lineAnd line->The similarity calculation between the two is specifically as follows: line->Line->The similarity measure between them is:

wherein ,for measuring space +.>，/>For definition in the metric space->Inner curve, ++>Is a line->，/>Similarity measure between->Is a line->，/>Distance measurement value between->Is a line->，/>A measure of directional consistency between +.>Weight factor for distance measure, +.>，/>Weight factor for the measure of directional consistency, +.>。

5. The town gas pipe gridding minimum management unit partition method of claim 4, wherein: the distance measurement value calculating method specifically comprises the following steps:

wherein ,for parameterizing the free parameters->，/>Respectively->Defined as->Continuous non-subtractive injection of->Lines are respectively->Expression function in original metric space, +.>Is->Along the intersection perpendicular to +.>Two closed connecting lines are respectively arranged in the directions: self->To->From->To->By arranging two closed connecting lines, the closed polygon is ensured to be formed.

6. The town gas pipe gridding minimum management unit partition method of claim 5, wherein: the method for calculating the direction consistency measurement value comprises the following steps:

wherein ,for parameterizing the free parameters->，/>Respectively->Defined as->Continuous non-subtractive injection of->Lines are respectively->The expression function in the original metric space.

7. The town gas pipe gridding minimum management unit partitioning method of claim 1, wherein: the definition of the road is specifically:

a set of wires is provided:

wherein ,；

roadDefined as the set satisfying the following conditions +.>：

For a pair ofAny two lines +.>A set of points->Satisfy->， Is a dot set->Number of elements).

8. The town gas pipe gridding minimum management unit partitioning method of claim 1, wherein: the definition of the pipe network is specifically as follows:

a set of wires is provided:

wherein ,；

pipe networkDefined as an arithmetic system based on a set of simultaneous satisfying the following conditions +.>The method comprises the steps of constructing a special directed acyclic graph DAG, and defining adjacency logic operation on the constructed DAG, wherein the method specifically comprises the following steps of:

step C1, pairAny two lines +.>A set of points->Satisfy->， Is a dot set->The number of elements of (a);

in the step C2, the step of setting the temperature of the liquid,all the line elements in (a) have directionality, and keep the topological logic direction consistent, namely, any two lines in N are provided with:

；

；

somewhat aggregated；

If it isThere should be +.> or ；

Step C3, defining an adjacency logic operation relation on the constructed DAG:

the logical relation operatorIdentifying that there is at most one contiguous edge on any edge on the DAG in a defined direction, wherein +.>Is->Since there will be part of the edge without the next edge, defined herein as empty +.>。