Road domain space quantization bounding method, device, equipment and medium

Abstract

The application discloses a road domain space quantization delimitation method, device, equipment and medium, relates to the field of road traffic planning and highway economic development, and the method comprises the following steps: acquiring road network data, constructing a traffic road network topology according to the road network data; taking a highway entrance and exit as a starting point, acquiring a first preset time isochronous circle and a second preset time isochronous circle according to the traffic road network topology; wherein the first preset time is less than the second preset time; acquiring a preliminary road domain space range according to the first preset time isochronous circle and the second preset time isochronous circle; the preliminary road domain space range comprises a facility layer, a management and control layer, a core layer, a radiation layer and an edge layer; and performing difference correction on the preliminary road domain space range to acquire a target road domain space range. The application provides a more scientific and more accurate boundary delimitation method.

Description

TECHNICAL FIELD

[0001] The present application relates to the field of road traffic planning and highway economic development, and in particular to a road space quantification and delimitation method, device, equipment and medium. BACKGROUND

[0002] As a national important infrastructure, the road space (i.e. the area along and around the highway) of the expressway contains huge potential for economic and social development, forming a new industry of "road economy". "Road economy" takes highway transportation as the link, integrates factors such as people, goods, capital, technology and information, revitalizes and enhances the value of resources in the road space, realizes resource sharing and industrial synergy, and provides a new engine for regional economic development.

[0003] Scientifically quantifying the range of road space is a key prerequisite for developing "road economy", which can effectively guide the development of resource aggregation, differentiation and synergy, improve resource development efficiency, and transform transportation advantages into economic benefits. Road space mainly covers three dimensions: road space, roadside space and off-road space. Road space is the physical infrastructure within the red line of highway land, roadside space is the protection and management space outside the red line of highway, and off-road space is the radiation area of the expressway. The more convenient the transportation, the tighter the radiation.

[0004] However, existing research lacks a unified standard for the definition of road space, which is ambiguous. Usually only the road space is considered, and only the development of single nodes such as service areas and toll stations is focused on. For roadside and off-road space, qualitative descriptions such as "economic belt along the line" are often used, which fails to scientifically and quantitatively define the actual influence range of the expressway, making it difficult to accurately assess and effectively guide its radiation driving effect. SUMMARY

[0005] The purpose of the present application is to provide a road space quantification and delimitation method, device, equipment and medium, which overcomes the ambiguity and subjectivity of traditional road space delimitation methods and greatly improves the scientific basis of space division and the accuracy of boundary delimitation.

[0006] To achieve the above purpose, the present application provides the following solutions:

[0007] In a first aspect, the present application provides a road space quantification and delimitation method, comprising:

[0008] Obtaining road network data and constructing a traffic road network topology according to the road network data;

[0009] Obtaining a first preset time isochrone and a second preset time isochrone according to the traffic road network topology with the expressway entrance and exit as the starting point; wherein the first preset time is less than the second preset time;

[0010] The preliminary road space range is obtained based on the first preset time isochronous circle and the second preset time isochronous circle; the preliminary road space range includes the facility layer, control layer, core layer, radiation layer and edge layer;

[0011] The target road space range is obtained by performing differential correction on the preliminary road space range.

[0012] Optionally, obtaining the preliminary road space range based on the first preset time isochronous circle and the second preset time isochronous circle includes:

[0013] In the transportation network topology, the area within the highway land boundary is taken as the facility layer;

[0014] The highway construction control zone is used as the control layer;

[0015] The core layer is defined as the range of the first preset time isochronous circle excluding the facility layer and the control layer.

[0016] The range of the second preset time isochronous circle minus the first preset time isochronous circle is taken as the radiation layer;

[0017] The area outside the second preset time isochronous circle is used as the edge layer.

[0018] Optionally, the step of obtaining the first preset time isochronous circle and the second preset time isochronous circle based on the traffic network topology and the road segment travel time, starting from the highway entrance / exit, includes:

[0019] The travel time t of the road segment is obtained based on the traffic network topology and traffic impedance model. i Where i represents a road segment;

[0020] The road segment travel time t is adjusted and updated based on the road segment's slope. i ;

[0021] Taking the highway entrances and exits as the starting point set S, and the traffic conversion nodes as the arrival point set V, based on the road segment travel time t... i Get the travel time T of the currently known shortest path from the starting point s to the destination node v. v ;

[0022] Based on the shortest path travel time T v Get the reachable nodes and reachable road segments that can be reached from the starting point set S within a preset first time period; get the reachable nodes and reachable road segments that can be reached from the starting point set S within a preset second time period;

[0023] Based on the nodes and road segments that can be reached within the first preset time, a buffer zone is set for these road segments, and the polygon formed by merging all buffer zones is used as the isochronous circle of the first preset time.

[0024] Based on the nodes and road segments that can be reached within the second preset time, a buffer zone is set for these road segments, and the polygon formed by merging all buffer zones is used as the isochronous circle of the second preset time.

[0025] Optionally, the travel time T based on the shortest path v The function retrieves the reachable nodes and reachable road segments that can be reached from the starting point set S within a preset first time period; it also retrieves the reachable nodes and reachable road segments that can be reached from the starting point set S within a preset second time period; including:

[0026] Initialize the starting point travel time T s The time T is zero for each set of arrival points V. v Let the value be infinity. The preceding node P[V] on the shortest path from the starting point S to node V is null, and the set of nodes for which the shortest path has not yet been found is empty.

[0027] when When not empty: From Choose a node u in T such that T u Minimum; add node u to the set of nodes for which the shortest path has been found. middle;

[0028] For each node v adjacent to u, if T v >T u +w(u,v), then T v =T u +w(u,v), P[V]=u; where w is the travel time between the two nodes.

[0029] when When it is empty or T v Path searching stops when the first preset time is exceeded, at which point T v The set stored contains all sets of the shortest path lengths from the starting point s to node v that do not exceed a first preset time. These are the reachable nodes and accessible road segments within the first preset time period;

[0030] when When it is empty or T v The path search stops when the second preset time is exceeded, at which point T v The set stored in the middle contains all the shortest path lengths from the starting point s to node v. These are the reachable nodes and accessible road segments that can be reached within the second preset time period.

[0031] Optionally, the method of correcting and updating the road segment travel time t based on the road segment's slope is described. i ,include:

[0032] if the average slope of the road section is not less than a preset degree, the road section passing time t is calculated according to the preset formula. i is updated to a preset multiple of the original data.

[0033] Optionally, the constructing the traffic road network topology according to the road network data comprises:

[0034] acquiring road network data, constructing an initial traffic road network topology, and performing road network traffic volume assignment, road average speed assignment and road network average passing time assignment on the initial traffic road network topology to obtain the traffic road network topology.

[0035] Optionally, the target road domain spatial range is obtained by differentially correcting the preliminary road domain spatial range, and the target road domain spatial range comprises:

[0036] subtracting the ecological protection red line boundary from the core layer to update the core layer;

[0037] taking administrative divisions as boundaries, obtaining the per capita GDP of administrative divisions passed through by the expressway, and if the per capita GDP of each administrative division is greater than the per capita GDP of the city to which the administrative division belongs, extending the core layer range outward by a preset distance to update the core layer, the radiation layer and the edge layer.

[0038] Specifically, the administrative divisions are prefectural divisions, county-level divisions or township-level divisions, etc. The divisions can be selected according to actual conditions.

[0039] In a second aspect, the application provides a road domain spatial quantization and delimitation device, comprising:

[0040] a topology construction module configured to acquire road network data and construct a traffic road network topology according to the road network data;

[0041] a circle layer definition module configured to:

[0042] acquire a first preset time isochronous circle and a second preset time isochronous circle according to the traffic road network topology, wherein the first preset time is less than the second preset time;

[0043] acquire a preliminary road domain spatial range according to the first preset time isochronous circle and the second preset time isochronous circle; the preliminary road domain spatial range comprises a facility layer, a control layer, a core layer, a radiation layer and an edge layer;

[0044] a correction module configured to differentially correct the preliminary road domain spatial range to obtain a target road domain spatial range.

[0045] Thirdly, this application provides a computer device, including: a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor executes the computer program to implement the steps of the road space quantization and demarcation method described in any one of the above.

[0046] Fourthly, this application provides a computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, implements the steps of the road space quantization and demarcation method described in any one of the above descriptions.

[0047] Fifthly, this application provides a computer program product, including a computer program that, when executed by a processor, implements the steps of the road space quantization and demarcation method described in any one of the above descriptions.

[0048] According to the specific embodiments provided in this application, the following technical effects are disclosed:

[0049] This application provides a method, apparatus, device, and medium for quantitative delineation of road space. Based on the traffic network topology, a first preset time isochronous circle and a second preset time isochronous circle are obtained. A five-level circle model is constructed and differential corrections are made to obtain the range of road space. This overcomes the ambiguity and subjectivity of traditional road space delineation methods and significantly improves the scientific basis of spatial division and the accuracy of boundary delineation. Attached Figure Description

[0050] To more clearly illustrate the technical solutions in the embodiments of this application or the prior art, the drawings used in the embodiments will be briefly introduced below. Obviously, the drawings described below are only some embodiments of this application. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0051] Figure 1 A flowchart illustrating a method for quantitative delimitation of road space provided in an embodiment of this application;

[0052] Figure 2 A schematic diagram illustrating the framework of a road space quantitative delimitation method provided in an embodiment of this application;

[0053] Figure 3 for Figure 1 A detailed flowchart of step 102;

[0054] Figure 4 for Figure 1 A detailed flowchart of step 104;

[0055] Figure 5 A structural diagram of the road space range provided in an embodiment of this application;

[0056] Figure 6 A functional module schematic diagram of a road space quantization delimitation device provided for another embodiment of the present application.

[0057] Figure 7 A structural schematic diagram of a computer device provided for an embodiment of the present application. DETAILED DESCRIPTION

[0058] The technical solutions in the embodiments of the present application will be described clearly and completely below with the drawings in the embodiments of the present application. Obviously, the described embodiments are only part of the embodiments of the present application, rather than all the embodiments. Based on the embodiments in the present application, all the other embodiments obtained by those skilled in the art without creative work fall within the scope of protection of the present application.

[0059] The above purposes, features and advantages of the present application can be more obvious and easy to understand. The present application will be further described in detail below with the drawings and specific embodiments.

[0060] In an exemplary embodiment, as shown in Figure 1 and Figure 2 a road space quantization delimitation method is provided, including the following steps 101-104. Wherein:

[0061] Step 101, obtaining road network data, and constructing a traffic road network topology according to the road network data;

[0062] Further, the road network data is obtained from a traffic department or a public website, including highway, national road, provincial road, expressway, main road and secondary road network data, and the traffic road network topology is constructed.

[0063] Step 102, obtaining a first preset time isochronous circle and a second preset time isochronous circle according to the traffic road network topology; wherein the first preset time is less than the second preset time;

[0064] As a specific embodiment, the first preset time is 15 minutes, and the second preset time is 30 minutes.

[0065] Step 103, obtaining a preliminary road space range according to the first preset time isochronous circle and the second preset time isochronous circle; wherein the preliminary road space range includes a facility layer, a control layer, a core layer, a radiation layer and an edge layer;

[0066] Specifically, the five-level circle layer model obtained by the application includes a facility layer, a control layer, a core layer, a radiation layer, and an edge layer. The five-level circle layer model based on time cost quantification and standardization is introduced, the fuzziness and subjectivity of the traditional road space definition method are overcome, and the scientific basis of space division and the accuracy of boundary definition are greatly improved.

[0067] In step 104, the preliminary road space range is corrected in difference to obtain a target road space range.

[0068] According to the actual economic situation and ecological situation of the region, the preliminary road space range is corrected to obtain the target road space range, and individual adjustment for different regions is realized.

[0069] By implementing the above steps 101 to 104, the application quantifies the space region based on time cost, and according to the actual situation of the region, the difference is corrected to overcome the fuzziness and subjectivity of the traditional road space definition method, and the scientific basis of space division and the accuracy of boundary definition are greatly improved.

[0070] In another exemplary embodiment of the application, in order to accurately construct the time-based traffic road network topology, step 101 includes: obtaining road network data, constructing an initial traffic road network topology, and assigning road network traffic volume, road network average speed, and road network average travel time to the initial traffic road network topology to obtain a traffic road network topology.

[0071] Optionally, the road network vector is obtained through the OpenStreetMap (OSM) official website.

[0072] Specifically, constructing the traffic road network topology further includes performing topology checking, repairing topology errors such as hanging points, repeated lines, and small line segments, and creating nodes at all traffic conversion points to ensure correct connection between road segments.

[0073] Specifically, the actual running traffic volume V i is assigned to each road segment i according to the actual traffic volume running data, and the road segment i is assigned with a traffic capacity C i according to the road grade, and the traffic capacity is the single lane traffic capacity multiplied by the number of road lanes, and the single traffic capacity is 1600 standard vehicles / hour / lane for the main line of the expressway, 800 standard vehicles / hour / lane for the ramp, 1000 standard vehicles / hour / lane for the national road, 800 standard vehicles / hour / lane for the provincial road, 1200 standard vehicles / hour / lane for the expressway, 1000 standard vehicles / hour / lane for the main road, and 800 standard vehicles / hour / lane for the secondary road.

[0074] Specifically, the average travel speed V Speeds are 100km / h for main lines of highways, 40km / h for ramps, 60km / h for national roads, 40km / h for provincial roads, 80km / h for expressways, 60km / h for main roads, and 40km / h for secondary roads;

[0075] Specifically, according to the length L of the road section i i and the average traffic speed V , the average traffic time t i,0 is calculated and assigned, and the calculation formula is:

[0076] In another exemplary embodiment of the present application, in order to construct the first preset time isochronous circle and the second preset time isochronous circle accurately, steps 102 include steps 201-205: Figure 3

[0077] Step 201, according to the traffic network topology and the traffic impedance model, the road section traffic time t i is obtained; wherein i is the road section;

[0078] t i = t i,0 × [1 + a × (V i / C i ) β ]

[0079] Wherein, a and β are model parameters, and the standard values are a = 0.15 and β = 0.15; t i,0 is the average traffic time of the road section i, C i is the traffic capacity of the road section i, and V i is the actual running traffic volume of the road section i;

[0080] Step 202, the road section traffic time t i is updated according to the slope correction of the road section;

[0081] Specifically, digital elevation data can be obtained to further obtain the slope of the road section;

[0082] Specifically, if the average slope of the road section is not less than a preset degree, the road section traffic time is updated to a preset multiple of the original data.

[0083] As a preferred embodiment, if the slope of the road section i is large, the average slope slop i ≥ 15 degrees, the traffic condition is relatively difficult, and the traffic time will be increased accordingly, and the corrected traffic time t

[0084] Step 203, taking the highway entrance and exit as the starting point set S and the traffic conversion node as the arrival point set V, according to the road section traffic time t i ​Obtain the travel time T of the shortest path from the starting point s to the arrival node v v ;

[0085] Specifically, the calculation formula is:

[0086]

[0087] The travel time T of the shortest path v , which is the sum of the travel times of all road segments from the starting point s to the node v

[0088] Step 204, according to the travel time T of the shortest path v , obtain the arrival nodes and reachable road segments that can be reached from the starting point set S within a preset first time; obtain the arrival nodes and reachable road segments that can be reached from the starting point set S within a preset second time.

[0089] Specifically, the initialization process is:

[0090] Initialize the travel time T of the starting point s to zero, for each arrival node set V, set the travel time T v to infinity, the predecessor node P[V] of the shortest path from the starting point s to the node v is empty value, and the node set

[0091] Specifically, the iteration process is:

[0092] When is not empty: select a node u from such that T u is minimum; add the node u to the node set for which the shortest path has been found;

[0093] For each node v adjacent to u, if T v > T u + w(u, v), then T v = T u + w(u, v), P[V] = u; where w is the travel time between two nodes,

[0094] When is empty or T v exceeds the first preset time, stop the path search, at this time the length of the shortest path from the starting point s to the node v stored in T v is no more than the first preset time, and all sets corresponding to the arrival nodes and reachable road segments that can be reached within the first preset time;

[0095] When is empty or Tv stop the path search when the second preset time is exceeded, at which time T v The shortest path length from the starting point s to the node v stored in the set is the shortest path length from the starting point s to the node v, and all the sets The arrival nodes and reachable road segments that can be reached within the second preset time.

[0096] Step 205, according to the arrival nodes and reachable road segments that can be reached within the first preset time, set a buffer zone for these road segments, and combine the polygons of all the buffer zones to obtain a first preset time isochrone; according to the arrival nodes and reachable road segments that can be reached within the second preset time, set a buffer zone for these road segments, and combine the polygons of all the buffer zones to obtain a second preset time isochrone.

[0097] Specifically, ARCGIS software can be used to generate isochrones, according to the calculation results of the above steps, identify the arrival nodes and reachable road segments that can be reached within 15 minutes, set a buffer zone (which can be set to 100 meters) for these road segments, and combine the polygons of all the buffer zones to obtain a 15-minute time isochrone; similarly, generate a 30-minute time isochrone according to similar steps.

[0098] In another exemplary embodiment of the present application, in order to realize the accurate division of the five-level circle layer model, step 103 comprises:

[0099] In the traffic network topology, the highway land red line range is taken as the facility layer;

[0100] The highway construction control area is taken as the control layer;

[0101] The first preset time isochrone range excluding the facility layer and the control layer is taken as the core layer;

[0102] The second preset time isochrone range excluding the first preset time isochrone is taken as the radiation layer;

[0103] The area outside the second preset time isochrone is taken as the edge layer.

[0104] Specifically, the facility layer includes the infrastructure layer, and the highway land red line range includes service areas, toll stations, interchanges, road segments, and other facilities.

[0105] Specifically, the control layer is the highway construction control area, which extends 50 meters outward from the outer edge of the highway land, and if there are relevant legal provisions, the provisions are followed.

[0106] Specifically, the core layer is the area that can be reached within 15 minutes from the exit and entrance, and does not include the facility layer and the control layer.

[0107] Specifically, the radiation layer is the area that can be reached within more than 15 minutes but not more than 30 minutes from the highway exit and entrance.

[0108] Specifically, the edge layer is an area that can be reached by the high-speed passageway in more than 30 minutes.

[0109] In another exemplary embodiment of the present application, in order to correct the road space range according to different regional characteristics, such as Figure 4 , step 104 comprises:

[0110] Step 301, acquiring the ecological protection red line boundary, the township administrative boundary, and the per capita GDP data;

[0111] Specifically, the above data is obtained from the relevant competent department and is used to correct the regional differences.

[0112] Step 302, deducting the ecological protection red line boundary from the core layer to update the core layer;

[0113] Specifically, the ecological protection red line should be deducted from the core layer range as a strictly prohibited development area.

[0114] Step 303, taking the administrative division as the boundary, acquiring the per capita GDP of the township administrative division through which the highway passes, and if the per capita GDP of each township administrative division is greater than the per capita GDP of the city to which it belongs, the core layer range is extended outward by a preset distance to update the core layer, the radiation layer, and the edge layer.

[0115] As a specific implementation, taking the township and the street as the boundary, the per capita GDP of each township administrative division through which the highway passes is respectively recorded as The per capita GDP of the city to which it belongs is recorded as If the economic vitality of the township administrative division is higher, then the core layer range of the highway in the jurisdiction is moderately extended, the extension distance is to update the core layer, the radiation layer, and the edge layer.

[0116] The present application provides a road space quantification and delimitation method, which specifically comprises the following technical features:

[0117] The traditional circle layer division relies on geographical distance, but the actual economic connection is more affected by time. Using isochronous circle to replace fixed distance, based on the time cost for quantification and circle layer division, the target road space range of five-level circle layer is more in line with the trend of economic development, overcoming the fuzziness and subjectivity of the traditional road space delimitation method, greatly improving the scientific basis of space division and the accuracy of boundary delimitation.

[0118] In the process of obtaining the road domain space range, the application is corrected according to the regional characteristics and economic development characteristics of different regions, including: topographic correction (correction according to regional slope), ecological protection correction (correction of ecological protection areas) and economic vitality correction (spatial correction based on GDP), which significantly enhances the adaptability and dynamics, so that the circle layer division method can flexibly adapt to the specific conditions of different regions (such as economically developed areas, underdeveloped areas, plain areas, mountainous areas, etc.), dynamically adjust the influence range, and improve the universality and practicality of the method.

[0119] The target road domain space range obtained by the application has a profound influence and great potential on economic development, and has a profound significance for the rationalization of economic development. For example Figure 5 , the radiation layer has the characteristics of large-area contiguous land, low volume rate, small building density, low urban edge land price, and low-cost acquisition of large-area land, and has higher ecological sensitivity, which can be used as green land, rural area, agricultural area, ecological tourism area, forestry area, etc. The control layer conforms to the planning level of intensive land use, usually with medium-high volume rate relying on vertical space, etc. It can realize the functions of schools, hospitals, commerce, residence, catering, hotels, etc. to improve the efficiency of land use.

[0120] The application also provides an application scenario of the road domain space quantization and delimitation method. Specifically, the road domain space quantization and delimitation method provided by the embodiment can be applied in a scenario within the circle layer of a certain region.

[0121] For example, according to the circle layer planning method of the application, the road network data of the region is obtained as the highway, national road, provincial road, expressway, main road and secondary road network data within the preset range; the area of the facility layer in the obtained preliminary road domain space range is about 34.38 square kilometers; the area of the control layer is about 39.28 square kilometers; the area of the core layer is about 1163.27 square kilometers; the area of the radiation layer is about 1910.82 square kilometers; after correction by the method of the application, the area of the facility layer is about 34.38 square kilometers, which remains unchanged; the area of the control layer is about 39.28 square kilometers, which remains unchanged; the area of the core layer is about 1041.35 square kilometers, which is reduced by 121.92 square kilometers; the area of the radiation layer is about 2032.74 square kilometers, which is increased by 121.92 square kilometers. (In order to avoid sensitive content, the specific region and the circle layer diagram obtained after implementation are not mentioned, and relevant information can be provided as needed in the future)

[0122] Based on the same inventive concept, the embodiment of the present application also provides a road space quantization delimitation method device for implementing the above-mentioned road space quantization delimitation method. The implementation scheme for solving the problem provided by the device is similar to the implementation scheme described in the above-mentioned method, so the specific limitations in one or more road space quantization delimitation device embodiments provided below can refer to the limitations of the road space quantization delimitation method in the foregoing, which will not be described here again.

[0123] In one exemplary embodiment, as shown in Figure 6 a road space quantization delimitation device is provided, comprising:

[0124] a topology construction module configured to obtain road network data and construct a traffic road network topology according to the road network data;

[0125] a circle layer delimitation module configured to:

[0126] obtain a first preset time isochronal circle and a second preset time isochronal circle according to the traffic road network topology, wherein the first preset time is less than the second preset time;

[0127] obtain a preliminary road space range according to the first preset time isochronal circle and the second preset time isochronal circle; the preliminary road space range comprises a facility layer, a control layer, a core layer, a radiation layer, and an edge layer;

