CN111914039B - Road network updating method and device - Google Patents
Road network updating method and device Download PDFInfo
- Publication number
- CN111914039B CN111914039B CN201910374900.5A CN201910374900A CN111914039B CN 111914039 B CN111914039 B CN 111914039B CN 201910374900 A CN201910374900 A CN 201910374900A CN 111914039 B CN111914039 B CN 111914039B
- 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.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 65
- 238000012545 processing Methods 0.000 claims description 19
- 238000013507 mapping Methods 0.000 claims description 15
- 238000004590 computer program Methods 0.000 claims description 7
- 230000000694 effects Effects 0.000 claims description 4
- 238000010586 diagram Methods 0.000 description 12
- 238000010276 construction Methods 0.000 description 9
- XLYOFNOQVPJJNP-UHFFFAOYSA-N water Substances O XLYOFNOQVPJJNP-UHFFFAOYSA-N 0.000 description 7
- 238000004458 analytical method Methods 0.000 description 6
- 238000007405 data analysis Methods 0.000 description 3
- 238000013075 data extraction Methods 0.000 description 3
- 230000006870 function 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
- 238000002360 preparation method Methods 0.000 description 2
- 210000003719 b-lymphocyte Anatomy 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 238000013500 data storage Methods 0.000 description 1
- 230000001419 dependent effect Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000011156 evaluation Methods 0.000 description 1
- 238000000605 extraction Methods 0.000 description 1
- 230000010354 integration Effects 0.000 description 1
- 230000002452 interceptive effect Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 239000013307 optical fiber Substances 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
- 238000006467 substitution reaction Methods 0.000 description 1
- 230000000007 visual effect Effects 0.000 description 1
- 239000003643 water by type Substances 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/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 device, wherein the method comprises the following steps: determining at least one broken road in a target road network; determining land type information of an area occupied by each 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 aiming at each broken road; determining whether the area occupied by the broken road can be used for constructing the road according to the land type information; if yes, 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 updating efficiency of 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
Road network refers to a road system which is formed by connecting various roads mutually and interweaving the roads into a net-shaped distribution in a certain area. Road planners can determine the road distribution condition of a certain area according to a road network in the area, and can further expand and plan the roads of the area on the basis of the road network.
Due to unreasonable road development planning and some historical carryover problems, broken roads often occur in various areas, especially in urban road networks. In order to connect the broken road into the existing road network, the planner of the road network needs to search each broken road in the road network in a manual mode and analyze and compare the different conditions of each broken road one by one no matter whether one or a plurality of broken roads exist in the road network, so that the updating efficiency of the road network is lower due to the manual processing mode. Therefore, how to more effectively connect the broken road into the road network to improve the efficiency of updating the road network is a technical problem to be solved.
Disclosure of Invention
The invention provides a road network updating method and device, which improve the updating efficiency of the road network.
The first aspect of the present invention provides a road network updating method, including:
determining at least one broken road in a target road network;
determining land type information of an area occupied by each 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 aiming at each broken road;
determining whether the area occupied by the broken road can be used for constructing a road or not according to the land type information;
if yes, 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, comprising:
the determining module is used for determining at least one broken road in the 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 from the broken road to a first road in the target road network in a direction parallel to the broken road;
the processing module is also used for determining whether the area occupied by the broken road can be used for constructing the road according to the land type information;
if yes, 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 apparatus, comprising: a processor and a memory for storing computer instructions; the processor executing the computer instructions to perform the method of any of the first aspects above.
A fourth aspect of the invention provides a computer-readable storage medium having stored thereon a computer program which, when executed by a processor, implements the method of any of the first aspects above.
In summary, the invention provides a road network updating method and device, wherein the method comprises the following steps: determining at least one broken road in a target road network; determining land type information of an area occupied by each 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 aiming at each broken road; determining whether the area occupied by the broken road can be used for constructing the road according to the land type information; if yes, updating the target road network according to the breakpoint and the first road. According to the road network updating method and device, the broken road in the target road network is extended, after the area is determined to be used for building the broken road according to the land type of the area occupied when the broken road extends to the first road, the road network is updated according to the break point of the broken road and the first road extending to, and therefore updating efficiency of the road network is improved.
Drawings
In order to more clearly illustrate the embodiments of the invention or the technical solutions of the prior art, the drawings which are used in the description of the embodiments or the prior art will be briefly described, it being obvious that the drawings in the description below are only some embodiments of the invention, and that other drawings can be obtained according to these drawings without inventive faculty for a person skilled in the art.
FIG. 1 is a flowchart of an embodiment of a road network updating method according to 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 flowchart illustrating an embodiment of a road network updating method according to 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 flowchart of an embodiment of a road network updating method according to the present invention;
fig. 6 is a schematic structural diagram of an embodiment of the road network updating device of the present invention.
Detailed Description
The following description of the embodiments of the present invention 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 invention, but not all embodiments. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to be within the scope of the invention.
The terms "first," "second," "third," "fourth" and the like in the description and in the claims and in the above drawings, if any, are used for distinguishing between similar objects and not necessarily for describing a particular sequential or chronological order. It is to be understood that the data so used may be interchanged where appropriate such that the embodiments of the invention described herein may be implemented, for example, 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 flowchart of an embodiment of a road network updating method according to the present invention. As shown in fig. 1, the road network updating method 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 devices such as mobile phones, tablet computers or desktop computers. The embodiment shown in fig. 1 is described below with reference to fig. 2, wherein fig. 2A to fig. 2D are schematic application diagrams of the road network updating method according to the present invention.
Specifically, the electronic apparatus 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 the target road network and then follow the target road network to determine at least one break therein.
For example, fig. 2A shows a schematic diagram of an acquired target area road network, where the target road network 1 may be a road network of a specific area selected by a road planner, such as an a city, a B cell, or a C street, or the target road network 1 may be a road network of a specific area selected by the road planner on a map. In the target road network 1 as shown in fig. 2A, there are included: the lateral roads D1, D2, D3 and D4 and the longitudinal roads L1, L2 and L3 are marked with lowercase letters at the junction of each two roads and the end point of the start of each road, respectively, in the target road network. It should be noted that, in the embodiment, the target road network in fig. 2 is merely taken as an example, and the actual target area may include more roads, which is only an increase in number compared with fig. 2, and will not be described again.
Optionally, the target road network further includes information such as grade information, function information, and lane number 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.
Then, when the target road network is acquired, the electronic device may determine N broken roads included in the target road network according to the acquired target road network, where N may be a positive integer equal to or greater than 1. For example, in the example shown in fig. 2A, it may be determined that the direction of the end point n of the road L3 is the broken road according to the fact that the end point n of the upper side of the road L3 in the target road network is not in communication with other roads in the target road network. Likewise, the direction of the end point f of the road D3 may be determined as a broken road based on the end point f on the right side of the road D3 in the target road network not communicating with other roads in the target road network. Likewise, the number of broken ends in the target road network determined in this step may be one or more, where multiple refers to two or more, and in the embodiment shown in fig. 2, only two broken ends including D3 and L2 in the target road network are taken as an example, and the results of other number of broken ends in other road networks are only a number of changes, which are not repeated.
S102: determining land type information of an occupied area when the broken road extends from the broken road to a first road in the target road network in a direction parallel to the broken road aiming at each broken road acquired in the step S101;
subsequently, for each broken road determined in S101, in S102, land type information of the occupied area when the broken road extends to the first road in the target road network in a direction parallel to the broken road is determined.
Specifically, when determining the area occupied by the broken road when accessing the first road in the target road network, the method can be determined by adopting a mode of assuming connection. For example, when the broken road D3 determined in S102 is extended rightward in a direction parallel to the broken road D3 as shown in fig. 2B, and finally the break point f of the broken road D3 is connected to the first road L2, the extended portion of the broken road D3 occupies a partial area of the area 2 in the target road network, and the area occupied in the area 2 is denoted as an area 3.
Optionally, in a specific implementation manner provided in the present embodiment S102, when determining an area occupied by the electronic device when the broken road extends, the electronic device may extend two road boundaries at the broken road break point. After the two road boundaries extend to the road boundary of the first road in the direction of parallel broken ends, the two road extension lines are marked 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 extending. For example, in fig. 2B, the break point of the broken road D3, the first extension line, the second extension line, and the road boundary of the first road L2 collectively enclose the region 3.
Meanwhile, it is also necessary to further determine land type information of the above-described area 3 in S102. Wherein the land type information includes, but is not limited to: cultivated land, garden land, woodland, pasture land, residential sites, construction sites, transportation lands, water areas, unused lands, and the like. And optionally, the land type information can be determined by acquiring a satellite remote sensing image and identifying the satellite remote sensing image through an image recognition method, or the target road network comprises the land type information of each area where the target road network is located.
S103: according to the land type information determined in S102, it is determined whether the area occupied by the broken road can be used for constructing the road.
Specifically, in one specific implementation manner provided in the present embodiment S103, the device as the execution subject may store a mapping relationship for indicating whether different land type information is available for constructing a road, and determine whether the land type information of the area occupied by the broken road can be used for constructing the road by querying the mapping relationship. Wherein, the mapping relation comprises: at least one type of land information, and whether the at least one type of land information is usable for constructing a correspondence between roads. For example: the farmland, garden, woodland, pasture, residential and construction sites and traffic sites in the land type information correspond to not being available for constructing roads, while the waters and unused sites in the land type information correspond to being available for constructing roads. Then, when the area 3 is the unused area in the embodiment shown in fig. 2B, since the correspondence relationship of the unused area in the mapping relationship is usable for constructing the road, it is determined that the end point f of the area 3 that is usable for the broken road D3 extends toward the road L2 in the target road network to access the target road network. In fig. 2A, the upper side of the end point n of the broken-end road L2 is an artificial lake, and the corresponding relationship of the artificial lake in the mapping relationship is a non-configurable road, so that the region occupied by the extending upper side of the broken-end road L2 is determined to be a non-configurable road.
S104: if it is determined in S103 that the area occupied by the broken road can be used for constructing the road, the target road network is updated according to the break point of the broken road and the first road.
Finally, if it is determined in S104 that the area occupied by the broken road extending to the first road is available for constructing the road through the above steps, the target road network is updated according to the broken road. Specifically, the broken road is extended from its break point in a direction parallel to the broken road in S104, so that the broken road is connected to the first road from its break point. For example, fig. 2C shows an updated target road network obtained after the broken road D3 determined in S103 in the above embodiment is accessed to the target road network as in fig. 2A. The updated target road network in fig. 2C includes: the transverse roads D1, D2, D3 and D4 and the longitudinal roads L1 and L2 are connected with other roads by the end points e and i on the two sides of the road D3, so that the original broken road D3 is communicated, further the expansion of the broken road of the target road network is realized, 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 determining at least one broken road in the target road network, for each broken road, it is determined whether the occupied area can be used for constructing the road according to the land type information of the occupied area when the broken road extends to the first road in the target road network, and after determining that the area can be used for constructing the road, the target road network is updated according to the broken road and the first road. Therefore, when the target area includes more broken roads, compared with the manual comparison 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 broken roads are extracted and the automation and the intelligent degree of the road network updating process are carried out based on the broken roads. And the accessibility of the target road network and the road network density are increased by matching with road planning personnel, so that the traffic pressure of the target area is relieved.
Further, fig. 3 is a flowchart of an embodiment of a road network updating method according to the present invention. The method as shown in fig. 3 further comprises, on the basis of the embodiment of 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: and displaying the contrast data determined in the step S106, wherein the displayed contrast data is used for identifying the updating effect of the target road network.
Specifically, in the above embodiment, after the electronic device as the execution subject of the update of the target road network updates the target road network through S104, the road network traffic information before and after the update of the target road network may also be compared to provide the opinion of the reference for the road planner. Specifically, in S105, the first road network traffic information before the road network update and the second road network traffic information after the road network update 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 the road planner through an interactive device such as a sound box, a display screen, etc., so that the road planner can obtain the updating effect of the target road network through the comparison data.
Alternatively, the road network may be quantitatively described by one or more of the following road network traffic information, where the target road network is denoted as a first road network and the updated target road network is denoted as a second road network. The road network traffic information includes:
road network density refers to the ratio of the total length of all roads of a target area to the total area of the area. For example, in the first road network shown in fig. 2A, the length of the road is 5 km, the area of the target area is 2 square km, and then the road network density of the first road network is 2.5; the length of the road in the second road network shown in fig. 2C is 5.1 km, and the area of the target area is 2 square km, and the road network density of the second road network is 2.55.
Road network accessibility refers to the distance of the shortest path from one point to all other vertices in the road network of the target area, so the higher the index, the longer the distance of access to the ground, and the worse the accessibility.
Road network road characteristics refer to the technical grade of the line in the target area and the sum of its main technical performances. The system comprises a vehicle speed (km/h), a design traffic capacity (vehicle/d), a road width (m), a terrain type and the like, is a technical parameter for road network system analysis, and is stored in a mode of a group of matrixes (comprising grade, vehicle speed, distance, time, capacity and the like).
Road network layout refers to the line structure view presented by the road network. For example, fig. 2A shows a layout of a first road network, fig. 2C shows a layout of a second road network, and the target area 1 of fig. 2A and 2C can be jointly displayed on a display device, such as a display, to present the road planner with a distinction between the layout of the first road network and the layout of the second road network.
Alternatively, in the above-described embodiment, in addition to the layout of the first road network and the layout of the second road network as in fig. 2A and 2C, an access manner schematic for accessing the determined M broken roads into the first road network through S104 may be presented to the road planner in the manner as shown in fig. 2D. For example, an arrow 4 is used in fig. 2D to indicate the direction of expansion of the end point f of the broken road D3 when expanding toward the road L2 to access the first road network, and to expand the route specifically.
Further as shown in fig. 3, optionally, the method as shown in fig. 3 further includes, on the basis of the embodiment of 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 by the broken road to access a first road; and calculating the cost required for accessing the broken road to the first road according to the economic level information of the target area and the land type information of the area required by the broken road to access the first road network.
Specifically, in the above-described embodiment, when the target road network is updated at S104, since it is necessary to implement expansion of the end point f of the broken road D3 to the road L2 in the target road network by the area 3. Therefore, the cost required to be calculated in this embodiment can be understood as the cost of constructing the road in the area 3 of fig. 2B. The cost needs to consider the economic level information of the target area and the land type information of the area 3, wherein the land type information refers to the category of the land classified according to the similarity and the difference of the natural attributes thereof. 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 area where the target road network is located. For example, the cost of building a road in an unutilized area of a town where a target road network is located is 10 ten thousand yuan/meter, and the cost of building a road by bridging in a water area is 20 ten thousand yuan/meter, and the mapping relationship is: "unused land-10" and "waters-20". In S108, it is first determined that the land type of the area 3 required for the expansion of the end point f of the broken road D3 to the road L2 in the target road network is a water area, and the cost of constructing the road corresponding to the water area is 20 ten thousand yuan/meter according to the mapping relation. The total cost required for expanding the end point f of the broken road D3 to the road L2 in the target road network by 50 m in the area 3 can be calculated according to the determined mapping relation to be 1000 ten thousand yuan, and the calculated total cost can be presented to the road planner. If the land type information is a wasteland but there is a building such as a house, it is also necessary to add the cost of the settlement compensation for 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 the embodiment can determine, according to the determined different traffic information of the second road network after updating the target road network and the original target road network, the cost required for accessing the determined broken road into the target road network, and present the quantized comparison data and the required cost to the road planner, so that the road planner can comprehensively determine whether the broken road in the target area extends according to the multiple items of information, without the need of the road planner to manually compare the broken road one by one, and determine whether the broken road can extend, so that the working time of the road planner can be greatly saved, and the efficiency of accessing the broken road into the road network to extend the road network and the automation and intelligent degree of the road network updating process are further improved.
Further optionally, in the foregoing embodiments, in S101, according to determining a broken link in the target road network, the method may include: determining the first road as a broken road, wherein the first road is a first-level road which is connected with a second-level road in a first road network, the first road is not connected with any first-level road which is connected with the second-level road in the first road network, and the first level is smaller than the second level; and/or determining the second road as 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, the same grade and is not connected in the first road network; and/or determining the fourth road as a broken road, wherein the end point of the road route of the fourth road is provided with other unconnected roads with different road names and different grades in the preset range of the first road network.
Fig. 4A to 4D are schematic views illustrating an application of the road network updating method according to the present invention, and a specific method for determining a broken road in the above embodiment will be described below by taking fig. 4A to 4C as an example.
As 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. The road D3 is not connected to any other secondary road except the road L1, that is, the road D3 is connected to only one level higher road, and the road D3 is determined to be a broken road.
For the second road, as shown in fig. 4A, the road lines of all the roads in the first road network are the line segments intersecting each other as shown in the drawing, and the intersection is marked with a lower case letter, and since the end point f of the road D3 and the end point n of the road L3 are both uniquely present in the first road network, the road D3 and the road L3 are determined to be broken ends. The end points here are end points of the road line, and may be the start and/or end points of the road. While the end points of the other roads in fig. 4A are repeated, for example, the end point a of D1 and the end point a of L1 are repeated, D1 and L1 are not broken roads.
As for the third road, as shown in fig. 4B, if in the first road network, the road D3 and the road D5 have the same road name, for example, both of which are referred to as "M major road", the road class is the same, and D3 and D5 are not connected without a connection relationship, it is indicated that the roads D3 and D5 are broken roads while satisfying these three conditions.
As for the fourth road, as shown in fig. 4C, in the first road network, if there are other roads with different road names, different grades and unconnected within the preset range of the end point f of the road D3, for example, a road L2 existing within the 500m range of D3, if D3 and L2 are different in name, different grade and unconnected, it is determined that the lower-grade road D3 is a broken road.
Further, alternatively, the determination of the broken road should not participate in the determination for the road inside the area. For example, as shown in fig. 4D, the area 2 is a park, and one of the small roads 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 small road 5, since the road D3 and the road L2 are internal roads, even if the small road 5 is included in the first road network, consideration is not given when determining a broken road.
It should be noted that, the first road, the second road, the third road and the fourth road are only used for illustrating the judgment basis of the broken road, and in the actual judgment process, the four roads can be used as the basis for judging the broken road at the same time, or any one of the four roads or any plurality of the four roads can be used as the 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 overlapping in number is not repeated.
Fig. 5 is a flowchart of an embodiment of a road network updating method according to the present invention. A schematic flow chart of a method combining the embodiments of fig. 1 and 3 is shown in the embodiment shown in fig. 5, where the method shown in fig. 5 sequentially includes: data preparation, data analysis, model construction, data extraction, road extension analysis, data screening, secondary data analysis and construction cost estimation.
Wherein, data preparation: the road network data expression form can be a simple line structure or navigation data with a geographic topological structure. Data analysis: analyzing urban road network conditions: and calculating the urban road network density and road network accessibility, and comparing the urban road network conditions after the road network expansion by extracting the broken road. And (3) model building: the method comprises the following steps of (1) extracting road networks attached to a higher-level road according to road grades, and judging whether the road networks are communicated; principle 2, extracting a broken link (the broken link can be extracted by a GIS tool for extracting a blind-end road or a link (road line) single-point-hanging method in a topological structure), recording a starting point ID of each link in an attribute table, wherein the starting point is unique, and judging that the link is single-point-hanging without repetition; principle 3, same name, same level road discontinuous (same name, same level road discontinuous in space, no topological connection relation exists, is physically disconnected,); and the principle 4, the principle 5, the regional internal road network and the piece forming road network do not participate in the connectivity of the road network, wherein roads with different names and the same grade exist in the 500m range of the road blind end (the buffer area analysis is carried out by taking the road blind end as the center and the buffer area analysis is carried out in the 500m range, and whether roads with different names and the same grade exist in the 500m range or not). And (3) data extraction: according to the above principle, data extraction (implemented by geographic information system (geographic information system, GIS) software) is performed. Road extension analysis: according to the extracted result, the land type (the existing technology is used for carrying out visual interpretation or unsupervised classification according to different ground objects and different reflection wave bands of the spectrum) is extracted by utilizing the remote sensing image, and the feasibility of extracting the broken road is checked by combining the two results (according to the current situation of planning land use in cities, for example, the broken road to be communicated passes through educational and industrial land such as buildings, large water areas and the like, military government land and the like, and a communicating object is not included). Data screening: and (3) removing the roads which do not meet the requirements according to the result obtained in the last step, reserving road networks meeting the requirements, and carrying out data screening (removing the road networks which are required to pass through buildings or large water areas, education, industrial land, military government land and the like as described in the above steps). Cost estimation: according to the extraction result, combining the local economic level and planning the land utilization type of the road network, estimating the cost of the road network to be expanded, and providing basis for decision making; different types of road construction costs are different, such as bridge construction is needed to be erected when a water system is traversed, the longer the road is, the higher the cost is, some road construction designs are removed, compensation is needed to be carried out, the cost is increased, each city is subjected to land planning and evaluation for city development and the conditions of relieving local road section traffic pressure and the like according to the financial income level, and broken-end road construction and extension are carried out by integrating multiple indexes.
Fig. 6 is a schematic structural diagram of an embodiment of the road network updating device of 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; a processing module 602, 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, according to the land type information, whether an area occupied by the broken road can be used for constructing the road; 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 its specific implementation manner and principle are the same, so that the description thereof will not be repeated here.
Optionally, in the foregoing embodiment, the processing module 602 is specifically configured to determine, according to the land type information, whether the area occupied by the broken road can be used for constructing the road by querying the mapping relationship; wherein, the mapping relation includes: at least one type of land information, and whether the at least one type of land information is usable for constructing a correspondence between roads.
Optionally, in the above embodiment, the processing module 602 is specifically configured to extend two road boundaries at the break point to the road boundary of the first road in parallel to the break direction, so as to obtain a first extension line and a second extension line of the break;
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.
Optionally, in the above embodiment, the apparatus further includes: a display module 603; wherein,
the processing module 602 is further configured to obtain first road network traffic information before the update of the target road network and second road network traffic information after the update of the target road network;
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 contrast data, where the contrast data is used to represent an update effect of the target road network.
Optionally, in the above embodiment, the processing module 602 is further configured to determine a cost required to extend the broken road to the first road through the first area in the first direction according to the land type information and the economic level information of the region where the target road network is located.
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 in the first road network, and the first road is not connected to any first-level road in the first road network, where the first-level road is connected to any other first-level road in the first road network, and the first-level road is smaller than the second-level road; and/or determining the second road as 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, the same grade and is not connected in the first road network; and/or determining the fourth road as a broken road, wherein the end point of the road route of the fourth road is provided with other unconnected roads with different road names and different grades 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 as shown in the foregoing embodiment, and its specific implementation manner and principle are the same, so that the description thereof will not be repeated here.
It should be noted that, in the embodiment of the present application, the division of the modules is schematic, which is merely a logic function division, and other division manners may be implemented in actual implementation. The functional modules 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 may be integrated into one module. The integrated modules may be implemented in hardware or in software functional modules.
The integrated modules, if implemented in the form of software functional modules 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 embodied in essence or a part contributing to the prior art or all or part of the technical solution, in the form of a software product stored in a storage medium, including several instructions to cause a computer device (which may be a personal computer, a server, or a network device, etc.) or a processor (processor) to perform all or part of the steps of the methods described in the embodiments of the present application. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a random access Memory (Random Access Memory, RAM), a magnetic disk, or an optical disk, or other various media capable of storing program codes.
In the above embodiments, it may be implemented in whole or in part 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, produces a flow or function in accordance with embodiments of the present application, in whole or in part. The computer may be a general purpose computer, a special purpose computer, a computer network, or other programmable apparatus. The computer instructions may be stored in or transmitted from one computer-readable storage medium to another, for example, by wired (e.g., coaxial cable, optical fiber, digital Subscriber Line (DSL)), or wireless (e.g., infrared, wireless, microwave, etc.). The computer readable storage medium may be any available medium that can be accessed by a computer or a data storage device such as a server, data center, etc. that contains an integration of one or more 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)), etc.
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 carry out the road network updating method 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 of the processor; wherein the processor is configured to perform the road network updating method in any of the above embodiments via execution of the executable instructions.
An embodiment of the present invention also provides a program product comprising: computer programs (i.e., executing instructions) stored on a readable storage medium. The computer program may be read from a readable storage medium by at least one processor of the encoding apparatus, and executed by the at least one processor, causes the encoding apparatus to implement the road network updating method provided by the various embodiments described above.
Those of ordinary skill in the art will appreciate that: all or part of the steps for implementing the method embodiments described above may be performed by hardware associated with program instructions. The foregoing program may be stored in a computer readable storage medium. The program, when executed, performs steps including the method embodiments described above; and the aforementioned storage medium includes: various media that can store program code, such as ROM, RAM, magnetic or optical disks.
In addition, in the present application, "at least one" means one or more, and "a plurality" means two or more. "and/or", describes an association relationship of an association object, and indicates that there may be three relationships, for example, a and/or B, and may indicate: a alone, a and B together, and B alone, wherein a, B may be singular or plural. The character "/" generally indicates that the context-dependent object is an "or" relationship. "at least one of" or the like means any combination of these items, including any combination of single item(s) or plural items(s). 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 plural.
Finally, it should be noted that: the above embodiments are only for illustrating the technical solution of the present invention, and not for limiting the same; although the invention has been described in detail with reference to the foregoing embodiments, it will be understood by those of ordinary skill in the art that: the technical scheme described in the foregoing embodiments can be modified or some or all of the technical features thereof can be replaced by equivalents; such modifications and substitutions do not depart from the spirit of the invention.
Claims (8)
1. A method of updating a road network, comprising:
determining at least one broken road in a target road network;
determining land type information of an area occupied by each 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 aiming at each broken road;
determining whether the area occupied by the broken road can be used for constructing a road or not according to the land type information;
if yes, updating the target road network according to the breakpoint and the first road;
the determining whether the area occupied by the broken road can be used for constructing a road according to the land type information comprises the following steps:
determining whether the area occupied by the broken road can be used for constructing a road or not by inquiring a mapping relation according to the land type information; wherein, the mapping relation comprises: at least one land type information, and whether the at least one land type information is usable for constructing a correspondence between roads.
2. The method of claim 1, wherein the determining land type information for the 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 comprises:
extending two road boundaries at the break point to the road boundary of the first road in a direction parallel to the break point to obtain a first extension line and a second extension line of the break point;
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.
3. The method as recited in claim 1, further comprising:
acquiring first road network traffic information before updating the target road network and second road network traffic information after updating the target road network;
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.
4. The method as recited in 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.
5. The method of any one of claims 1-4, wherein the determining a broken link in the target road network comprises:
taking the road meeting the judgment condition in the target road network as the broken road; wherein the judging condition at least comprises one or more of the following:
the broken road is a first road in the target road network, wherein the first road is a first-level road which is connected with a second-level road in the first road network, the first road is not connected with any first-level road which is connected with the second-level road in the first road network, and the first level is smaller than the second level;
the broken road is a second road in the target road network, wherein an endpoint 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, 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 the end point of the road route of the fourth road is in a preset range of the first road network, and other non-connected roads with different road names and different grades exist in the preset range of the first road network.
6. A road network updating apparatus, characterized by comprising:
the determining module is used for determining at least one broken road in the 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 from the broken road to a first road in the target road network in a direction parallel to the broken road;
the processing module is also used for determining whether the area occupied by the broken road can be used for constructing the road according to the land type information;
if yes, the processing module updates the target road network according to the breakpoint and the first road;
the processing module is particularly adapted to be used,
determining whether the area occupied by the broken road can be used for constructing a road or not by inquiring a mapping relation according to the land type information; wherein, the mapping relation comprises: at least one land type information, and whether the at least one land type information is usable for constructing a correspondence between roads.
7. An electronic device, comprising: a processor and a memory for storing computer instructions; the processor executing the computer instructions to perform the method of any of claims 1-6.
8. A computer readable storage medium, on which a computer program is stored, characterized in that the computer program, when being executed by a processor, implements the method of any of claims 1-6.
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 CN111914039A (en) | 2020-11-10 |
| CN111914039B true 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) |
Families Citing this family (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 (10)
| 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 |
| 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 evaluation method based on data envelope 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 |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP5440854B2 (en) * | 2010-01-29 | 2014-03-12 | アイシン・エィ・ダブリュ株式会社 | Map update data supply device and map update data supply program |
-
2019
- 2019-05-07 CN CN201910374900.5A patent/CN111914039B/en active Active
Patent Citations (10)
| 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 |
| 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 evaluation method based on data envelope 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 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111914039A (en) | 2020-11-10 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Wilson et al. | Development of a geospatial model to quantify, describe and map urban growth | |
| US20190301963A1 (en) | Processing data for predicting pipe failure | |
| Lagarias | Urban sprawl simulation linking macro-scale processes to micro-dynamics through cellular automata, an application in Thessaloniki, Greece | |
| Abebe | Quantifying urban growth pattern in developing countries using remote sensing and spatial metrics: A case study in Kampala, Uganda | |
| CN103996089A (en) | Electric transmission line optimal path generation method based on GIS | |
| Wang et al. | A patch‐based cellular automaton for simulating land‐use changes at fine spatial resolution | |
| CN109658510B (en) | Substation site selection method, device and server | |
| Antikainen | Comparison of different strategies for determining raster‐based least‐cost paths with a minimum amount of distortion | |
| Zhou | Comparative study of approaches to delineating built‐up areas using road network data | |
| CN107704531B (en) | Automatic merging method for road network intersection nodes in OSM map data | |
| CN111914039B (en) | Road network updating method and device | |
| CN117669002B (en) | Road design practical degree assessment method and device based on big data | |
| Jedlička et al. | Open Transport Map—Routable OpenStreetMap | |
| Suleiman et al. | Optimal route location by least cost path (LCP) analysis using (GIS) a case study | |
| CN114637305B (en) | Unmanned aerial vehicle shortest path planning method and device | |
| Wang | A cellular automata model to simulate land-use changes at fine spatial resolution | |
| CN111369102B (en) | Method and device for extracting waterlogging risk points | |
| CN115063175A (en) | Shop service range defining method, system, computer device and storage medium | |
| JPWO2020031296A1 (en) | Map data processor | |
| Daniel et al. | Spatial interdependence of fractal dimension and topological parameters of road network: a geographically weighted regression approach | |
| Marceau et al. | Investigating land-use dynamics at the periphery of a fast-growing city with cellular automata at two spatial scales | |
| Huynh et al. | Extracting backbone structure of a road network from raw data | |
| Nas et al. | Analysis of Distribution Patterns in Mapping Cirebon Internet Service Facilities Using NNA Algorithm Based on Geographic Information Systems | |
| Rickards | Forest road location modelling with Dijkstra’s shortest path and ArcGIS | |
| Kontsevik et al. | Urban blocks modelling method |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |