CN111914039A - Road network updating method and device - Google Patents
Road network updating method and device Download PDFInfo
- Publication number
- CN111914039A CN111914039A CN201910374900.5A CN201910374900A CN111914039A CN 111914039 A CN111914039 A CN 111914039A CN 201910374900 A CN201910374900 A CN 201910374900A CN 111914039 A CN111914039 A CN 111914039A
- Authority
- CN
- China
- Prior art keywords
- road
- broken
- road network
- network
- target
- 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.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 68
- 238000012545 processing Methods 0.000 claims description 18
- 238000013507 mapping Methods 0.000 claims description 15
- 238000004590 computer program Methods 0.000 claims description 6
- 230000000694 effects Effects 0.000 claims description 4
- 238000010586 diagram Methods 0.000 description 13
- XLYOFNOQVPJJNP-UHFFFAOYSA-N water Substances O XLYOFNOQVPJJNP-UHFFFAOYSA-N 0.000 description 8
- 238000004458 analytical method Methods 0.000 description 6
- 230000008569 process Effects 0.000 description 6
- 238000010276 construction Methods 0.000 description 4
- 230000006870 function Effects 0.000 description 4
- 238000007405 data analysis Methods 0.000 description 3
- 238000013075 data extraction Methods 0.000 description 3
- 230000014509 gene expression Effects 0.000 description 3
- 230000003287 optical effect Effects 0.000 description 3
- 238000012216 screening Methods 0.000 description 3
- 238000013461 design Methods 0.000 description 2
- 238000011161 development Methods 0.000 description 2
- 238000000605 extraction Methods 0.000 description 2
- 238000005065 mining Methods 0.000 description 2
- 238000002360 preparation method Methods 0.000 description 2
- 238000004364 calculation method Methods 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 238000013500 data storage Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 239000000835 fiber Substances 0.000 description 1
- 230000003993 interaction Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 239000004065 semiconductor Substances 0.000 description 1
- 239000007787 solid Substances 0.000 description 1
- 238000001228 spectrum Methods 0.000 description 1
- 239000000126 substance Substances 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 230000002194 synthesizing effect Effects 0.000 description 1
- 230000000007 visual effect Effects 0.000 description 1
Images
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/29—Geographical information databases
-
- 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
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Databases & Information Systems (AREA)
- Data Mining & Analysis (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Remote Sensing (AREA)
- Traffic Control Systems (AREA)
Abstract
The invention provides a road network updating method and a road network updating device, wherein the method comprises the following steps: determining at least one broken road in a target road network; for each broken road, determining land type information of an area occupied by the broken road when the broken road extends from the break point to a first road in a target road network in a direction parallel to the broken road; determining whether the area occupied by the broken road can be used for building a road or not according to the land type information; and if so, updating the target road network according to the breakpoint and the first road. The road network updating method and device provided by the invention can improve the efficiency of updating the road network.
Description
Technical Field
The invention relates to the technical field of traffic, in particular to a road network updating method and device.
Background
The road network is a road system formed by interconnecting and interlacing various roads in a certain area. Road planners can determine the road distribution condition of a certain region according to the road network in the region, and can further expand and plan the roads in the region on the basis of the road network.
Due to unreasonable road development planning and some historical remaining problems, broken roads often occur in road networks of various regions, particularly cities. In order to connect the broken road into the existing road network, the planner of the road network needs to manually search each broken road in the road network and analyze and compare each broken road one by one according to the different conditions of each broken road, so that the efficiency of updating the road network is low. Therefore, how to more effectively connect the broken road to the road network to improve the efficiency of updating the road network is a technical problem to be solved at present.
Disclosure of Invention
The invention provides a road network updating method and device, which improve the updating efficiency of a road network.
A first aspect of the present invention provides a road network updating method, including:
determining at least one broken road in a target road network;
for each broken road, determining land type information of an area occupied by the broken road when the broken road extends from a break point to a first road in the target road network in a direction parallel to the broken road;
determining whether the area occupied by the broken road can be used for building a road or not according to the land type information;
and if so, updating the target road network according to the breakpoint and the first road.
A second aspect of the present invention provides a road network updating apparatus, including:
the system comprises a determining module, a judging module and a judging module, wherein the determining module is used for determining at least one broken road in a target road network;
the processing module is used for determining land type information of an area occupied by the broken road when the broken road extends to a first road in the target road network from a breaking point in a direction parallel to the broken road;
the processing module is further used for determining whether the area occupied by the broken road can be used for building a road or not according to the land type information;
and if so, the processing module updates the target road network according to the breakpoint and the first road.
A third aspect of the present invention provides an electronic device comprising: a processor and a memory for storing computer instructions; the processor executes the computer instructions to perform the method of any of the first aspects described above.
A fourth aspect of the present invention provides a computer readable storage medium having stored thereon a computer program which, when executed by a processor, performs the method of any of the first aspects described above.
In summary, the present invention provides a method and an apparatus for updating a road network, wherein the method comprises: determining at least one broken road in a target road network; for each broken road, determining land type information of an area occupied by the broken road when the broken road extends from the break point to a first road in a target road network in a direction parallel to the broken road; determining whether the area occupied by the broken road can be used for building a road or not according to the land type information; and if so, updating the target road network according to the breakpoint and the first road. According to the method and the device for updating the road network, the broken road in the target road network is extended, and after the region is determined to be used for building the broken road according to the land type of the region occupied when the broken road is extended to the first road, the road network is updated according to the broken point of the broken road and the extended first road, so that the updating efficiency of the road network is improved.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, and it is obvious that the drawings in the following description are only some embodiments of the present invention, and for those skilled in the art, other drawings can be obtained according to these drawings without creative efforts.
FIG. 1 is a schematic flow chart of a road network updating method according to an embodiment of the present invention;
FIG. 2A is a schematic diagram illustrating an application of the road network updating method of the present invention;
FIG. 2B is a schematic diagram illustrating an application of the road network updating method of the present invention;
FIG. 2C is a schematic diagram illustrating an application of the road network updating method of the present invention;
FIG. 2D is a schematic diagram illustrating an application of the road network updating method of the present invention;
FIG. 3 is a schematic flow chart of a road network updating method according to an embodiment of the present invention;
FIG. 4A is a schematic diagram illustrating an application of the road network updating method of the present invention;
FIG. 4B is a schematic diagram illustrating an application of the road network updating method of the present invention;
FIG. 4C is a schematic diagram illustrating an application of the road network updating method of the present invention;
FIG. 4D is a schematic diagram illustrating an application of the road network updating method of the present invention;
FIG. 5 is a schematic flow chart illustrating a road network updating method according to an embodiment of the present invention;
fig. 6 is a schematic structural diagram of an embodiment of a road network updating apparatus according to the present invention.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
The terms "first," "second," "third," "fourth," and the like in the description and in the claims, as well as in the drawings, if any, are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order. It is to be understood that the data so used is interchangeable under appropriate circumstances such that the embodiments of the invention described herein are, for example, capable of operation in sequences other than those illustrated or otherwise described herein. Furthermore, the terms "comprises," "comprising," and "having," and any variations thereof, are intended to cover a non-exclusive inclusion, such that a process, method, system, article, or apparatus that comprises a list of steps or elements is not necessarily limited to those steps or elements expressly listed, but may include other steps or elements not expressly listed or inherent to such process, method, article, or apparatus.
Fig. 1 is a flow chart of an embodiment of a road network updating method according to the present invention. As shown in fig. 1, the method for updating a road network provided in this embodiment includes:
s101: determining at least one broken road in a target road network;
the execution subject of the method of this embodiment may be any electronic device with related data processing capability, for example: electronic equipment such as cell-phone, panel computer or desktop computer. The embodiment shown in fig. 1 is explained with reference to fig. 2, wherein fig. 2A-2D are schematic views illustrating the application of the road network updating method according to the present invention.
Specifically, the electronic device as the execution subject of the present embodiment first determines at least one broken road in the target road network in S101. The electronic device may first acquire said target road network and then follow the target road network to determine at least one broken road therein.
For example, fig. 2A shows a schematic structural diagram of an acquired target area road network, wherein the target road network 1 may be a road network of a specific area selected by a road planner, such as city a, cell B, or street C, or the target road network 1 may also be a road network of a specific area selected by a road planner on a map. In the target road network 1 as shown in fig. 2A, there are included: the transverse roads D1, D2, D3 and D4 and the longitudinal roads L1, L2 and L3, and the junction of every two roads in the target road network and the end point of each road start are marked with lower case letters, respectively. It should be noted that, in this embodiment, the target road network in fig. 2 is taken as an example only, and an actual target area may include more roads, which is increased in number compared to that in fig. 2, and is not described again.
Optionally, the target road network further includes information such as rank information, function information, and number of lanes of each road in the road network. And the acquired data expression form of the target road network can be a simple line structure or navigation data with a geographic topological structure.
Subsequently, when the target road network is acquired, the electronic device may determine, according to the acquired target road network, N broken roads included in the target road network, where N may be a positive integer whose integer is greater than or equal to 1. For example, in the example shown in fig. 2A, it may be determined that the end point n of the road L3 is a broken road, according to the fact that the end point n on the upper side of the road L3 in the target road network is not communicated with other roads in the target road network. Similarly, the end point f of the road D3 may be determined to be a broken road according to the fact that the end point f on the right side of the road D3 in the target road network is not communicated with other roads in the target road network. Similarly, the number of the broken links in the target road network determined in this step may be one or more, where the number of the broken links refers to two or more, in the embodiment shown in fig. 2, only two broken links D3 and L2 are included in the target road network as an example, and the results of other numbers of broken links in other road networks are only changes in number, and are not described again.
S102: for each broken road obtained in the step S101, determining land type information of an occupied area when the broken road extends from the break point to a first road in a target road network in a direction parallel to the broken road;
subsequently, for each of the broken roads determined in S101, in S102, it is determined that the land type information of the occupied area is when the broken road extends to the first road in the target road network in a direction parallel to the broken road.
Specifically, when determining the area occupied by the broken road accessing the first road in the target road network, the broken road may be determined by adopting a hypothetical connection manner. For example, when the broken road D3 determined in S102 is extended to the right side in a direction parallel to the broken road D3 and the break point f of the broken road D3 is finally connected to the first road L2 as shown in fig. 2B, the extended portion of the broken road D3 occupies a partial region of the region 2 in the target road network and the region occupied in the region 2 is denoted as the region 3.
Optionally, in a specific implementation manner provided in this embodiment S102, when determining an area occupied by the broken road when the broken road extends, the electronic device may extend two road boundaries at the broken point of the broken road. After the two road boundaries are extended to the road boundary of the first road in the direction parallel to the broken road, the two road extension lines are recorded as a first extension line and a second extension line. And then, determining the break point of the broken road, the first extension line, the second extension line and the area between the road boundaries of the first road as the area occupied by the broken road when the broken road is extended. For example, in fig. 2B, the broken point of the broken road D3, the first extended line, the second extended line, and the road boundary of the first road L2 collectively enclose the area 3.
Meanwhile, in S102, it is necessary to further determine land type information of the above-described area 3. Wherein the land type information includes, but is not limited to: cultivated land, garden land, forest land, pasture land, residential site and industrial and mining land, transportation land, water area, unused land and the like. Optionally, the land type information may be determined by obtaining a satellite remote sensing image and by an image recognition method through the satellite remote sensing image, or the target road network includes land type information of each region where the target road network is located.
S103: and determining whether the area occupied by the broken road can be used for building the road according to the land type information determined in the S102.
Specifically, in a specific implementation manner provided in this embodiment S103, the device as the execution subject may store a mapping relation for indicating whether different land type information is available for building a road, and determine whether land type information of an area occupied by a broken road can be used for building the road by querying the mapping relation. Wherein, the mapping relationship comprises: at least one land type information, and whether the at least one land type information is usable for building a correspondence between roads. For example: the cultivated land, the garden land, the forest land, the grassland, the residential site, the industrial and mining land and the transportation land in the land type information correspond to the unavailable land for building the road, and the water area and the unused land in the land type information correspond to the available land for building the road. When the area 3 is an unused area in the embodiment shown in fig. 2B, since the unused area correspondence relationship in the mapping relationship is usable for building a road, it is determined that the end point f of the area 3 usable for the head road D3 is expanded to the road L2 in the target road network to access the target road network. Since the upper side of the end point n of the broken end road L2 in fig. 2A is an artificial lake and the corresponding relationship of the artificial lake in the mapping relationship is an irreparable road, it is determined that the area occupied by the upper side of the broken end road L2 when extended is an irreparable road.
S104: and if the area occupied by the broken road can be used for building the road in the step S103, updating the target road network according to the break point of the broken road and the first road.
Finally, in S104, if it is determined through the above steps that the broken road extends to the area occupied by the first road and can be used for building a road, the target road network is updated according to the broken road. Specifically, the broken road is extended from its breaking point in parallel to the broken road direction in S104, thereby connecting the broken road to the first road from its breaking point. For example, fig. 2C shows an updated target road network obtained after the head broken road D3 determined in S103 in the above embodiment is connected to the target road network in fig. 2A. Wherein, the updated target road network in fig. 2C includes: the method has the advantages that the transverse roads D1, D2, D3 and D4 and the longitudinal roads L1 and L2 are connected, end points e and i on two sides of the road D3 are connected with other roads, communication of the original broken road D3 is achieved, expansion of the broken road of the target road network is achieved, and the target road network is updated according to the expanded broken road.
In summary, in the road network updating method provided in this embodiment, after at least one broken road in the target road network is determined, for each broken road, when the broken road extends to the first road in the target road network, the land type information of the occupied area determines whether the occupied area can be used for building a road, and after it is determined that the area can be used for building a road, the target road network is updated according to the broken point and the first road. Therefore, when the target area includes more broken roads, compared with the manual one-by-one comparison and analysis mode in the prior art, the road network updating method provided by the embodiment can greatly improve the efficiency of accessing the broken roads into the road network to update the road network, so that the degree of automation and intelligence of the process of extracting the broken roads and updating the road network based on the broken roads is improved. And road planning personnel are matched to increase the accessibility and the road network density of the target road network, so that the traffic pressure of the target area is relieved.
Further, fig. 3 is a flow chart illustrating an embodiment of the road network updating method of the present invention. The method shown in fig. 3 further includes, on the basis of the embodiment in fig. 1:
s105: acquiring first road network traffic information before updating of a target road network and second road network traffic information after updating of the target road network;
s106: generating comparison data of the first road network traffic information and the second road network traffic information;
s107: displaying the comparison data determined in S106, wherein the displayed comparison data is used for identifying the update effect of the target road network.
Specifically, in the above embodiment, after the electronic device serving as the execution subject of the target road network update updates the target road network through S104, the electronic device may also compare the road network traffic information before and after the target road network update to provide reference opinions for the road planner. Specifically, in S105, first road network traffic information before updating the road network and second road network traffic information after updating the road network are respectively calculated, in S106, specific quantized comparison data of the first road network traffic information and the second road network traffic information are generated, and then in S107, the quantized comparison data can be displayed to a road planner through an interaction device such as a sound box, a display screen, and the like, so that the road planner can obtain an updating effect of the target road network through the comparison data.
Alternatively, in this embodiment, the description of the road network may be quantified by one or more of the following road network traffic information, where the target road network is denoted as the first road network, and the updated target road network is denoted as the second road network. The road network traffic information comprises:
road network density refers to the ratio of the total length of all roads in the target area to the total area of the area. For example, if the length of the road in the first road network shown in fig. 2A is 5 kilometers, and the area of the target area is 2 square kilometers, the road network density of the first road network is 2.5; in fig. 2C, the road network density of the second road network is 2.55 when the length of the road in the second road network is 5.1 km and the area of the target area is 2 km squared.
The road network accessibility refers to the distance of the shortest path from one point to all other vertexes in the road network of the target area, so that the higher the index is, the longer the access distance of the place is, and the poorer the accessibility is.
Road network road characteristics refer to the sum of the technical grades of the lines in the target area and their main technical performance. Including vehicle speed (km/h), design traffic capacity (vehicle/d), road width (m) and terrain type, are technical parameters for road network system analysis, and are stored in a set of matrices (including rank, vehicle speed, distance, time, capacity, etc.).
The road network layout refers to a line structure view presented by a road network. For example, fig. 2A shows a layout of a first road network and fig. 2C shows a layout of a second road network, the target areas 1 of fig. 2A and 2C may together be presented on a display device, such as a display, to present the road planner with a difference between the layout of the first road network and the layout of the second road network.
Optionally, in the above embodiment, in addition to presenting the layout of the first road network and the layout of the second road network as shown in fig. 2A and fig. 2C, a schematic access manner diagram for accessing the determined M broken roads into the first road network through S104 may be presented to the road planner as shown in fig. 2D. For example, fig. 2D shows an end point f of the broken road D3 extending toward the road L2 to access the first road network by using an arrow 4, which is a specific extension line.
As further shown in fig. 3, optionally, the method shown in fig. 3 further includes, on the basis of the embodiment in fig. 1:
s108: and determining the cost required for extending the broken road to the first road according to the land type information and the economic level information of the region where the target road network is located. And presents the calculated costs to the road planner via a display device, such as a display. Optionally, this embodiment provides a more specific implementation manner of S107, including: acquiring economic level information of a target area and land type information of an area required to be occupied by accessing a broken road into a first road; and calculating the cost required for accessing the broken road into the first road according to the economic level information of the target area and the land type information of the area required for accessing the broken road into the first road network.
Specifically, in the above embodiment, when the target road network is updated in S104, it is necessary to expand the end point f of the broken road D3 to the road L2 in the target road network by implementing the region 3. Therefore, the cost required to be calculated in this embodiment can be understood as the cost for constructing the road in the area 3 of fig. 2B. This cost requires consideration of economic level information for the target zone and land type information for zone 3, where land type information refers to categories into which the land is classified by similarity and difference of its natural attributes. In this embodiment, a mapping relationship between different land type information and corresponding road construction cost may be established according to the economic level information of the region where the target road network is located. For example, if the cost of building a road in an unused area in a town where the target road network is located is 10 ten thousand yuan/m, and the cost of building a road by bridging a water area is 20 ten thousand yuan/m, the mapping relationship is as follows: "unused land-10" and "waters-20". In S108, if the land type of the area 3 to be used for the expansion of the end point f of the cut-off road D3 to the road L2 in the target road network is determined as a water area, the cost of constructing roads corresponding to the water area is determined to be 20 ten thousand yuan/meter from the mapping relationship. The total cost required to extend the end point f of the broken road D3 to the road L2 in the target road network in the area 3 by 50 meters can be calculated from the determined mapping relationship to be 1000 ten thousand dollars, and the calculated total cost can be presented to the road planner. Further, if the land type information is a wasteland but there is a building such as a house, it is necessary to add the cost of removal and replacement of the building in the area to the calculation.
In summary, in the embodiment shown in fig. 3, the electronic device as the execution subject of this embodiment can determine the cost required for accessing the determined road segment to the target road network according to the different traffic information of the updated second road network and the original target road network, and presenting the quantized comparison data and the required cost to a road planner so that the road planner can comprehensively judge whether the broken road in the target area extends or not according to the plurality of items of information, the broken road is not needed to be compared one by the road planning personnel, whether the broken road can be extended or not is determined, the working time of the road planning personnel can be greatly saved, and the efficiency of expanding the broken road into the road network and the automation and the intelligent degree of the updating process of the road network are further improved.
Further optionally, in each of the foregoing embodiments, the determining, in S101, a broken road in the target road network may include: determining that a first road is a broken road, wherein the first road is a first-grade road which is connected to a second-grade road in a first road network, the first road is not connected to any other first-grade road which is connected to the second-grade road in the first road network, and the first grade is smaller than the second grade; and/or determining that the second road is a broken road, wherein the end point of the road route of the second road only appears in the first road network; and/or determining a third road as a broken road, wherein the third road is a road which has the same road name and the same grade and is not connected in the first road network; and/or determining that the fourth road is a broken road, wherein other roads which have different road names, different grades and are not connected exist at the end point of the road route of the fourth road in the preset range of the first road network.
Fig. 4A-4D are schematic diagrams illustrating application of the road network updating method of the present invention, and specific methods for determining broken roads in the above embodiments are described below with fig. 4A-4C as examples.
For the first road, as shown in fig. 4A, when the road L1 in the first road network is a primary road, the other roads are secondary roads. On the other hand, the road D3 is not connected to any other secondary road except the road L1, that is, the road D3 is only connected to the road at the first level, and the road D3 is determined to be a broken road.
For the second road, fig. 4A shows the road lines of all the roads in the first road network, the road lines are the intersecting line segments shown in the figure, the intersections are marked with lower case letters, and since the end point f of the road D3 and the end point n of the road L3 both only appear in the first road network, the road D3 and the road L3 are determined to be head broken roads. The end point here is an end point of the road route, and may also be a start point and/or an end point of the road. While the endpoints of other roads in fig. 4A repeat, e.g., endpoint a of D1 and endpoint a of L1 repeat, then D1 and L1 are not broken roads.
For the third road, as shown in fig. 4B, if the road D3 and the road D5 have the same road name, for example, both called "M major road", the grades of the roads are the same, and there is no connection between D3 and D5 without a connection relation, in the first road network, and if these three conditions are satisfied, it is said that the roads D3 and D5 are broken roads.
For the fourth road, as shown in fig. 4C, in the first road network, if there are other roads having different road names, different grades and unconnected roads, for example, the road L2 existing in the range of 500 meters of D3, within the preset range of the end point f of the road D3, if there is no connection relationship between D3 and L2, it is determined that the road D3 at the lower grade is a broken road.
Further alternatively, the judgment for the broken road should not participate in the judgment for the road inside the area. For example, as shown in fig. 4D, the area 2 is a park, and a path 5 in the park of the area 2 is a road inside the park. Although the road D3 and the road L2 can be connected by the minor road 5, since it is an interior road, it is not considered when determining a broken road even if the minor road 5 is included in the first road network.
It should be noted that the first road, the second road, the third road and the fourth road are only used for explaining a basis for judging the broken road, and in the actual judgment process, the four roads may be used as a basis for judging the broken road at the same time, or any one of the four roads, or any plurality of the four roads may be used as a basis. And each of the first road, the second road, the third road and the fourth road may refer to a plurality of roads, and the superposition of the number is not repeated.
Fig. 5 is a flow chart illustrating an embodiment of a road network updating method according to the present invention. In the embodiment shown in fig. 5, a flow chart of the method combining the embodiments of fig. 1 and fig. 3 is shown, and the method shown in fig. 5 sequentially includes: the method comprises the steps of data preparation, data analysis, model building, data extraction, road extension analysis, data screening, secondary data analysis and construction cost estimation.
Wherein, the data preparation: the method needs to prepare the current urban road network (containing basic information such as road grade, function grade, number of lanes and the like), and the road network data expression form can be a simple line structure or navigation data with a geographic topological structure. And (3) data analysis: analyzing urban road network conditions: and calculating the urban road network density and road network accessibility, and using the urban road network density and road network accessibility to know the current urban road network situation and extract broken roads for comparing the urban road network situation after road network expansion. Building a model: the method comprises the following steps of 1, extracting road networks attached to a higher-level road according to the road grade and judging whether the road networks are communicated or not; principle 2, extracting a broken road (the broken road can be extracted by a method of extracting a dead road by using a GIS tool or extracting a link (road route) in a topological structure in a single-point hanging manner), recording the initial point ID of each link in an attribute table, wherein the initial point is unique and can be judged as a link in a single-point hanging manner without repetition; principle 3, same-name and same-level road discontinuity (same-name and same-level road discontinuity in space, no topological connection relation, physical disconnection); principle 4, roads with different names and the same level within the road blind end 500m range (buffer analysis, taking the road blind end as the center, performing buffer analysis within the 500m range, and whether roads with different names and the same level exist within the 500m range) principle 5, regional internal road network and fragmented road network do not participate in road network connectivity. Data extraction: data extraction (implemented in Geographic Information System (GIS) software) is performed according to the above principles. And (3) road extension analysis: and extracting the land type by using the remote sensing image according to the extraction result (the existing technology carries out visual interpretation or unsupervised classification according to the difference of the reflection wave bands of different land features on the spectrum), and checking the realizability of extracting the broken road by combining the two results (according to the current situation of urban planning land utilization, if the broken road to be communicated passes through education and industrial sites such as buildings, large water areas and the like, military government sites and the like, the broken road to be communicated is not listed into a communicated object). And (3) screening data: and (4) removing roads which do not meet the requirements according to the result obtained in the previous step, reserving road networks which meet the requirements, and screening data (crossing buildings or large water areas, education and industrial land, military government land and the like need to be removed in the previous step). And (3) cost estimation: according to the extraction result, the cost of the road network can be estimated and planned to be expanded by combining the local economic level and the land utilization type of the planned road network, and a basis is provided for decision making; different types of roads have different construction costs, such as bridges need to be erected when crossing water systems, the cost is higher when the roads grow, the cost is increased when some road construction designs are removed and compensated, and the like, the cost is increased, and the conditions that the traffic pressure of local road sections is relieved by planning and evaluating urban development land and newly adding roads according to the financial income level of each city, and the open-cut expansion of the head road is carried out by synthesizing multiple indexes.
Fig. 6 is a schematic structural diagram of an embodiment of a road network updating apparatus according to the present invention. As shown in fig. 6, the road network updating apparatus provided in this embodiment includes: a determination module 601 and a processing module 602. The determining module 601 is configured to determine at least one broken road in the target road network; the processing module 602 is configured to determine, for each broken road, land type information of an area occupied by the broken road when the broken road extends from the break point to a first road in the target road network in a direction parallel to the broken road; the processing module 602 is further configured to determine whether an area occupied by the broken road can be used for building a road according to the land type information; if yes, the processing module 602 is further configured to update the target road network according to the breakpoint and the first road.
The road network updating device provided in this embodiment may be used to execute the road network updating method shown in fig. 1, and the specific implementation manner and principle thereof are the same, so that the details are not described herein again.
Optionally, in the foregoing embodiment, the processing module 602 is specifically configured to determine, according to the land type information, whether an area occupied by a broken road can be used for building a road by querying a mapping relationship; wherein, the mapping relation comprises: at least one land type information and whether the at least one land type information can be used for building the corresponding relationship between the roads.
Optionally, in the foregoing embodiment, the processing module 602 is specifically configured to extend two road boundaries at the end-cut break point to a road boundary of the first road in a direction parallel to the end-cut, so as to obtain a first extension line and a second extension line of the end-cut;
and determining the land type information of an area surrounded by the breakpoint, the first extension line, the second extension line and the road boundary of the first road.
Optionally, in the above embodiment, the apparatus further comprises: a display module 603; wherein the content of the first and second substances,
the processing module 602 is further configured to obtain first road network traffic information before the target road network is updated and second road network traffic information after the target road network is updated;
the processing module 602 is further configured to generate comparison data of the first road network traffic information and the second road network traffic information;
the display module 603 is configured to display the comparison data, where the comparison data is used to indicate an update effect of the target road network.
Optionally, in the above embodiment, the processing module 602 is further configured to determine, according to the land type information and the economic level information of the region where the target road network is located, a cost required for extending the broken road in the first direction through the first region to the first road.
Optionally, in the foregoing embodiment, the determining module 601 is specifically configured to determine that the first road is a broken road, where the first road is a first-level road that is connected to a second-level road in the first road network, the first road is not connected to any other first-level road that is connected to the second-level road in the first road network, and the first level is smaller than the second level; and/or determining that the second road is a broken road, wherein the end point of the road route of the second road only appears in the first road network; and/or determining a third road as a broken road, wherein the third road is a road which has the same road name and the same grade and is not connected in the first road network; and/or determining that the fourth road is a broken road, wherein other roads which have different road names, different grades and are not connected exist at the end point of the road route of the fourth road in the preset range of the first road network.
The road network updating device provided in this embodiment may be used to execute the road network updating method shown in the foregoing embodiments, and the specific implementation manner and principle thereof are the same, so that the details are not described herein again.
It should be noted that, in the embodiment of the present application, the division of the module is schematic, and is only one logic function division, and there may be another division manner in actual implementation. Each functional module in the embodiments of the present application may be integrated into one processing module, or each module may exist alone physically, or two or more modules are integrated into one module. The integrated module can be realized in a hardware mode, and can also be realized in a software functional module mode.
The integrated module, if implemented in the form of a software functional module and sold or used as a stand-alone product, may be stored in a computer readable storage medium. Based on such understanding, the technical solution of the present application may be substantially implemented or contributed by the prior art, or all or part of the technical solution may be embodied in a software product, which is stored in a storage medium and includes instructions for causing a computer device (which may be a personal computer, a server, a network device, or the like) or a processor (processor) to execute all or part of the steps of the method according to the embodiments of the present application. And the aforementioned storage medium includes: various media capable of storing program codes, such as a usb disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk, or an optical disk.
In the above embodiments, the implementation may be wholly or partially realized by software, hardware, firmware, or any combination thereof. When implemented in software, may be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer instructions. When loaded and executed on a computer, cause the processes or functions described in accordance with the embodiments of the application to occur, in whole or in part. The computer may be a general purpose computer, a special purpose computer, a network of computers, or other programmable device. The computer instructions may be stored in a computer readable storage medium or transmitted from one computer readable storage medium to another, for example, from one website site, computer, server, or data center to another website site, computer, server, or data center via wired (e.g., coaxial cable, fiber optic, Digital Subscriber Line (DSL)) or wireless (e.g., infrared, wireless, microwave, etc.). The computer-readable storage medium can be any available medium that can be accessed by a computer or a data storage device, such as a server, a data center, etc., that incorporates one or more of the available media. The usable medium may be a magnetic medium (e.g., floppy Disk, hard Disk, magnetic tape), an optical medium (e.g., DVD), or a semiconductor medium (e.g., Solid State Disk (SSD)), among others.
The invention also proposes an electronic device readable storage medium comprising a program which, when run on an electronic device, causes the electronic device to perform the method for updating a road network according to any of the embodiments described above.
An embodiment of the present invention further provides an electronic device, including: a processor; and a memory for storing executable instructions for the processor; wherein the processor is configured to perform the road network updating method of any of the above embodiments via execution of executable instructions.
An embodiment of the present invention further provides a program product, including: a computer program (i.e., executing instructions) stored in a readable storage medium. The computer program may be read from a readable storage medium by at least one processor of the encoding device, the execution of which by the at least one processor causes the encoding device to implement the road network updating method as provided by the various embodiments described above.
Those of ordinary skill in the art will understand that: all or a portion of the steps of implementing the above-described method embodiments may be performed by hardware associated with program instructions. The program may be stored in a computer-readable storage medium. When executed, the program performs steps comprising the method embodiments described above; and the aforementioned storage medium includes: various media that can store program codes, such as ROM, RAM, magnetic or optical disks.
In addition, in the present application, "at least one" means one or more, "a plurality" means two or more. "and/or" describes the association relationship of the associated objects, meaning that there may be three relationships, e.g., a and/or B, which may mean: a exists alone, A and B exist simultaneously, and B exists alone, wherein A and B can be singular or plural. The character "/" generally indicates that the former and latter associated objects are in an "or" relationship. "at least one of the following" or similar expressions refer to any combination of these items, including any combination of the singular or plural items. For example, at least one (one) of a, b, or c, may represent: a, b, c, a-b, a-c, b-c, or a-b-c, wherein a, b, c may be single or multiple.
Finally, it should be noted that: the above embodiments are only used to illustrate the technical solution of the present invention, and not to limit the same; while the invention has been described in detail and with reference to the foregoing embodiments, it will be understood by those skilled in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some or all of the technical features may be equivalently replaced; and the modifications or the substitutions do not make the essence of the corresponding technical solutions depart from the scope of the technical solutions of the embodiments of the present invention.
Claims (10)
1. A road network updating method is characterized by comprising the following steps:
determining at least one broken road in a target road network;
for each broken road, determining land type information of an area occupied by the broken road when the broken road extends from a break point to a first road in the target road network in a direction parallel to the broken road;
determining whether the area occupied by the broken road can be used for building a road or not according to the land type information;
and if so, updating the target road network according to the breakpoint and the first road.
2. The method according to claim 1, wherein the determining whether the area occupied by the broken road can be used for building a road according to the land type information comprises:
determining whether the area occupied by the broken road can be used for building a road or not by inquiring a mapping relation according to the land type information; wherein the mapping relationship comprises: at least one land type information, and whether the at least one land type information can be used for building the corresponding relationship between the roads.
3. The method according to claim 1, wherein the determining the land type information of the area occupied by the broken road when the broken road extends from the breaking point to the first road in the target road network in a direction parallel to the broken road comprises:
extending two road boundaries at the broken end point of the broken end path to the road boundary of the first road in a direction parallel to the broken end path to obtain a first extension line and a second extension line of the broken end path;
and determining land type information of an area surrounded by the breakpoint, the first extension line, the second extension line and the road boundary of the first road.
4. The method of claim 1, further comprising:
acquiring first road network traffic information before the target road network is updated and second road network traffic information after the target road network is updated;
generating comparison data of the first road network traffic information and the second road network traffic information;
and displaying the comparison data, wherein the comparison data is used for representing the updating effect of the target road network.
5. The method of claim 1, further comprising:
and determining the cost required for extending the broken road to the first road according to the land type information and the economic level information of the region where the target road network is located.
6. The method according to any of the claims 1-5, wherein said determining broken roads in a target road network comprises:
taking the road meeting the judgment condition in the target road network as the broken road; wherein the judgment condition at least comprises one or more of the following conditions:
the broken road is a first road in the target road network, wherein the first road is a first-grade road which is connected to a second-grade road in the first road network, the first road is not connected to any other first-grade road which is connected to the second-grade road in the first road network, and the first grade is smaller than the second grade;
the broken road is a second road in the target road network, wherein an end point of a road route of the second road only appears in the first road network;
the broken road is a third road in the target road network, wherein the third road is a road which has the same road name and the same grade and is not connected in the first road network;
the broken road is a fourth road in the target road network, wherein other roads which have different road names, different grades and are not connected exist at the end point of the road route of the fourth road in the preset range of the first road network.
7. A road network updating apparatus, comprising:
the system comprises a determining module, a judging module and a judging module, wherein the determining module is used for determining at least one broken road in a target road network;
the processing module is used for determining land type information of an area occupied by the broken road when the broken road extends to a first road in the target road network from a breaking point in a direction parallel to the broken road;
the processing module is further used for determining whether the area occupied by the broken road can be used for building a road or not according to the land type information;
and if so, the processing module updates the target road network according to the breakpoint and the first road.
8. The apparatus of claim 7, wherein the processing module is specifically configured to,
determining whether the area occupied by the broken road can be used for building a road or not by inquiring a mapping relation according to the land type information; wherein the mapping relationship comprises: at least one land type information, and whether the at least one land type information can be used for building the corresponding relationship between the roads.
9. An electronic device, comprising: a processor and a memory for storing computer instructions; the processor executes the computer instructions to perform the method of any of claims 1-7.
10. A computer-readable storage medium, on which a computer program is stored, which, when being executed by a processor, carries out the method of any one of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910374900.5A CN111914039B (en) | 2019-05-07 | 2019-05-07 | Road network updating method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910374900.5A CN111914039B (en) | 2019-05-07 | 2019-05-07 | Road network updating method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111914039A true CN111914039A (en) | 2020-11-10 |
| CN111914039B CN111914039B (en) | 2024-03-01 |
Family
ID=73242601
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910374900.5A Active CN111914039B (en) | 2019-05-07 | 2019-05-07 | Road network updating method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111914039B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113643242A (en) * | 2021-07-21 | 2021-11-12 | 东南大学 | Remote sensing data-based broken road positioning and importance grading method |
Citations (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101937458A (en) * | 2010-08-31 | 2011-01-05 | 北京世纪高通科技有限公司 | Simple map generation and release method and device based on traffic information |
| US20110191285A1 (en) * | 2010-01-29 | 2011-08-04 | Aisin Aw Co., Ltd. | Map update data supply device and method |
| CN102809384A (en) * | 2012-08-22 | 2012-12-05 | 北京世纪高通科技有限公司 | Road link extraction method and device |
| EP2647763A1 (en) * | 2012-04-04 | 2013-10-09 | Bornit-Werk Aschenborn GmbH | Joint strip for introducing in connecting or repairing joints in the upper region of a street covering |
| CN103606266A (en) * | 2013-06-28 | 2014-02-26 | 长沙理工大学 | Road network traffic improvement scheme efficiency assessment method based on data envelopment analysis |
| CN105893577A (en) * | 2016-04-01 | 2016-08-24 | 腾讯科技（深圳）有限公司 | Road network data processing method and apparatus |
| WO2018103363A1 (en) * | 2016-12-07 | 2018-06-14 | 北京三快在线科技有限公司 | Road determination method and device |
| CN108335007A (en) * | 2017-10-31 | 2018-07-27 | 上海市政工程设计研究总院（集团）有限公司 | A kind of computation model and its computational methods of urban land redevelopment intensity |
| CN108871354A (en) * | 2017-05-11 | 2018-11-23 | 腾讯科技（深圳）有限公司 | Road information processing method and processing system |
| CN109215372A (en) * | 2018-10-15 | 2019-01-15 | 百度在线网络技术（北京）有限公司 | Road network information update method, device and equipment |
| CN109405840A (en) * | 2017-08-18 | 2019-03-01 | 中兴通讯股份有限公司 | Map data updating method, server and computer readable storage medium |
-
2019
- 2019-05-07 CN CN201910374900.5A patent/CN111914039B/en active Active
Patent Citations (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20110191285A1 (en) * | 2010-01-29 | 2011-08-04 | Aisin Aw Co., Ltd. | Map update data supply device and method |
| CN101937458A (en) * | 2010-08-31 | 2011-01-05 | 北京世纪高通科技有限公司 | Simple map generation and release method and device based on traffic information |
| EP2647763A1 (en) * | 2012-04-04 | 2013-10-09 | Bornit-Werk Aschenborn GmbH | Joint strip for introducing in connecting or repairing joints in the upper region of a street covering |
| CN102809384A (en) * | 2012-08-22 | 2012-12-05 | 北京世纪高通科技有限公司 | Road link extraction method and device |
| CN103606266A (en) * | 2013-06-28 | 2014-02-26 | 长沙理工大学 | Road network traffic improvement scheme efficiency assessment method based on data envelopment analysis |
| CN105893577A (en) * | 2016-04-01 | 2016-08-24 | 腾讯科技（深圳）有限公司 | Road network data processing method and apparatus |
| WO2018103363A1 (en) * | 2016-12-07 | 2018-06-14 | 北京三快在线科技有限公司 | Road determination method and device |
| CN108871354A (en) * | 2017-05-11 | 2018-11-23 | 腾讯科技（深圳）有限公司 | Road information processing method and processing system |
| CN109405840A (en) * | 2017-08-18 | 2019-03-01 | 中兴通讯股份有限公司 | Map data updating method, server and computer readable storage medium |
| CN108335007A (en) * | 2017-10-31 | 2018-07-27 | 上海市政工程设计研究总院（集团）有限公司 | A kind of computation model and its computational methods of urban land redevelopment intensity |
| CN109215372A (en) * | 2018-10-15 | 2019-01-15 | 百度在线网络技术（北京）有限公司 | Road network information update method, device and equipment |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113643242A (en) * | 2021-07-21 | 2021-11-12 | 东南大学 | Remote sensing data-based broken road positioning and importance grading method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111914039B (en) | 2024-03-01 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Jiao et al. | Proximity Expansion Index: An improved approach to characterize evolution process of urban expansion | |
| CN103996089B (en) | Based on the transmission line of electricity optimal path generation method of GIS | |
| US20190301963A1 (en) | Processing data for predicting pipe failure | |
| Wilson et al. | Development of a geospatial model to quantify, describe and map urban growth | |
| JP4917764B2 (en) | MAP INFORMATION CREATION DEVICE, MAP INFORMATION CREATION METHOD, AND PROGRAM | |
| Alvioli et al. | Rockfall susceptibility and network-ranked susceptibility along the Italian railway | |
| CN106022518A (en) | Pipe damage probability prediction method based on BP neural network | |
| CN107704531B (en) | Automatic merging method for road network intersection nodes in OSM map data | |
| US20100306372A1 (en) | System and method for analyzing the structure of logical networks | |
| CN109859480B (en) | Congestion road section modeling and evaluating method based on complex network | |
| Tucci et al. | Using spatial analysis and geovisualization to reveal urban changes: Milan, Italy, 1737–2005 | |
| CN109360421A (en) | A kind of traffic information predicting method and device, electric terminal based on machine learning | |
| Giannopoulou et al. | Traffic network and the urban environment: an adapted space syntax approach | |
| Basaraner et al. | A structure recognition technique in contextual generalisation of buildings and built-up areas | |
| CN111914039A (en) | Road network updating method and device | |
| CN109461303A (en) | A kind of traffic congestion state acquisition methods and device | |
| KR20160132232A (en) | Landslide gis database and method for management | |
| Said et al. | Differences of sreet connectivity between old and new Zone in Malaysian small town | |
| CN115309846B (en) | Road network structure identification method based on parallel coefficients | |
| CN116129648A (en) | Road network congestion key node identification method, equipment and medium | |
| CN115830255A (en) | Simulation scene generation method and device, electronic equipment and storage medium | |
| CN103246650A (en) | Road logic model and manufacture method thereof | |
| CN111369102B (en) | Method and device for extracting waterlogging risk points | |
| Nas et al. | Analysis of Distribution Patterns in Mapping Cirebon Internet Service Facilities Using NNA Algorithm Based on Geographic Information Systems | |
| Demir et al. | GIS-based procedural modeling in contemporary urban planning practice |
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 |