[0128] a correction module configured to correct the preliminary road space range to obtain a target road space range.

[0129] As an optional implementation, the circle layer delimitation module is specifically configured to:

[0130] take the highway land red line range as the facility layer in the traffic road network topology;

[0131] take the highway construction control area as the control layer;

[0132] take the first preset time isochronal circle and the range excluding the facility layer and the control layer as the core layer;

[0133] take the second preset time isochronal circle and the range excluding the first preset time isochronal circle as the radiation layer;

[0134] take the area outside the second preset time isochronal circle as the edge layer.

[0135] As an optional implementation, the circle layer delimitation module is specifically further configured to:

[0136] obtain a road section travel time t i according to the traffic road network topology and a traffic impedance model; wherein i is a road section;

[0137] According to the slope of the road segment, the road segment travel time t is corrected and updated i ;

[0138] The highway entrance and exit are set as the starting point set S, the traffic conversion node is set as the arrival point set V, and the road segment travel time t is obtained i The travel time T of the shortest path currently known from the starting point s to the arrival node v is obtained v ;

[0139] According to the travel time T of the shortest path v , the arrival nodes and reachable road segments that can be reached within a preset first time from the starting point set S are obtained; the arrival nodes and reachable road segments that can be reached within a preset second time from the starting point set S are obtained

[0140] According to the nodes and reachable road segments that can be reached within the first preset time, a buffer zone is set for these road segments, and the polygon obtained by merging all the buffer zones is taken as the first preset time isochrone circle

[0141] According to the nodes and reachable road segments that can be reached within the second preset time, a buffer zone is set for these road segments, and the polygon obtained by merging all the buffer zones is taken as the second preset time isochrone circle.

[0142] As an optional implementation, the circle layer defining module is specifically further used for:

[0143] Initialize the starting point travel time T s to zero, and set the travel time T v of each arrival point set V to infinity, the predecessor node P[V] on the shortest path from the starting point S to the node V to be null, and the node set V

[0144] When the node set V is not empty: select a node u from the node set V such that T u is minimum; add the node u to the node set V that has found the shortest path;

[0145] For each node v adjacent to u, if T v >T u +w(u,v), then T v =T u +w(u,v), and P[V] = u; wherein w is the travel time between two nodes,

[0146] When the node set V is empty or the travel time T v exceeds the first preset time, stop the path search, and at this time, the travel time T vThe shortest path length from the starting point s to node v within the first preset time is stored in the set The arrival nodes and reachable road segments within the first preset time

[0147] When When T v When the path search is stopped when T v The shortest path length from the starting point s to node v is stored in the set The arrival nodes and reachable road segments within the second preset time

[0148] As an optional implementation, the circle layer defining module is further configured to:

[0149] If the average slope of the road segment is not less than a preset degree, the road segment passing time is updated to a preset multiple of the original data.

[0150] As an optional implementation, the topology constructing module is further configured to:

[0151] Obtain road network data, and construct an initial traffic road network topology; and obtain a traffic road network topology by assigning road network traffic volume, road network average speed, and road network average passing time according to a road grade for the initial traffic road network topology.

[0152] As an optional implementation, the correction module is further configured to:

[0153] Subtract the ecological protection red line boundary from the core layer to update the core layer

[0154] Take administrative division as a boundary, obtain the per capita GDP of the administrative division through which the expressway passes; if the per capita GDP of each administrative division is greater than the per capita GDP of the city to which the administrative division belongs, extend the core layer range outward by a preset distance to update the core layer, the radiation layer, and the edge layer.

[0155] In an exemplary embodiment, a computer device is provided, which can be a server or a terminal, and an internal structure diagram of the computer device can be as shown in Figure 7As shown in the figure. The computer device includes a processor, a memory, an input / output interface (I / O for short) and a communication interface. Among them, the processor, the memory and the input / output interface are connected through the system bus, and the communication interface is connected to the system bus through the input / output interface. Among them, the processor of the computer device is used to provide computing and control capability. The memory of the computer device includes a non-volatile storage medium and an internal memory. The non-volatile storage medium stores an operating system, a computer program and a database. The internal memory provides an environment for the operation of the operating system and the computer program in the non-volatile storage medium. The database of the computer device is used to store data. The input / output interface of the computer device is used to exchange information between the processor and external devices. The communication interface of the computer device is used to communicate with external terminals through network connection. The computer program is executed by the processor to implement a road space quantization delimitation method.

[0156] Those skilled in the art can understand that, Figure 7 The structure shown in the figure is only a block diagram of part of the structure related to the scheme of the present application, and does not constitute a limitation on the computer device to which the scheme of the present application is applied. A specific computer device can include more or fewer components than those shown in the figure, or combine certain components, or have a different component arrangement.

