Road domain space quantification and delimitation method, device, equipment and medium

Abstract

The invention discloses a road domain space quantification and delimitation method and device, equipment and a medium, and relates to the field of road traffic planning and road economic development, and the method comprises the steps: obtaining road network data, and constructing a traffic road network topology according to the road network data; acquiring a first preset time isochronal circle and a second preset time isochronal circle according to the traffic road network topology by taking the entrance and exit of the expressway as a starting point; wherein the first preset time is shorter than the second preset time; according to the first preset time isochronous circle and the second preset time isochronous circle, obtaining a preliminary road domain space range; 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 obtain a target road domain space range. The invention provides a more scientific and more accurate boundary defining method.

Description

Technical Field

[0001] This application relates to the fields of road traffic planning and highway economic development, and in particular to a method, device, equipment and medium for quantitative delineation of road space. Background Technology

[0002] As a crucial national infrastructure, highways possess immense potential for economic and social development within their roadside areas (i.e., the areas along and surrounding the highway), giving rise to a new "road-derived economy." This economy, using highway transportation as a link, integrates elements such as people, goods, capital, technology, and information to revitalize and enhance the value of resources within the roadside area, achieving resource sharing and industrial synergy, and providing a new engine for regional economic development.

[0003] Scientifically quantifying the scope of road zone space is a key prerequisite for developing "road-derived economy." It can effectively guide the clustered, differentiated, and collaborative development of resources, improve resource development efficiency, and transform transportation advantages into economic dividends. Road zone space mainly encompasses three dimensions: on-road space, roadside space, and off-road space. On-road space refers to the physical infrastructure within the highway land boundary; roadside space is the protection and management space extending outward from the highway boundary; and off-road space is the radiation area of ​​the expressway. The more convenient the transportation, the denser the radiation.

[0004] However, existing research has a vague definition of road space and lacks a unified standard. It usually only considers the space within the road and focuses only on the development of single nodes such as service areas and toll stations. The space along the roadside and off the road is mostly described qualitatively, such as "economic belt along the route", which fails to scientifically and quantitatively define the actual impact range of the highway, making it difficult to accurately assess and effectively guide its radiating and driving effects. Summary of the Invention

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

[0006] To achieve the above objectives, this application provides the following solution:

[0007] Firstly, this application provides a method for quantitative delimitation of road space, including:

[0008] Acquire road network data and construct a traffic road network topology based on the road network data;

[0009] Starting from the highway entrance / exit, a first preset time isochronous circle and a second preset time isochronous circle are obtained according to the traffic network topology; 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 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; 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 the preset degree, the travel time t of the road section will be... i Update to the preset multiple of the original data.

[0033] Optionally, constructing the traffic network topology based on the road network data includes:

[0034] Obtain road network data and construct an initial traffic road network topology; for the initial traffic road network topology, assign values ​​to road network traffic volume, average road speed, and average road network travel time according to road level to obtain the traffic road network topology.

[0035] Optionally, the target road space range is obtained by performing differential correction on the preliminary road space range, including:

[0036] The ecological protection red line boundary is deducted from the core layer to update the core layer;

[0037] Using administrative divisions as boundaries, obtain the per capita GDP of the administrative divisions along the highway route. If the per capita GDP of each administrative division is greater than the per capita GDP of the city to which it belongs, extend the core layer outward by a preset distance to update the core layer, the radiation layer, and the edge layer.

[0038] Specifically, administrative divisions can be classified as prefecture-level, county-level, or township-level, etc. The appropriate division can be chosen based on the actual situation.

[0039] Secondly, this application provides a road space quantitative demarcation device, comprising:

[0040] The topology construction module is used to acquire road network data and construct a traffic road network topology based on the road network data.

[0041] The circle delineation module is used for:

[0042] Starting from the highway entrance / exit, a first preset time isochronous circle and a second preset time isochronous circle are obtained according to the traffic network topology; wherein, the first preset time is less than the second preset time;

[0043] 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;

[0044] The correction module is used to perform differential correction on the preliminary road space range to obtain the target road space 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 quantization and 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 This is a schematic diagram of the functional modules of a road space quantification and demarcation device provided in another embodiment of this application.

[0057] Figure 7 This is a schematic diagram of the structure of a computer device provided in an embodiment of this application. Detailed Implementation

[0058] The technical solutions of the embodiments of this application will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of this application, and not all embodiments. Based on the embodiments of this application, all other embodiments obtained by those of ordinary skill in the art without creative effort are within the scope of protection of this application.

[0059] To make the above-mentioned objectives, features and advantages of this application more apparent and understandable, the application will be further described in detail below with reference to the accompanying drawings and specific embodiments.

[0060] In one exemplary embodiment, such as Figure 1 and Figure 2 As shown, a method for quantitative delimitation of road space is provided, including the following steps 101 to 104. Wherein:

[0061] Step 101: Obtain road network data and construct the traffic road network topology based on the road network data;

[0062] Furthermore, the road network data is obtained from transportation departments or public websites, including road network vector data of expressways, national highways, provincial highways, expressways, arterial roads and secondary arterial roads, to construct the transportation road network topology.

[0063] Step 102: Obtain the first preset time isochronous circle and the second preset time isochronous circle according to the traffic 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: Obtain the preliminary road space range based on the first preset time isochronous circle and the second preset time isochronous circle; wherein, the preliminary road space range includes the facility layer, control layer, core layer, radiation layer and edge layer;

[0066] Specifically, the five-level concentric circle model obtained in this application includes a facility layer, a control layer, a core layer, a radiation layer, and a peripheral layer. It introduces quantitative accessibility analysis based on time cost and a standardized five-level concentric circle model, which 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.

[0067] Step 104: Perform differential correction on the preliminary road space range to obtain the target road space range.

[0068] The initial road zone spatial range is revised based on the actual economic and ecological conditions of the region to obtain the target road zone spatial range, thus achieving personalized adjustments for different regions.

[0069] By implementing steps 101 to 104 above, this application quantifies spatial areas based on time costs and makes differential corrections according to the actual situation of the region, overcoming the ambiguity and subjectivity of traditional road space delineation methods, and greatly improving the scientific basis of spatial division and the accuracy of boundary delineation.

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

[0071] Alternatively, road network vectors can be obtained from the OpenStreetMap (OSM) website.

[0072] Specifically, building a traffic network topology also includes performing topology checks, fixing topology errors such as hanging points, duplicate lines, and small line segments, creating nodes at all traffic transition points, and ensuring correct connections between road segments.

[0073] Specifically, based on actual traffic volume operation data, each road segment i is assigned an actual operating traffic volume V. i And assign traffic capacity C to road segment i according to road grade. i Traffic capacity is the capacity of a single lane multiplied by the number of lanes in a road segment. The capacity of a single lane is as follows: 1600 standard vehicles / hour / lane for expressway mainline, 800 standard vehicles / hour / lane for ramps, 1000 standard vehicles / hour / lane for national highways, 800 standard vehicles / hour / lane for provincial highways, 1200 standard vehicles / hour / lane for expressways, 1000 standard vehicles / hour / lane for arterial roads, and 800 standard vehicles / hour / lane for secondary arterial roads.

[0074] Specifically, the average traffic speed is assigned to road segment i based on its road classification. Speed ​​limits are set as follows: 100 km / h for expressway main lines, 40 km / h for ramps, 60 km / h for national highways, 40 km / h for provincial highways, 80 km / h for expressways, 60 km / h for arterial roads, and 40 km / h for secondary arterial roads.

[0075] Specifically, based on the length L of road segment i i and average traffic speed Calculate the average travel time t i,0 And assign values, calculation formula:

[0076] In another exemplary embodiment of this application, in order to construct an accurate first preset time isochronous circle and a second preset time isochronous circle, such as Figure 3 Step 102 includes steps 201 to 205:

[0077] Step 201: Obtain the travel time t of the road segment based on the traffic network topology and traffic impedance model. i Where i represents a road segment;

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

[0079] Where α and β are model parameters, with standard values ​​of α = 0.15 and β = 0.15; t i,0 Let C be the average travel time for road segment i. i V represents the traffic capacity of road segment i. i The actual traffic volume of road segment i;

[0080] Step 202: Update the road segment travel time t according to the road segment's slope. i ;

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

[0082] Specifically, if the average slope of the road segment is not less than the preset degree, the road segment travel time will be updated to the preset multiple of the original data.

[0083] As a preferred embodiment, if road segment i has a large slope, its average slope slop i If the temperature is ≥15 degrees, the passage conditions will be relatively difficult, and the passage time will increase accordingly. The adjusted passage time will be...

[0084] Step 203: 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... iGet the travel time T of the currently known shortest path from the starting point s to the destination node v. v ;

[0085] Specifically, the calculation formula is as follows:

[0086]

[0087] The travel time T of the shortest path v This is the sum of the travel times for all road segments from the starting point S to node V.

[0088] Step 204, 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.

[0089] Specifically, the initialization process is as follows:

[0090] 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.

[0091] Specifically, the iterative process is as follows:

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

[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 the two nodes.

[0094] 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;

[0095] when When it is empty or Tv 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.

[0096] Step 205: Based on the reachable nodes and reachable road segments within the first preset time, set a buffer zone for these road segments, and use the polygon formed by merging all buffer zones as the isochronous circle of the first preset time; based on the reachable nodes and reachable road segments within the second preset time, set a buffer zone for these road segments, and use the polygon formed by merging all buffer zones as the isochronous circle of the second preset time.

[0097] Specifically, ArcGIS software can be used to generate isochronous circles. Based on the calculation results of the above steps, the reachable nodes and accessible road segments within 15 minutes are identified. A buffer zone (which can be set to 100 meters) is set for these road segments, and the polygon formed by merging all buffer zones is used as the 15-minute isochronous circle. Similarly, a 30-minute isochronous circle is generated according to similar steps.

[0098] In another exemplary embodiment of this application, in order to achieve accurate division of the five-level concentric circle model, step 103 includes:

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

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

[0101] The first preset time isochronous circle, excluding the facility layer and the control layer, is taken as the core layer;

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

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

[0104] Specifically, the facilities layer includes the infrastructure layer, and the highway land boundary includes service areas, toll stations, interchanges, and the main road structure.

[0105] Specifically, the control layer is the highway construction control zone, extending 50 meters outward from the outer edge of the highway land. If there are relevant legal provisions, those provisions shall prevail.

[0106] Specifically, the core layer is the area accessible within 15 minutes of the entrance / exit, excluding the facility layer and the control layer.

[0107] Specifically, the radiation layer is the area that can be reached from the high-speed entrance / exit in more than 15 minutes but no more than 30 minutes.

[0108] Specifically, the edge layer refers to areas that are more than 30 minutes away from highway entrances and exits.

[0109] In another exemplary embodiment of this application, in order to modify the road space range according to different regional characteristics, such as Figure 4 Step 104 includes:

[0110] Step 301: Obtain data on the boundaries of ecological protection red lines, township-level administrative divisions, and per capita GDP.

[0111] Specifically, the above data was obtained from the relevant authorities and is used to correct for regional differences.

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

[0113] Specifically, the ecological protection red line, as a strictly prohibited development area, should have its boundaries deducted within the core layer.

[0114] Step 303: Using administrative divisions as boundaries, obtain the per capita GDP of township-level administrative divisions along the highway. If the per capita GDP of each township-level administrative division is greater than the per capita GDP of the city to which it belongs, extend the core layer outward by a preset distance to update the core layer, radiation layer and peripheral layer.

[0115] As a specific implementation method, using townships and subdistricts as boundaries, the per capita GDP of each township-level administrative division along the highway is denoted as follows: The per capita GDP of the city to which it belongs is denoted as If the township-level administrative division has high economic vitality Then, the core area of ​​the expressway within the jurisdiction should be appropriately extended, with an extension distance of [missing information]. This updates the core layer, radiation layer, and edge layer.

[0116] This application provides a method for quantitative delimitation of road space, specifically including the following technical features:

[0117] Traditional concentric circle division relies on geographical distance, but actual economic connections are more affected by time. Replacing fixed distance with isochronous circles, and quantifying and dividing concentric circles based on time costs, the target road area spatial range of the five-level concentric circles is more in line with the trend of economic development. This overcomes the ambiguity and subjectivity of traditional road area spatial definition methods, and significantly improves the scientific basis of spatial division and the accuracy of boundary definition.

[0118] In the process of obtaining the spatial range of the road area, this application makes corrections based on the regional characteristics and economic development characteristics of different regions, including: topographic correction (correction based on regional slope), ecological protection correction (correction based on ecological protection zones), and economic vitality correction (spatial correction based on GDP). Its adaptability and dynamism are significantly enhanced, enabling the concentric circle division method to flexibly adapt to the specific conditions of different regions (such as economically developed areas, underdeveloped areas, plains, mountains, etc.), dynamically adjust the scope of influence, and improve the universality and practicality of the method.

[0119] The target road area obtained in this application has a profound impact and enormous potential for economic development, and is of great significance for the rational layout of economic development. For example... Figure 5 The radiation layer features large, contiguous land areas with low plot ratios, low building density, and lower land prices on the city's outskirts, allowing for the acquisition of large land areas at low cost. It also exhibits higher ecological sensitivity and can be used for green spaces, rural areas, agriculture, ecotourism, forestry, and other functional zones. The control layer aligns with intensive land use planning principles and typically utilizes medium to high plot ratios and vertical space, enabling the development of schools, hospitals, commercial spaces, residences, restaurants, hotels, and other functions to improve land use efficiency.

[0120] This application also provides an application scenario in which the above-described road space quantization and demarcation method is applied. Specifically, the road space quantization and demarcation method provided in this embodiment can be applied to scenarios within the boundary definition of a certain region.

[0121] For example, using the method described in this application to conduct concentric planning for a certain region, the obtained road network data includes highways, national highways, provincial highways, expressways, arterial roads, and secondary arterial roads within a preset range. In the initial obtained road space, the facility layer area is approximately 34.38 square kilometers; the control layer area is approximately 39.28 square kilometers; the core layer area is approximately 1163.27 square kilometers; and the radiation layer area is approximately 1910.82 square kilometers. After modification using the method described in this application, the facility layer area remains approximately 34.38 square kilometers; the control layer area remains approximately 39.28 square kilometers; the core layer area decreases by 121.92 square kilometers to approximately 1041.35 square kilometers; and the radiation layer area increases by 121.92 square kilometers to approximately 2032.74 square kilometers. (To avoid sensitive content, the specific region and the concentric map obtained after implementation are not mentioned. Relevant information can be provided later as needed.)

[0122] Based on the same inventive concept, this application also provides a road space quantization and demarcation device for implementing the road space quantization and demarcation method described above. The solution provided by this device is similar to the solution described in the above method; therefore, the specific limitations in one or more road space quantization and demarcation device embodiments provided below can be found in the limitations of the road space quantization and demarcation method described above, and will not be repeated here.

[0123] In one exemplary embodiment, such as Figure 6 As shown, a road space quantization and demarcation device is provided, comprising:

[0124] The topology building module is used to acquire road network data and construct the traffic road network topology based on the road network data;

[0125] The circle delineation module is used for:

[0126] Starting from the highway entrance / exit, a first preset time isochronous circle and a second preset time isochronous circle are obtained based on the traffic network topology; wherein, the first preset time is less than the second preset time;

[0127] 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;

[0128] The correction module is used to make differential corrections to the initial road space range to obtain the target road space range.

[0129] As an optional implementation, the layer delineation module is specifically used for:

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

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

[0132] The first preset time isochronous circle, excluding the facility layer and the control layer, is taken as the core layer;

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

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

[0135] As an optional implementation, the layer delineation module is also specifically used for:

[0136] 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;

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

[0138] Let S be the set of starting points at highway entrances and exits, and V be the set of destination points at traffic transition nodes, based on the travel time t of the road segment. i Get the travel time T of the currently known shortest path from the starting point s to the destination node v. v ;

[0139] 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;

[0140] 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.

[0141] 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.

[0142] As an optional implementation, the layer delineation module is also specifically used for:

[0143] 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.

[0144] 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;

[0145] 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.

[0146] when When it is empty or T v Path searching stops when the first preset time is exceeded, at which point T vThe 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;

[0147] 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.

[0148] As an optional implementation, the layer delineation module is also specifically used for:

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

[0150] As an optional implementation, the topology building module is also used for:

[0151] Obtain road network data and construct an initial traffic network topology; for the initial traffic network topology, assign values ​​to road network traffic volume, average road network speed, and average road network travel time according to road level to obtain the traffic network topology.

[0152] As an optional implementation, the correction module is also used for:

[0153] The ecological protection red line boundary is removed from the core layer to update the core layer;

[0154] Using administrative divisions as boundaries, the per capita GDP of administrative divisions along the highway is obtained. If the per capita GDP of each administrative division is greater than the per capita GDP of the city to which it belongs, the core layer is extended outward by a preset distance to update the core layer, the radiation layer, and the peripheral layer.

[0155] In one exemplary embodiment, a computer device is provided, which may be a server or a terminal, and its internal structure diagram may be as follows. Figure 7As shown, this computer device includes a processor, memory, input / output interfaces (I / O), and a communication interface. The processor, memory, and I / O interfaces are connected via a system bus, and the communication interface is also connected to the system bus via the I / O interfaces. The processor provides computational and control capabilities. The memory includes non-volatile storage media and internal memory. The non-volatile storage media stores the operating system, computer programs, and a database. The internal memory provides the environment for the operating system and computer programs stored in the non-volatile storage media. The database stores data. The I / O interfaces are used for exchanging information between the processor and external devices. The communication interface is used for communicating with external terminals via a network. When executed by the processor, the computer program implements a road space quantization and delimitation method.

[0156] Those skilled in the art will understand that Figure 7 The structure shown is merely a block diagram of a portion of the structure related to the present application and does not constitute a limitation on the computer device to which the present application is applied. Specific computer devices may include more or fewer components than those shown in the figure, or combine certain components, or have different component arrangements.

[0157] In one exemplary embodiment, a computer device is also provided, including a memory and a processor, wherein the memory stores a computer program, and the processor executes the computer program to implement the steps in the above-described method embodiments.

[0158] In one exemplary embodiment, a computer-readable storage medium is provided storing a computer program that, when executed by a processor, implements the steps in the above-described method embodiments.

[0159] In one exemplary embodiment, a computer program product is provided, including a computer program that, when executed by a processor, implements the steps in the above-described 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 used for analysis, data stored, data displayed, etc.) involved in this application are all information and data authorized by the user or fully authorized by all parties, and the collection, use and processing of the relevant data must comply with relevant regulations.

[0161] Those skilled in the art will understand that all or part of the processes in the methods of the above embodiments can be implemented by a computer program instructing related hardware. The computer program can be stored in a non-volatile computer-readable storage medium. When executed, the computer program can include the processes of the embodiments of the above methods. Any references to memory, databases, or other media used in the embodiments provided in this application can include at least one of non-volatile and volatile memory. Non-volatile memory can include read-only memory (ROM), magnetic tape, floppy disk, flash memory, optical memory, high-density embedded non-volatile memory, resistive random access memory (ReRAM), magnetic random access memory (MRAM), ferroelectric random access memory (FRAM), phase change memory (PCM), graphene memory, etc. Volatile memory can include random access memory (RAM) or external cache memory, etc. By way of illustration and not limitation, RAM can take many forms, such as Static Random Access Memory (SRAM) or Dynamic Random Access Memory (DRAM).

[0162] The databases involved in the embodiments provided in this application may include at least one type of relational database and non-relational database. Non-relational databases may include, but are not limited to, blockchain-based distributed databases. The processors involved in the embodiments provided in this application may be general-purpose processors, central processing units, graphics processing units, digital signal processors, programmable logic devices, quantum computing-based data processing logic devices, etc., and are not limited to these.

[0163] The technical features of the above embodiments can be combined in any way. For the sake of brevity, not all possible combinations of the technical features in the above embodiments are described. However, as long as there is no contradiction in the combination of these technical features, they should be considered to be within the scope of this specification.

[0164] This document uses specific examples to illustrate the principles and implementation methods of this application. The descriptions of the above embodiments are only for the purpose of helping to understand the methods and core ideas of this application. At the same time, for those skilled in the art, there will be changes in the specific implementation methods and application scope based on the ideas of this application. In summary, the content of this specification should not be construed as a limitation of this application.

Claims

1. A method for quantitative delimitation of road space, characterized in that, The road space quantization and delimitation method includes: Acquire road network data and construct a traffic road network topology based on the road network data; Starting from the highway entrance / exit, a first preset time isochronous circle and a second preset time isochronous circle are obtained according to the traffic network topology; wherein, the first preset time is less than the second preset time; 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; The target road space range is obtained by performing differential correction on the preliminary road space range.

2. The road space quantization and demarcation method according to claim 1, characterized in that, The step of obtaining the preliminary road space range based on the first preset time isochronous circle and the second preset time isochronous circle includes: In the transportation network topology, the area within the highway land boundary is taken as the facility layer; The highway construction control zone is used as the control layer; The core layer is defined as the range of the first preset time isochronous circle excluding the facility layer and the control layer. The range of the second preset time isochronous circle minus the first preset time isochronous circle is taken as the radiation layer; The area outside the second preset time isochronous circle is used as the edge layer.

3. The road space quantization and demarcation method according to claim 1, characterized in that, The process of obtaining a first preset time isochronous circle and a second preset time isochronous circle based on the traffic network topology and the road segment travel time, starting from the highway entrance / exit, includes: 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; The road segment travel time t is adjusted and updated based on the road segment's slope. i ; 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 ; 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; 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. 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.

4. The road space quantization and demarcation method according to claim 3, characterized in that, The travel time T based on the shortest path v Get the reachable nodes and reachable road segments that can be reached from the starting point set S within the preset first time; Obtain the reachable nodes and reachable road segments that can be reached from the starting point set S within a preset second time period; including: 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. 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; 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. 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; 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.

5. The road space quantization and demarcation method according to claim 3, characterized in that, The road segment travel time t is updated based on the slope of the road segment. i ,include: If the average slope of the road section is not less than the preset degree, the travel time t of the road section will be... i Update to the preset multiple of the original data.

6. The road space quantization and demarcation method according to claim 1, characterized in that, The construction of the traffic network topology based on the road network data includes: Obtain road network data and construct an initial traffic network topology; for the initial traffic network topology, assign values ​​to road network traffic volume, average road network speed, and average road network travel time according to road level to obtain the traffic network topology.

7. The road space quantization and demarcation method according to claim 1, characterized in that, The process involves performing differential corrections on the initial road space range to obtain the target road space range, including: The ecological protection red line boundary is deducted from the core layer to update the core layer; Using administrative divisions as boundaries, obtain the per capita GDP of the administrative divisions along the highway route. If the per capita GDP of each administrative division is greater than the per capita GDP of the city to which it belongs, extend the core layer outward by a preset distance to update the core layer, the radiation layer, and the edge layer.

8. A road space quantitative demarcation device, characterized in that, The road space quantization and demarcation device includes: The topology construction module is used to acquire road network data and construct a traffic road network topology based on the road network data. The circle delineation module is used for: Starting from the highway entrance / exit, a first preset time isochronous circle and a second preset time isochronous circle are obtained according to the traffic network topology; wherein, the first preset time is less than the second preset time; 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; The correction module is used to perform differential correction on the preliminary road space range to obtain the target road space range.

9. 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 space quantization and demarcation method according to any one of claims 1-7.

10. A computer-readable storage medium having a computer program stored thereon, characterized in that, When executed by a processor, the computer program implements the steps of the road space quantization and demarcation method as described in any one of claims 1-7.

Images