[0157] In an exemplary embodiment, a computer device is also provided, including a memory and a processor, the memory storing a computer program, and the processor executing the computer program to implement the steps in each of the method embodiments.

[0158] In an exemplary embodiment, a computer readable storage medium is provided, storing a computer program, which is executed by a processor to implement the steps in each of the method embodiments.

[0159] In an exemplary embodiment, a computer program product is provided, including a computer program, which is executed by a processor to implement the steps in each of the method embodiments.

[0160] It should be noted that the user information (including but not limited to user device information, user personal information, etc.) and data (including but not limited to data for analysis, stored data, displayed data, etc.) involved in the present application are all information and data authorized by the user or authorized by all parties, and the collection, use and processing of related data need to comply with relevant regulations.

[0161] Those skilled in the art can understand that all or part of the processes in the above-mentioned embodiment methods can be completed by instructing the relevant hardware through a computer program. The computer program can be stored in a non-volatile computer readable storage medium, and when the computer program is executed, the processes of the above-mentioned embodiments of the methods can be included. Any reference to memory, database or other medium used in the embodiments provided in the present application can include at least one of non-volatile and volatile memory. The non-volatile memory can include read-only memory (Read-Only Memory, ROM), magnetic tape, floppy disk, flash memory, optical storage, high-density embedded non-volatile memory, resistive memory (ReRAM), magnetoresistive random access memory (Magnetoresistive Random Access Memory, MRAM), ferroelectric memory (Ferroelectric Random Access Memory, FRAM), phase change memory (Phase Change Memory, PCM), graphene memory, etc. The volatile memory can include random access memory (Random Access Memory, RAM) or external cache memory, etc. As an illustration but not limitation, the RAM can be in various forms, such as static random access memory (Static Random Access Memory, SRAM) or dynamic random access memory (Dynamic Random Access Memory, DRAM), etc.

[0162] The database involved in the embodiments provided in the present application can include at least one of a relational database and a non-relational database. The non-relational database can include a distributed database based on a blockchain, etc., without being limited thereto. The processor involved in the embodiments provided in the present application can be a general-purpose processor, a central processing unit, a graphics processing unit, a digital signal processor, a programmable logic device, a data processing logic device based on quantum computing, etc., without being limited thereto.

[0163] The technical features of the above embodiments can be combined arbitrarily. In order to make the description concise, all possible combinations of the technical features in the above embodiments are not described, but as long as the combinations of the technical features do not exist contradictory, they should be considered as the scope of the present application.

[0164] The principles and implementation modes of the present application are described by applying specific examples in this paper, and the above-mentioned examples are only used to help understand the method and its core idea of the present application; at the same time, for those skilled in the art, according to the idea of the present application, the specific implementation mode and application range will be changed. In conclusion, the content of the specification should not be understood as a limitation of the present application.

Claims

1. A method for road space quantization bounding, characterized in that, The road domain space quantification method comprises: Obtaining road network data, and constructing a traffic road network topology according to the road network data; Obtaining a first preset time isochronal circle and a second preset time isochronal circle according to the traffic road network topology, wherein the first preset time is less than the second preset time; Obtaining a preliminary road domain space range according to the first preset time isochronal circle and the second preset time isochronal circle; the preliminary road domain space range comprises a facility layer, a control layer, a core layer, a radiation layer and an edge layer; wherein the facility layer is used for indicating a highway land red line range, the control layer is used for indicating a highway building control area, the core layer is used for indicating the first preset time isochronal circle, the radiation layer is used for indicating a range of the second preset time isochronal circle excluding the first preset time isochronal circle, and the edge layer is used for indicating a region outside the second preset time isochronal circle; Differentially correcting the preliminary road domain space range to obtain a target road domain space range; The method comprises the following steps: acquiring link travel time according to the traffic network topology and traffic impedance model ; wherein i is a link Updating link travel times according to slope correction of the link ; A highway entrance and exit are taken as a starting point set S, and the traffic conversion node is a destination set V. According to the road section travel time The travel time of the currently known shortest path from the starting point to the destination node is obtained ; Travel time according to shortest path acquire reachable nodes and reachable road segments that can be reached from the start point set S within a preset first time; acquire reachable nodes and reachable road segments that can be reached from the start point set S within a preset second time; According to the nodes and reachable road sections that can be reached within the first preset time, a buffer zone is set for these road sections, and a polygon obtained by merging all the buffer zones is taken as the first preset time isochronal circle; According to the nodes and reachable road sections that can be reached within the second preset time, a buffer zone is set for these road sections, and a polygon obtained by merging all the buffer zones is taken as the second preset time isochronal circle.

2. The road space quantization delimitation method according to claim 1, characterized in that, The method comprises the following steps: In the traffic road network topology, the highway land red line range is taken as the facility layer; The highway building control area is taken as the control layer; The range of the first preset time isochronal circle excluding the facility layer and the control layer is taken as the core layer; The range of the second preset time isochronal circle excluding the first preset time isochronal circle is taken as the radiation layer; The region outside the second preset time isochronal circle is taken as the edge layer.

3. The road space quantization delimitation method according to claim 1, characterized in that, The passing time according to the shortest path acquire the reachable nodes and reachable road segments that can be reached from the starting point set S within a preset first time; Obtaining reachable nodes and reachable road sections that can be reached from a starting point set S within a preset second time; the method comprises the following steps: Initialize the starting point travel time Zero, for each set of arrival points Travel time Let it be infinity, starting point To the node Pre-nodes on the shortest path If the value is null, the set of nodes for the shortest path has not yet been found. ; When is not empty: select a node from such that is minimum; add to the set of nodes for which the shortest path has been found ; For each node adjacent to the node , if then , ; wherein is the same row time for both nodes, When is empty or the first preset time is exceeded, the path search is stopped, at which time stored in the set is the shortest path length from the starting point to the node that does not exceed the first preset time, and all sets corresponding thereto are the arrival nodes and reachable path sections that can be reached within the first preset time; When is empty or the second preset time is exceeded, the path search is stopped, at which time stored in the second preset time is the shortest path length from the starting point to the node , and all sets corresponding thereto are the reachable nodes and reachable path sections that can be reached within the second preset time.

4. The road space quantization delimitation method of claim 1, wherein, The road segment travel time is updated according to the slope of the road segment including: If the average slope of the road segment is not less than a preset degree, the road segment travel time is updated to a preset multiple of the original data.

5. The road space quantization delimitation method of claim 1, wherein, The method comprises the following steps: Obtaining road network data, and constructing an initial traffic road network topology; according to road grades, road network traffic volume assignment, road network average speed assignment and road network average travel time assignment are performed on the initial traffic road network topology to obtain the traffic road network topology.

6. The road space quantization delimitation method of claim 1, wherein, The method comprises the following steps: Subtracting an ecological protection red line boundary from the core layer to update the core layer; Taking administrative divisions as boundaries, obtaining the per capita GDP of administrative divisions passed through by the highway; if the per capita GDP of each administrative division is greater than the per capita GDP of the city to which the administrative division belongs, the core layer range is extended outward by a preset distance to update the core layer, the radiation layer and the edge layer.

7. A road space quantization delimiting device, characterized by comprising: The road domain space quantization delimiting device comprises: a topology construction module, configured to acquire road network data and construct a traffic road network topology according to the road network data; a circle layer delimiting module, configured to: acquire a first preset time isochronal circle and a second preset time isochronal circle according to the traffic road network topology, wherein the first preset time is less than the second preset time; acquire a preliminary road domain space range according to the first preset time isochronal circle and the second preset time isochronal circle; the preliminary road domain space range comprises a facility layer, a control layer, a core layer, a radiation layer and an edge layer; wherein the facility layer is used to indicate a highway land red line range, the control layer is used to indicate a highway building control area, the core layer is used to indicate the first preset time isochronal circle, the radiation layer is used to indicate a range of the second preset time isochronal circle except the first preset time isochronal circle, and the edge layer is used to indicate a range of the second preset time isochronal circle except the first preset time isochronal circle and the facility layer and the control layer; a correction module, configured to correct the preliminary road domain space range to acquire a target road domain space range; the circle layer delimiting module is further configured to: acquiring link travel time according to the traffic network topology and traffic impedance model ; wherein i is a link Updating link travel times according to slope correction of the link ; A highway entrance and exit are taken as a starting point set S, and the traffic conversion node is a destination set V. According to the road section travel time The travel time of the currently known shortest path from the starting point to the destination node is obtained ; Travel time according to shortest path acquire reachable nodes and reachable road segments that can be reached from the start point set S within a preset first time; acquire reachable nodes and reachable road segments that can be reached from the start point set S within a preset second time; set a buffer zone for the nodes and the reachable road segments within the first preset time, and combine the polygons of all the buffer zones to obtain the first preset time isochronal circle; set a buffer zone for the nodes and the reachable road segments within the second preset time, and combine the polygons of all the buffer zones to obtain the second preset time isochronal circle.

8. A computer device comprising: A memory, a processor and a computer program stored in the memory and executable on the processor, characterized in that the processor executes the computer program to implement the steps of the road domain space quantization delimiting method in any one of claims 1-6.

9. A computer readable storage medium having stored thereon a computer program, characterized in that, The computer program is executed by the processor to implement the steps of the road domain space quantization delimiting method in any one of claims 1-6.

Images