Rural highway connected path calculation method and device and electronic equipment

Abstract

The invention provides a rural highway connected path calculation method and device and electronic equipment. The method comprises the following steps: acquiring road network data of a current area to construct a rural highway road network data set; generating an important node set based on preset important node attributes; calculating a target path and a linear distance between the current important node and other nodes through a preset distance calculation method; screening the to-be-judged paths with the same computational nodes, calculating the path ratio of the to-be-judged paths, and determining the to-be-judged paths with the path ratio greater than a first preset threshold value as newly added paths; calculating a path weighting score of the to-be-judged path, and determining the to-be-judged path of which the path weighting score is greater than a second preset threshold value as a bottleneck path; and taking the newly added path and the bottleneck path as a to-be-planned path of the current area. In the mode, through construction of a complete road network data set and automatic path analysis, connectivity and efficiency of rural road network data processing calculation are improved, and support is provided for rural road network maintenance and reconstruction and extension planning.

Description

Technical Field

[0001] The present application relates to the technical field of road network planning, and in particular to a method, device and electronic equipment for calculating rural road connection paths. Background Art

[0002] In the analysis of rural road networks, there are problems such as disconnected road section data or local line duplication due to different management and maintenance units, which affects the connectivity and integrity of the existing rural road network. Existing processing methods usually rely on manual cleaning and adjustment of collected road network data, including manual identification of duplicate sections, repair of disconnected sections, and supplementation of node information, which is not only time-consuming and labor-intensive, but also prone to omissions or errors. Summary of the invention

[0003] In view of this, the purpose of this application is to provide a rural road connectivity path calculation method, device and electronic equipment, by building a complete road network data set and automated path analysis, to improve the connectivity and efficiency of rural road network data processing, and provide support for rural road network maintenance and renovation and expansion planning.

[0004] In the first aspect, the embodiment of the present application provides a method for calculating the connection path of rural roads, including: obtaining the road network data of the current area, and constructing a rural road network data set based on preset node attributes; the rural road network data set includes a rural road atlas, a node set and a node distance set; the node type of the node set includes a superior road network node; based on the preset important node attributes, the important nodes of the current area are determined, and an important node set is generated; through the preset distance calculation method, the important node set is traversed, and the target path and straight-line distance between the current important node and other nodes are calculated respectively; other nodes include other important nodes or other superior nodes in the important node set except the current important node Road network nodes; the target path includes the calculation node and the highway category; the straight-line distance includes the calculation node; from the target path and the straight-line distance, the to-be-judged paths with the same calculation node are screened, the path ratio of the to-be-judged paths is calculated, and the to-be-judged paths with a path ratio greater than a first preset threshold are determined as newly added paths; the path ratio is the ratio of the path distance of the target path to the straight-line distance; the path weighted score of the to-be-judged paths is calculated, and the to-be-judged paths with a path weighted score greater than a second preset threshold are determined as bottleneck paths; the path weighted score is the total score calculated based on the highway category of the to-be-judged paths and the preset weight value; the newly added paths and the bottleneck paths are used as the to-be-judged paths in the current area.

[0005] Furthermore, when the rural road network data set is a rural road atlas, the road network data of the current area is obtained, and the steps of constructing the rural road network data set based on the preset node attributes include: obtaining the rural road map data of the current area; the rural road map data includes county road map data, township road map data and village road map data; the rural road map data includes the geometric shape data and road network attribute data of each route; the road network attribute data includes route code, route mileage, route starting point pile number, route end point pile number, design speed and road category; the county road map data, township road map data and village road map data are converted into the rural road map data. The routes with the same geometric shape data, route code, route starting point pile number and route end point pile number as those in the village road map data are determined as the matching route group; the matching route group consists of at least two matching routes; it is determined whether the other road network attribute data of each matching route in the matching route group are the same; the other road network attribute data are the road network attribute data other than the route code, route starting point pile number and route end point pile number; if each other road network attribute data is the same, retain one matching route as the merged route; if one other road network attribute data is different, based on the preset merging rule, by merging the other road network attribute data, Merge the matched routes into a merged route; update the route based on the merged route to obtain the updated route, and generate an initial rural road atlas based on the updated route and rural road map data; traverse the initial rural road atlas, and based on the preset first tolerance value, generate a first buffer zone at the current route starting point stake number and the current route ending point stake number of the current route respectively; determine whether the other route starting point stake number or other route ending point stake number of other routes is in the first buffer zone; other routes are routes other than the current route in the initial rural road atlas; if the other route starting point stake number or other route ending point stake number of another route is in the first buffer zone, record the current route and other routes as routes to be extended; determine whether the current route starting point stake number or the current route ending point stake number of the current route is the same as the starting point stake number or other route ending point stake number of other routes; if they are the same, connect the current route and other routes into an extended route; if they are not the same, connect the current route and other routes into an extended route based on the preset extension method; update the route based on the extended route to generate an updated route, and update the initial rural road atlas based on the updated route to generate a rural road atlas.

[0006] Furthermore, when the rural road network data set is a node set, the method also includes: identifying the first intersection of all routes in the rural road atlas, determining the intersection as a first target node, and adding the first target node to the node set; the first intersection is a geographical location where two or more routes intersect on a plane; the node type of the first target node is a common node; identifying the route starting point pile number and the route ending point pile number of each route, determining the route starting point pile number or the route ending point pile number that is not connected to other route starting point pile numbers or other route ending point pile numbers as a second target node, and adding the second target node to the node set; the node type of the second target node is an independent node; identifying bridges in the rural road atlas; generating a second buffer zone at the bridge based on a preset second tolerance value; judging the second buffer zone whether there is a node in the node set; if so, determine that the node is the third target node; if not, determine the second intersection of the route and the bridge as the third target node; save the third target node to the node set; the second intersection is a geographical location where at least one route and the bridge intersect on the plane; the node type of the third target node is a bridge node; obtain the superior road network data connected to the rural road map data; the superior road network data includes expressway map data, national highway map data and provincial highway map data; identify the third intersection of the route in the rural road map set and the superior road network data as the fourth target node; save the fourth target node to the node set; the third intersection is a geographical location where at least one route and the superior road network data intersect on the plane; the node type of the fourth target node is an superior road network node.

[0007] Furthermore, when the rural road network data set also includes a rural road section set, the method also includes: based on the nodes in the node set, dividing the routes in the rural road map set into multiple sections; each section corresponds to two nodes and one route; based on the road network attribute data and the node category, determining the section distance, design speed, number of bridge nodes and bridge technical condition assessment grade corresponding to each section; associating the section with the section distance, design speed, number of bridge nodes and bridge technical condition assessment grade and saving them as a rural road section set.

[0008] Furthermore, the node type also includes non-superior road network nodes; non-superior road network nodes are ordinary nodes, independent nodes and bridge nodes; when other nodes are other important nodes, the steps of traversing the important node set and calculating the target path and straight-line distance between the current important node and other nodes through a preset distance calculation method include: determining any important node in the important node set as the current important node, and the important nodes other than the current important node as other important nodes; based on the spatial topology analysis algorithm, the important node set and the non-superior road network nodes in the node set, determining the non-superior road network node with the shortest straight-line distance to the current important node as the first calculation Node, determine the non-superior road network node with the shortest straight-line distance to other important nodes as the second calculation node; based on the Dijkstra algorithm and the rural road network data set, calculate at least one first node path between the first calculation node and the second calculation node; sort the node paths based on the preset optimal path sorting standard to generate a first node path sorting; determine the first node paths before the preset number in the first node path sorting as the first target path, and save the first target path to the target path set; calculate the first straight-line distance between the first calculation node and the second calculation node, and save the first straight-line distance to the node distance set.

[0009] Furthermore, the node type also includes non-superior road network nodes; non-superior road network nodes are ordinary nodes, independent nodes and bridge nodes; when other nodes are other superior road network nodes, the steps of traversing the important node set and calculating the target path and straight-line distance between the current important node and other nodes by a preset distance calculation method include: determining any important node in the important node set as the current important node, and determining any superior road network node within the preset superior road network node range of the current important node in the node set as other superior road network nodes; based on the spatial topology analysis algorithm, the important node set and the non-superior road network nodes in the node set, determining the non-superior road network node with the shortest straight-line distance to the current important node. The upper-level road network node is the first calculation node, and the non-upper-level road network node with the shortest straight-line distance to other upper-level road network nodes is determined as the third calculation node; based on the Dijkstra algorithm and the rural road network data set, at least one second node path between the first calculation node and the third calculation node is calculated; the second node paths are sorted based on the preset optimal path sorting standard to generate a second node path sorting; the first preset number of second node paths in the second node path sorting are determined as the second target path, and the second target path is saved to the target path set; the second straight-line distance between the first calculation node and the third calculation node is calculated, and the second straight-line distance is saved to the node distance set.

[0010] Further, the target path set includes at least one target path; the target path set is associated with and stores the path distance corresponding to the target path; the node distance set includes at least one straight-line distance; from the target paths and the straight-line distances, the paths to be judged with the same calculation nodes are screened, the path ratios of the paths to be judged are calculated, and the paths to be judged with the path ratios greater than a first preset threshold are determined as newly added paths, including: based on the calculation nodes of the straight-line distances, determining the target paths in the target path set that are the same as the calculation nodes of the straight-line distances as the paths to be judged; determining the ratio of the path distance of the paths to be judged to the straight-line distance as the path ratio; determining whether the path ratio is greater than the first preset threshold; if so, determining that the paths to be judged are newly added paths, and saving the newly added paths to the newly added path set.

[0011] Furthermore, the target path set is associated with and stores at least one highway category corresponding to the target path; the step of calculating the path weighted score of the path to be judged, and determining the path to be judged whose path weighted score is greater than a second preset threshold as a bottleneck path includes: obtaining the highway category of each path to be judged; calculating the path weighted score of each path to be judged based on the preset weight value and the highway category; determining whether the path weighted score is greater than the second preset threshold; if so, determining that the path to be judged is a bottleneck path, and saving the bottleneck path to the bottleneck path set.

[0012] In a second aspect, an embodiment of the present application provides a rural road connectivity path calculation device, including: a set generation module, used to obtain road network data of the current area, and construct a rural road network data set based on preset node attributes; the rural road network data set includes a rural road atlas, a node set and a node distance set; the node type of the node set includes a superior road network node; the set generation module is also used to determine the important nodes of the current area based on preset important node attributes and generate an important node set; a calculation module is used to traverse the important node set through a preset distance calculation method, and calculate the target path and straight-line distance between the current important node and other nodes; other nodes include other important nodes or other superior road network nodes in the important node set except the current important node; the target The path includes a calculation node and a road category; the straight-line distance includes the calculation node; the to-be-planned path judgment module is used to screen the to-be-judged paths with the same calculation nodes from the target path and the straight-line distance, calculate the path ratio of the to-be-judged paths, and determine the to-be-judged paths with a path ratio greater than a first preset threshold as newly added paths; the path ratio is the ratio of the path distance of the target path to the straight-line distance; the to-be-planned path judgment module is also used to calculate the path weighted score of the to-be-judged path, and determine the to-be-judged path with a path weighted score greater than a second preset threshold as a bottleneck path; the path weighted score is the total score calculated based on the road category of the to-be-judged path and the preset weight value; the to-be-planned path judgment module is also used to use the newly added path and the bottleneck path as the to-be-judged paths in the current area.

[0013] In a third aspect, an embodiment of the present application provides an electronic device, including a processor and a memory, wherein the memory stores computer executable instructions that can be executed by the processor, and the processor executes the computer executable instructions to implement the rural road connectivity path calculation method of the first aspect mentioned above.

[0014] The embodiment of the present application provides a method, device and electronic device for calculating the connection path of rural roads, including: obtaining the road network data of the current area, constructing a rural road network data set based on preset node attributes; the rural road network data set includes a rural road atlas, a node set and a node distance set; the node type of the node set includes a superior road network node; based on the preset important node attributes, the important nodes of the current area are determined, and an important node set is generated; through the preset distance calculation method, the important node set is traversed, and the target path and straight-line distance between the current important node and other nodes are calculated respectively; other nodes include other important nodes in the important node set except the current important node or other important nodes in the important node set The upper-level road network node; the target path includes the calculation node and the road category; the straight-line distance includes the calculation node; from the target path and the straight-line distance, the to-be-judged paths with the same calculation node are screened, the path ratio of the to-be-judged paths is calculated, and the to-be-judged paths with a path ratio greater than the first preset threshold are determined as the newly added paths; the path ratio is the ratio of the path distance of the target path to the straight-line distance; the path weighted score of the to-be-judged paths is calculated, and the to-be-judged paths with a path weighted score greater than the second preset threshold are determined as bottleneck paths; the path weighted score is the total score calculated based on the road category and the preset weight value of the to-be-judged paths; the newly added paths and the bottleneck paths are used as the to-be-planned paths in the current area. In this method, the rural road map data is automatically processed to solve the problems of route disconnection and duplicate data caused by different management and maintenance units, and reduce the workload of manual processing. By constructing a complete rural road network data set, including a map set, a node set, and a node distance set, the data quality and connectivity are improved. By providing a target path calculation method between important nodes and from nodes to the upper-level road network, combined with the Dijkstra algorithm and spatial topology analysis, it supports the shortest path in time, straight-line distance and multi-path selection, and realizes the accurate identification of new paths and bottleneck paths, providing a basis for optimizing the rural road network. It supports the processing of rural road map data, node data and distance data between nodes, adapts to the needs of different data sources and usage scenarios, and ensures the integrity and consistency of data through merging rules and buffer zone analysis. Through the calculation of path ratio and path weighted score, it identifies the optimization target, puts forward planning suggestions for new paths and bottleneck paths, and improves the scientific nature and decision-making efficiency of road network planning. By building a complete rural road network data set, combined with automated path calculation and planning analysis, it significantly improves the efficiency of road network data processing, path analysis accuracy and planning decision support capabilities, and provides an important technical means for optimizing the rural road network structure.

[0015] Other features and advantages of the present application will be described in the following description, and partly become apparent from the description, or understood by practicing the present application. The purpose and other advantages of the present application are realized and obtained by the structures specifically pointed out in the description, claims and drawings.

[0016] In order to make the above-mentioned objects, features and advantages of the present application more obvious and easy to understand, preferred embodiments are specifically cited below and described in detail with reference to the attached drawings. BRIEF DESCRIPTION OF THE DRAWINGS

[0017] In order to more clearly illustrate the specific implementation methods of the present application or the technical solutions in the prior art, the drawings required for use in the specific implementation methods or the description of the prior art will be briefly introduced below. Obviously, the drawings described below are some implementation methods of the present application. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying any creative work.

[0018] Figure 1 A flow chart of a method for calculating rural road connectivity paths provided in an embodiment of the present application; Figure 2 A schematic diagram of a rural road connection path calculation device provided in an embodiment of the present application; Figure 3 A schematic diagram of the structure of an electronic device provided in an embodiment of the present application.

[0019] Icon: 1-set generation module; 2-calculation module; 3-path determination module to be planned; 301-processor; 302-memory; 303-bus; 304-communication interface. DETAILED DESCRIPTION

[0020] In order to make the purpose, technical solution and advantages of the embodiments of the present application clearer, the technical solution of the present application will be clearly and completely described below in conjunction with the accompanying drawings. Obviously, the described embodiments are part of the embodiments of the present application, not all of the embodiments. Based on the embodiments in the present application, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present application.

[0021] To facilitate understanding of this embodiment, the embodiments of the present application are described in detail below.

[0022] Embodiment 1: Figure 1 A flow chart of a method for calculating rural road connectivity paths provided in an embodiment of the present application.

[0023] Reference Figure 1 , the rural road connectivity path calculation method includes: Step S101, obtain the road network data of the current area, and construct a rural road network dataset based on preset node attributes; the rural road network dataset includes a rural road map set, a node set and a node distance set; the node type of the node set includes an upper-level road network node.

[0024] Here, the road network data is the pre-collected rural road map data of the current area, including county roads, township roads, village roads, and the upper-level road network data connected thereto (such as expressways, national roads, and provincial roads).

[0025] Rural road map data includes the geometry data and road network attribute data of each route. The rural road map data set includes the geometry, route code, start and end pile numbers, mileage, design speed and road category of each route.

[0026] Node types include upper-level road network nodes, ordinary nodes, bridge nodes and independent nodes.

[0027] The node distance set is used to record information such as the mileage of the paths between nodes, the design speed, the number of bridge nodes, and the bridge technical condition assessment level.

[0028] The problem of route disconnection caused by different management and maintenance units is solved by deleting duplicate linear section data, using buffer analysis and extension methods.

[0029] In one embodiment, when the rural road network dataset is a rural road atlas, the steps of step S101 include the following steps S201-S211.

[0030] Step S201, obtaining rural road map data of the current area; the rural road map data includes county road map data, township road map data and village road map data; the rural road map data includes geometric shape data and road network attribute data of each route; the road network attribute data includes route code, route mileage, route starting point pile number, route end point pile number, design speed and road category.

[0031] Here, the rural road map data of the current area is obtained, including county road map data, township road map data and village road map data. These data usually come from the GIS (geographic information system) platform or the public transportation network data of the government transportation department.

[0032] Each route contains the following information: geometric shape data and road network attribute data. The geometric shape data is the spatial trajectory of the route (such as polyline coordinates). The road network attribute data includes route code, route mileage, route starting point pile number, route end point pile number, design speed and road category (such as county road, township road, village road).

[0033] Step S202, determining the routes with the same geometric shape data, route code, route starting point pile number and route ending point pile number in the county road map data, township road map data and village road map data as a matching route group; the matching route group consists of at least two matching routes.

[0034] Here, the matching route group includes at least two routes having the same geometric shape data, route code, starting point pile number and end point pile number.

[0035] Traverse all county roads, township roads and village roads data, and divide the routes that meet the above conditions into a matching route group, each matching route group contains at least two matching routes.

[0036] Step S203, determining whether other road network attribute data of each matching route in the matching route group are the same; other road network attribute data are road network attribute data except the route code, the starting point pile number of the route and the end point pile number of the route.

[0037] Here, other road network attribute data include route mileage, design speed and highway category.

[0038] If the other attribute data of all matching routes are completely consistent, it is considered that the group of matching routes can be directly merged into one route. If there are different attribute values, they need to be processed according to the preset merging rules.

[0039] Step S204, if each other road network attribute data is the same, retain one matching route as the merged route; if one other road network attribute data is different, based on a preset merging rule, merge the matching routes into one merged route by merging the other road network attribute data.

[0040] Here, if all attribute data of the matching routes are the same, only one route is retained, which is called the merged route.

[0041] If there are different attribute values, other attribute data are merged according to the preset merging rules. For example, take the average value or select a larger value for the mileage, select a lower value for the design speed to ensure safety, and use the merged route as the new merged route.

[0042] Step S205, updating the route based on the merged route to obtain an updated route, and generating an initial rural road atlas based on the updated route and the rural road map data.

[0043] Here, the merged route data is used to replace the original matching route group to obtain an updated route set, and all updated routes are integrated into the initial rural road atlas.

[0044] Step S206, traversing the initial rural road atlas, and generating a first buffer zone at the current route starting point pile number and the current route ending point pile number of the current route based on a preset first tolerance value.

[0045] Here, based on the starting point and end point of each route, a buffer zone with a radius of a preset first tolerance value is generated. The first tolerance value is preset according to actual conditions and can be set to 10 meters. The buffer zone is used to detect whether the starting point or end point of other routes falls into it.

[0046] Step S207, determining whether the starting point pile numbers of other routes or the ending point pile numbers of other routes are in the first buffer zone; other routes are routes other than the current route in the initial rural road atlas.

[0047] Step S208: If the starting point pile number of another route or the ending point pile number of another route is in the first buffer, the current route and the other route are recorded as routes to be extended.

[0048] Here, other routes (ie routes other than the current route) are traversed, and if their starting points or end points fall into the first buffer zone, the current route and the route are recorded as routes to be extended.

[0049] Step S209, determining whether the current route starting point pile number or the current route end point pile number of the current route is the same as the starting point pile number of other routes or the end point pile number of other routes.

[0050] Here, if they are not the same, the two routes are connected into one extended route according to a preset extension method (such as linear interpolation or directional extension).

[0051] Step S210: If they are the same, the current route and the other route are connected to form an extended route; if they are not the same, based on a preset extension method, the current route and the other route are connected to form an extended route.

[0052] Here, if the starting point pile number or the ending point pile number of the route to be extended is the same as the starting point pile number or the ending point pile number of the current route, they are directly connected to form an extended route.

[0053] Step S211, updating the route based on the extended route to generate an updated route, and updating the initial rural road atlas based on the updated route to generate a rural road atlas.

[0054] Here, the route to be extended and the current route are replaced by the extended route to obtain an updated route set, and the final rural road atlas is generated based on the updated route set as a complete road network dataset.

[0055] In one embodiment, when the rural road network dataset is a node set, the method further includes the following steps S301-S308.

[0056] Step S301, identifying the first intersection of all routes in the rural road atlas, determining the intersection as the first target node, and adding the first target node to the node set; the first intersection is the geographical location where two or more routes intersect on the plane; the node type of the first target node is a common node.

[0057] Here, ordinary nodes are route intersections.

[0058] Using the spatial topology analysis algorithm, all routes in the rural road atlas are traversed to detect the intersecting or overlapping geometric positions. The spatial coordinates of each intersection are recorded and a unique identifier is generated. All identified intersections are marked as common nodes and added to the node set.

[0059] Step S302, identifying the route starting point stake number and route ending point stake number of each route, determining the route starting point stake number or route ending point stake number that is not connected to other route starting point stake numbers or other route ending point stake numbers as the second target node, and adding the second target node to the node set; the node type of the second target node is an independent node.

[0060] Here, independent nodes are unconnected start and end points.

[0061] Traverse all routes in the rural road atlas, check whether the starting and ending points match the endpoints of other routes, use the spatial distance threshold (such as an accuracy of 1 meter) to determine whether they are connected, mark the unconnected starting and ending stakes as independent nodes, and add them to the node set.

[0062] Step S303, identifying bridges in the rural road atlas.

[0063] Here, bridges are special sections of rural roads that pass through rivers, ditches or other obstacles. All bridge-related attributes, including the geographical location of the bridge, technical condition assessment level, etc., are extracted from the map data to identify the bridge.

[0064] Step S304: generating a second buffer zone at the bridge based on a preset second tolerance value.

[0065] Here, based on the bridge position, a buffer zone with a radius of a preset second tolerance value (such as 5 meters) is generated to detect whether there is an existing node. The second tolerance value is preset according to actual conditions and can be set to 5 meters.

[0066] Step S305, determining whether there is a node in the node set in the second buffer.

[0067] Step S306, if it exists, determine the node as the third target node; if it does not exist, determine the second intersection of the route and the bridge as the third target node; save the third target node to the node set; the second intersection is a geographical location where at least one route and the bridge intersect on the plane; the node type of the third target node is a bridge node.

[0068] Here, the bridge node is a node within the bridge buffer.

[0069] Check whether there are nodes in the bridge buffer that have been added to the node set. If there are nodes in the buffer, mark the nodes in the buffer as bridge nodes and update the node attributes to the third target node. If there are no nodes in the buffer, add a new node at the intersection of the bridge and the corresponding route and mark it as a bridge node.

[0070] Step S307, obtaining the upper-level road network data connected to the rural road map data; the upper-level road network data includes expressway map data, national road map data and provincial road map data.

[0071] Here, the superior road network includes high-level roads such as expressways, national roads, and provincial roads.

[0072] All routes connected to rural roads are extracted from the superior road network map data, including their geometry, road network attributes and other information.

[0073] Step S308, identifying the third intersection of the route in the rural road atlas and the superior road network data as the fourth target node; saving the fourth target node to the node set; the third intersection is the geographical location where at least one route intersects with the superior road network data on the plane; the node type of the fourth target node is the superior road network node.

[0074] Here, the upper-level road network node is the intersection point with the upper-level road network.

[0075] Through spatial topological analysis, the intersections between the routes in the rural road atlas and the superior road network data are detected, the spatial coordinates are recorded for each intersection, and a unique identifier is generated. All identified intersections are marked as superior road network nodes and added to the node set.

[0076] In one embodiment, when the rural road network dataset further includes a rural road segment set, the method further includes the following steps S401 - S403 .

[0077] Step S401, based on the nodes in the node set, the routes in the rural road atlas are divided into multiple sections; each section corresponds to two nodes and one route.

[0078] Here, each route in the rural road atlas is traversed and divided according to the intersection of the route and the nodes in the node set. The starting point and the end point of each route correspond to the nodes in the node set.

[0079] Each divided road segment contains the following information: start node, end node, original route code and divided geometric shape data.

[0080] Step S402, based on the road network attribute data and node categories, determine the road section distance, design speed, number of bridge nodes and bridge technical condition assessment level corresponding to each road section.

[0081] Here, the segment distance refers to the actual route length between the start node and the end node.

[0082] Using the route geometry data, calculate the total length of the route segment (e.g. using the length calculation function of a GIS tool).

[0083] The design speed attributes of the corresponding routes are extracted from the rural road atlas. If a road section passes through multiple design speed intervals, the lowest design speed is calculated to ensure safety.

[0084] Obtain the node coordinates belonging to the bridge node from the node set, check whether the geometric shape of the road section passes through the bridge node, and count the number of bridge nodes in each road section. Each bridge node contains the technical condition assessment grade of the bridge (such as A, B, C, D). If the road section contains multiple bridge nodes, select the lowest grade among the bridge technical condition assessment grades as the bridge technical condition assessment result of the road section.

[0085] Step S403, associate the road sections with the road section distance, the design speed, the number of bridge nodes and the bridge technical condition assessment grade and save them as a rural highway section set.

[0086] Here, the road segment set is saved in the form of structured data (such as a database table, GIS layer, or JSON file) for subsequent path analysis and planning.

[0087] Step S102: determining important nodes in the current area based on preset important node attributes, and generating an important node set.

[0088] Here, important node attributes include towns, administrative villages, industrial parks, intersections between urban areas and suburbs, and other places with geographical or economic significance.

[0089] Important nodes are extracted from the road network dataset according to preset attributes to generate an important node set, wherein each node in the important node set has a unique identifier and contains spatial coordinates and attribute information.

[0090] Step S103, traverse the important node set through a preset distance calculation method, calculate the target path and straight-line distance between the current important node and other nodes; other nodes include other important nodes or other upper-level road network nodes in the important node set except the current important node; the target path includes the calculation node and the road category; the straight-line distance includes the calculation node.

[0091] Here, the current node is an important node in the current calculation, and other nodes are other important nodes or upper-level road network nodes in the important node set except the current node.

[0092] Use the spatial topology analysis algorithm to determine the nearest road network nodes of the current node and other nodes. Calculate the target path between the nearest road network nodes based on the Dijkstra algorithm (single-source shortest path algorithm). The path information includes node sequence, path distance, design speed, bridge nodes and their technical condition assessment level, etc.

[0093] Calculate the straight-line distance between the current node and other nodes and save it to the inter-node distance set.

[0094] In one embodiment, the node type also includes non-upper level road network nodes; non-upper level road network nodes are common nodes, independent nodes and bridge nodes. When the other nodes are other important nodes, the steps of step S103 include the following steps S501-S506.

[0095] Step S501: determine any important node in the important node set as the current important node, and the important nodes other than the current important node as other important nodes.

[0096] Here, one important node is selected as the current node each time, and the remaining nodes are selected as target nodes, and they are traversed one by one to achieve full coverage.

[0097] Step S502, based on the spatial topology analysis algorithm, the important node set and the non-upper-level road network nodes in the node set, determine the non-upper-level road network node with the shortest straight-line distance to the current important node as the first calculation node, and determine the non-upper-level road network node with the shortest straight-line distance to other important nodes as the second calculation node.

[0098] Here, based on the spatial topology analysis, the nearest non-superior road network node is found, and the non-superior road network node with the closest straight-line distance to the current important node is determined as the first calculation node. For each other important node, the non-superior road network node with the closest straight-line distance is determined as the second calculation node.

[0099] Step S503, based on the Dijkstra algorithm and the rural road network data set, calculate at least one first node path between the first computing node and the second computing node.

[0100] Here, the Dijkstra algorithm is used to calculate the path from the first computing node to the second computing node based on the distance between the nodes and the design speed.

[0101] Each path records the following information: node sequence, total path distance, design speed, whether it passes through a bridge, and the bridge technical condition assessment level.

[0102] Calculate at least one first node path and save all possible paths Step S504: sort the node paths based on a preset optimal path sorting standard to generate a first node path sorting.

[0103] Here, the optimal path sorting standard is pre-set according to the actual situation, and the path with the shortest total distance may be given priority, the path with a higher design speed may be given priority, and the path with a higher technical assessment level of the bridge condition may be given priority. The optimal path is placed in the front row and saved to generate the first node path sorting.

[0104] Step S505: determine the first preset number of first node paths in the first node path sorting as first target paths, and save the first target paths to the target path set.

[0105] Here, from the first node path sorting, a preset number of paths (such as the first 3) are selected as the first target path, and the first target path is saved to the target path set. The target path set includes the path sequence, path length, and path attributes (such as design speed, number of bridges, etc.).

[0106] Step S506, calculating a first straight-line distance between the first computing node and the second computing node, and saving the first straight-line distance to an inter-node distance set.

[0107] Here, the first straight-line distance refers to the shortest Euclidean distance between the current node and the target node, and the calculated first straight-line distance is saved in the inter-node distance set.

[0108] In one embodiment, when the other nodes are other upper-level road network nodes, the steps of step S103 include the following steps S601-S606.

[0109] Step S601, determining any important node in the important node set as the current important node, and determining any upper-level road network node within the preset upper-level road network node range of the current important node in the node set as other upper-level road network nodes.

[0110] Here, within the preset upper-level road network node range of the current important node, an upper-level road network node is determined as the other upper-level road network node for calculating the path.

[0111] Step S602, based on the spatial topology analysis algorithm, the important node set and the non-upper-level road network nodes in the node set, determine the non-upper-level road network node with the shortest straight-line distance to the current important node as the first calculation node, and determine the non-upper-level road network node with the shortest straight-line distance to other upper-level road network nodes as the third calculation node.

[0112] Here, among the non-superior road network nodes in the node set, a node with the shortest straight-line distance to the current important node is selected as the first calculation node. The first calculation node can be a common node, an independent node or a bridge node, depending on the spatial relationship between the node and the current important node.

[0113] Among the non-upper-level road network nodes in the node set, a node with the shortest straight-line distance to other upper-level road network nodes is selected as the third computing node. The third computing node is a key node connected to the upper-level road network node, which may be a common node or a bridge node.

[0114] Step S603, based on the Dijkstra algorithm and the rural road network data set, calculate at least one second node path between the first computing node and the third computing node.

[0115] Here, the Dijkstra algorithm is used to calculate the path from the first computing node to the third computing node. The Dijkstra algorithm is based on graph theory and selects the path with the shortest distance by gradually exploring all possible paths.

[0116] The calculated path will include all passed nodes and the total length of the path, and will be saved as the second node path.

[0117] Step S604: sort the second node paths based on a preset optimal path sorting standard to generate a second node path sorting.

[0118] Here, the second node paths are sorted according to a sorting standard to generate a second node path sorting.

[0119] Step S605: determine the first preset number of second node paths in the second node path sorting as second target paths, and save the second target paths to the target path set.

[0120] Here, according to a preset number (such as the first 3 paths), the first preset number of paths are selected from the path sorting result as the second target paths, and the selected second target paths are saved in the target path set.

[0121] Step S606: Calculate the second straight-line distance between the first computing node and the third computing node, and save the second straight-line distance to the inter-node distance set.

[0122] Here, for the first computing node and the third computing node, the second straight-line distance between them, that is, the shortest straight-line distance between two points, is calculated using the Euclidean distance formula, and the calculated second straight-line distance is saved in the inter-node distance set.

[0123] Step S104, from the target path and the straight-line distance, select the to-be-judged paths with the same calculation nodes, calculate the path ratio of the to-be-judged paths, and determine the to-be-judged paths with path ratios greater than a first preset threshold as new paths; the path ratio is the ratio of the path distance of the target path to the straight-line distance.

[0124] Here, the newly added path indicates that the current road network may need to plan new rural roads to shorten the travel distance between nodes.

[0125] From the target path and straight-line distance, filter out the paths with the same calculation nodes (the same start and end points).

[0126] Path ratio = path distance of target path ÷ corresponding straight-line distance.

[0127] Determine whether the path ratio is greater than a first preset threshold, and if so, determine the path as a new path. The first preset threshold is pre-set according to the actual terrain (plain, light hill, mountain, heavy hill), population and area, and is used to define the rationality of the path ratio.

[0128] In one embodiment, the target path set includes at least one target path; the target path set is associated with and stores the path distance corresponding to the target path; and the node distance set includes at least one straight-line distance. Step S104 includes the following steps S701-S704.

[0129] Step S701 : based on the calculation node of the straight-line distance, determine the target path in the target path set that is the same as the calculation node of the straight-line distance as the path to be determined.

[0130] Here, the calculation node is a node determined by a spatial analysis algorithm and having the shortest straight-line distance to other nodes.

[0131] By comparing each path in the target path set, the paths whose nodes (i.e., the starting point, end point, or intermediate node of the path) are the same as the calculation nodes of the straight-line distance are selected as the paths to be judged.

[0132] Step S702: determine the ratio of the path distance to the straight-line distance of the path to be determined as the path ratio.

[0133] Here, the path distance refers to the total length of the path to be determined, and the path distance is the sum of the distances calculated sequentially along each node of the selected path.

[0134] The path ratio is the ratio between the path distance and the straight-line distance of the path to be judged. .

[0135] The larger the path ratio is, the longer the path is relative to the straight-line distance, and there may be detours or unnecessary bends.

[0136] Step S703: determine whether the path ratio is greater than a first preset threshold.

[0137] Here, for example, when the first preset threshold is set to 1.5, it means that if the path ratio is greater than 1.5, it indicates that there is an obvious detour or bend in the path.

[0138] Step S704: if yes, determine that the path to be determined is a newly added path, and save the newly added path to the newly added path set.

[0139] Here, if the path ratio of the path to be determined is greater than the first preset threshold, it means that the path may not be efficient enough or there is room for optimization. Therefore, the path is regarded as a newly added path, that is, it is necessary to further consider whether it should be included in the planning scope.

[0140] The newly added paths that meet the conditions are saved in the newly added path set. The paths in the newly added path set can be used as candidate paths for subsequent optimization or re-planning.

[0141] Step S105, calculate the path weighted score of the path to be determined, and determine the path to be determined whose path weighted score is greater than the second preset threshold as the bottleneck path; the path weighted score is the total score calculated based on the road category of the path to be determined and the preset weight value.

[0142] Here, the road category (such as county road, township road, village road) of each path to be judged is obtained.

[0143] It is determined whether the weighted score of the path is greater than a second preset threshold, and if so, the path is determined as a bottleneck path. The bottleneck path refers to a path that is of high importance in the road network but may have functional limitations or need to be optimized first.

[0144] In one embodiment, the target path set is associated with and stores at least one road category corresponding to the target path. Step S105 includes the following steps S801-S804.

[0145] Step S801, obtaining the highway category of each path to be determined.

[0146] Here, the highway category refers to the management level of the highway to which the path belongs. The highway category of each path is determined based on the attributes of the road segments contained in the path. A path may pass through multiple road segments, and each road segment has its corresponding highway category.

[0147] The weighted average grade is calculated based on the length of the different road categories that the route passes through.

[0148] Step S802: Calculate the path weighted score of each path to be determined based on the preset weight value and the road category.

[0149] Here, the preset weight value is pre-set according to the actual situation, and each road category corresponds to a weight value to reflect its importance. For example, the weight value of county roads is set to 10, the weight value of township roads is set to 5, and the weight value of village roads is set to 2.

[0150] For each road segment in the route, multiply the weight value corresponding to its road category by the length of the segment: For example, a path consists of two sections: Section 1: County Road, 10 km long, weight 10; Section 2: Township Road, 5 km long, weight 5. The weighted score of the path is (10×10)+(5×5)=125.

[0151] Step S803: determine whether the path weighted score is greater than a second preset threshold.

[0152] Here, the second preset threshold is pre-set based on the regional planning goal and the path optimization requirement, and is used to identify the bottleneck path.

[0153] For each path to be judged, if the path weighted score is greater than the second preset threshold, it indicates that the path is important in the road network, but there may be constraints (such as being too narrow or overloaded), and it should be marked as a bottleneck path. For example, if the first preset threshold is set to 100, if the path weighted score is 125, then the path is determined to be a bottleneck path.

[0154] Step S804: if yes, determine that the path to be determined is a bottleneck path, and save the bottleneck path to a bottleneck path set.

[0155] Here, the identified bottleneck path is recorded in the bottleneck path set.

[0156] Step S106: The newly added path and the bottleneck path are used as paths to be planned in the current area.

[0157] Here, the newly added paths and bottleneck paths are integrated into a set of paths to be planned, which is used as the basis for optimizing the rural road network structure and for formulating renovation, expansion and maintenance plans.

[0158] The embodiment of the present application provides a method for calculating a rural road connection path, comprising: obtaining road network data of the current area, constructing a rural road network data set based on preset node attributes; the rural road network data set includes a rural road atlas, a node set and a node distance set; the node type of the node set includes a superior road network node; based on preset important node attributes, the important nodes of the current area are determined, and an important node set is generated; through a preset distance calculation method, the important node set is traversed to calculate the target path and the straight-line distance between the current important node and other nodes; other nodes include other important nodes or other superior road network nodes other than the current important node in the important node set point; the target path includes the calculation node and the road category; the straight-line distance includes the calculation node; from the target path and the straight-line distance, the to-be-judged paths with the same calculation nodes are screened, the path ratio of the to-be-judged paths is calculated, and the to-be-judged paths with a path ratio greater than the first preset threshold are determined as the newly added paths; the path ratio is the ratio of the path distance of the target path to the straight-line distance; the path weighted score of the to-be-judged paths is calculated, and the to-be-judged paths with a path weighted score greater than the second preset threshold are determined as bottleneck paths; the path weighted score is the total score calculated based on the road category and the preset weight value of the to-be-judged paths; the newly added paths and the bottleneck paths are used as the to-be-planned paths in the current area. In this method, by integrating multi-dimensional data such as straight-line distance, path distance, and road category, and combining the screening method of the target path and the bottleneck path, the accuracy of identifying the newly added paths and the bottleneck paths is improved. Automated processing and analysis of rural road map data solves the problems of data disconnection and path duplication caused by different management and maintenance units, reduces the need for manual intervention, and improves data processing efficiency. By rationally planning new paths and optimizing bottleneck paths, the connectivity, service capacity, and safety of the rural road network can be effectively improved to meet the travel needs of residents and economic development in the region. By constructing a comprehensive analysis method based on node and path attributes, new paths and bottleneck paths in the rural road network can be accurately identified, thereby improving the scientific nature and optimization efficiency of road network planning and providing a decision-making basis for the renovation, expansion and maintenance of rural roads.

[0159] Embodiment 2: Figure 2 Schematic diagram of a rural road connection path calculation device provided in an embodiment of the present application.

[0160] Reference Figure 2 , a rural road connection path calculation device, comprising: The collection generation module 1 is used to obtain the road network data of the current area and construct a rural road network dataset based on preset node attributes; the rural road network dataset includes a rural road map set, a node set and a node distance set; the node type of the node set includes an upper-level road network node.

[0161] The set generation module 1 is also used to determine the important nodes in the current area based on preset important node attributes and generate an important node set.

[0162] Calculation module 2 is used to traverse the important node set through a preset distance calculation method, and calculate the target path and straight-line distance between the current important node and other nodes; other nodes include other important nodes or other upper-level road network nodes in the important node set except the current important node; the target path includes the calculation node and the road category; the straight-line distance includes the calculation node.

[0163] The path judgment module 3 to be planned is used to screen the paths to be judged with the same calculation nodes from the target path and the straight-line distance, calculate the path ratio of the paths to be judged, and determine the paths to be judged with a path ratio greater than a first preset threshold as the newly added paths; the path ratio is the ratio of the path distance of the target path to the straight-line distance.

[0164] The module 3 for judging the path to be planned is also used to calculate the path weighted score of the path to be judged, and determine the path to be judged whose path weighted score is greater than the second preset threshold as the bottleneck path; the path weighted score is the total score calculated based on the road category of the path to be judged and the preset weight value.

[0165] The to-be-planned path judgment module 3 is further used to take the newly added path and the bottleneck path as the to-be-planned paths in the current area.

[0166] In one embodiment, when the rural road network dataset is a rural road atlas, the set generation module 1 is further used to: Get the rural road map data of the current area; the rural road map data includes county road map data, township road map data and village road map data; the rural road map data includes the geometric shape data and road network attribute data of each route; the road network attribute data includes route code, route mileage, route starting point pile number, route end point pile number, design speed and road category.

[0167] The routes with the same geometric shape data, route code, route starting point pile number and route ending point pile number in the county road map data, township road map data and village road map data are determined as a matching route group; the matching route group consists of at least two matching routes.

[0168] Determine whether other road network attribute data of each matching route in the matching route group are the same; other road network attribute data are road network attribute data except the route code, the starting point pile number of the route and the end point pile number of the route.

[0169] If each other road network attribute data is the same, retain one matching route as the merged route; if one other road network attribute data is different, based on the preset merging rule, the matching routes are merged into one merged route by merging the other road network attribute data.

[0170] The route is updated based on the merged route to obtain an updated route, and an initial rural road atlas is generated based on the updated route and the rural road map data.

[0171] The initial rural road atlas is traversed, and based on a preset first tolerance value, a first buffer zone is generated at a current route starting point pile number and a current route end point pile number of the current route respectively.

[0172] It is determined whether the starting point pile numbers of other routes or the ending point pile numbers of other routes are in the first buffer zone; other routes are routes other than the current route in the initial rural road atlas.

[0173] If the starting point pile number of another route or the end point pile number of another route is in the first buffer, the current route and the other route are recorded as the routes to be extended.

[0174] Determine whether the current route starting point pile number or the current route end point pile number of the current route is the same as the starting point pile number or the end point pile number of other routes.

[0175] If they are the same, the current route and the other routes are connected to form an extended route; if they are not the same, based on a preset extension method, the current route and the other routes are connected to form an extended route.

[0176] The route is updated based on the extended route to generate an updated route, and the initial rural road atlas is updated based on the updated route to generate a rural road atlas.

[0177] In one embodiment, when the rural road network data set is a node set, the set generation module 1 is further used to: Identify the first intersection of all routes in the rural road atlas, determine the intersection as the first target node, and add the first target node to the node set; the first intersection is the geographical location where two or more routes intersect on the plane; the node type of the first target node is a common node.

[0178] Identify the route starting point stake number and route ending point stake number of each route, determine the route starting point stake number or route ending point stake number that is not connected to other route starting point stake numbers or other route ending point stake numbers as the second target node, and add the second target node to the node set; the node type of the second target node is an independent node.

[0179] Identify bridges in the Rural Roads Atlas.

[0180] Based on a preset second tolerance value, a second buffer zone is generated at the bridge.

[0181] It is determined whether there is a node in the node set in the second buffer.

[0182] If it exists, determine the node as the third target node; if it does not exist, determine the second intersection of the route and the bridge as the third target node; save the third target node to the node set; the second intersection is a geographical location where at least one route and a bridge intersect on the plane; the node type of the third target node is a bridge node.

[0183] Obtain superior road network data connected to rural road map data; superior road network data includes expressway map data, national highway map data and provincial highway map data.

[0184] Identify the third intersection of the route in the rural road atlas and the superior road network data as the fourth target node; save the fourth target node to the node set; the third intersection is the geographical location where at least one route intersects with the superior road network data on the plane; the node type of the fourth target node is the superior road network node.

[0185] In one embodiment, when the rural road network data set also includes a rural road section set, the set generation module 1 is further used to: Based on the nodes in the node set, the routes in the rural road atlas are divided into multiple sections; each section corresponds to two nodes and one route.

[0186] Based on the road network attribute data and node categories, the road section distance, design speed, number of bridge nodes and bridge technical condition assessment level corresponding to each road section are determined.

[0187] The road sections are associated with the road section distance, design speed, number of bridge nodes and bridge technical condition assessment grade and saved as a rural road section set.

[0188] In one embodiment, the node type also includes non-superior road network nodes; non-superior road network nodes are ordinary nodes, independent nodes and bridge nodes. When other nodes are other important nodes, the calculation module 2 is also used to: Any important node in the important node set is determined as the current important node, and the important nodes other than the current important node are other important nodes.

[0189] Based on the spatial topology analysis algorithm, the important node set and the non-superior road network nodes in the node set, the non-superior road network node with the shortest straight-line distance to the current important node is determined as the first calculation node, and the non-superior road network node with the shortest straight-line distance to other important nodes is determined as the second calculation node.

[0190] Based on the Dijkstra algorithm and the rural road network data set, at least one first node path between a first computing node and a second computing node is calculated.

[0191] The node paths are sorted based on a preset optimal path sorting standard to generate a first node path sorting.

[0192] A preset number of first node paths in the first node path sorting are determined as first target paths, and the first target paths are saved in the target path set.

[0193] A first straight-line distance between the first computing node and the second computing node is calculated, and the first straight-line distance is saved in an inter-node distance set.

[0194] In one embodiment, the node type also includes non-superior road network nodes; non-superior road network nodes are ordinary nodes, independent nodes and bridge nodes. When other nodes are other superior road network nodes, the calculation module 2 is also used to: Any important node in the important node set is determined as the current important node, and any upper-level road network node in the preset upper-level road network node range of the node set is determined as other upper-level road network nodes.

[0195] Based on the spatial topology analysis algorithm, the important node set and the non-superior road network nodes in the node set, the non-superior road network node with the shortest straight-line distance to the current important node is determined as the first calculation node, and the non-superior road network node with the shortest straight-line distance to other superior road network nodes is determined as the third calculation node.

[0196] At least one second node path between the first computing node and the third computing node is calculated based on the Dijkstra algorithm and the rural road network data set.

[0197] The second node paths are sorted based on a preset optimal path sorting standard to generate a second node path sorting.

[0198] The first preset number of second node paths in the second node path sorting are determined as second target paths, and the second target paths are saved in the target path set.

[0199] A second straight-line distance between the first computing node and the third computing node is calculated, and the second straight-line distance is saved in the inter-node distance set.

[0200] In one embodiment, the target path set includes at least one target path; the target path set is associated with and stores the path distance corresponding to the target path; and the node distance set includes at least one straight-line distance. The path determination module 3 to be planned is also used to: Based on the calculation node of the straight-line distance, a target path in the target path set that is the same as the calculation node of the straight-line distance is determined as a path to be determined.

[0201] The ratio of the path distance to the straight-line distance of the path to be determined is determined as the path ratio.

[0202] It is determined whether the path ratio is greater than a first preset threshold.

[0203] If yes, the path to be determined is determined to be a newly added path, and the newly added path is saved in a newly added path set.

[0204] In one embodiment, the target path set is associated with and stores at least one highway category corresponding to the target path. The path determination module 3 to be planned is also used for: Get the road category of each path to be determined.

[0205] Based on the preset weight value and road category, the path weighted score of each path to be judged is calculated.

[0206] It is determined whether the path weighted score is greater than a second preset threshold.

[0207] If yes, the path to be determined is determined to be a bottleneck path, and the bottleneck path is saved in a bottleneck path set.

[0208] A rural road connectivity path calculation device provided in an embodiment of the present application can realize intelligent processing of rural road network data and path optimization decision support, accurately identify paths that need to be added and optimized, and improve the connectivity and planning efficiency of the rural road network, thereby improving the regional transportation service level and supporting economic and social development.

[0209] The present application also provides an electronic device, such as Figure 3 As shown, it is a schematic diagram of the structure of the electronic device, wherein the electronic device includes a processor 301 and a memory 302, the memory 302 stores computer executable instructions that can be executed by the processor 301, and the processor 301 executes the computer executable instructions to implement the above-mentioned rural road connectivity path calculation method.

[0210] exist Figure 3 In the illustrated embodiment, the electronic device further includes a bus 303 and a communication interface 304 , wherein the processor 301 , the communication interface 304 and the memory 302 are connected via the bus 303 .

[0211] Among them, the memory 302 may include a high-speed random access memory (RAM), and may also include a non-volatile memory (non-volatile memory), such as at least one disk storage. The communication connection between the system network element and at least one other network element is realized through at least one communication interface 304 (which can be wired or wireless), and the Internet, wide area network, local area network, metropolitan area network, etc. can be used. The bus 303 can be an ISA (Industry Standard Architecture) bus, a PCI (Peripheral Component Interconnect) bus or an EISA (Extended Industry Standard Architecture) bus, etc. The bus 303 can be divided into an address bus, a data bus, a control bus, etc. For ease of representation, Figure 3 Only one bidirectional arrow is used in the diagram, but this does not mean that there is only one bus or only one type of bus.

[0212] The processor 301 may be an integrated circuit chip with signal processing capabilities. In the implementation process, each step of the above method can be completed by the hardware integrated logic circuit or software instructions in the processor 301. The above processor 301 can be a general-purpose processor, including a central processing unit (CPU), a network processor (NP), etc.; it can also be a digital signal processor (DSP), an application-specific integrated circuit (ASIC), a field-programmable gate array (FPGA) or other programmable logic devices, discrete gates or transistor logic devices, discrete hardware components. The general-purpose processor can be a microprocessor or the processor can also be any conventional processor. The steps of the method disclosed in the embodiment of the present application can be directly embodied as a hardware decoding processor to perform, or the hardware and software modules in the decoding processor are combined and performed. The software module can be located in a mature storage medium in the field such as a random access memory, a flash memory, a read-only memory, a programmable read-only memory or an electrically erasable programmable memory, a register, etc. The storage medium is located in the memory, and the processor 301 reads the information in the memory and completes the steps of the rural road connection path calculation method of the above-mentioned embodiment in combination with its hardware.

[0213] In the description of the present application, it should be noted that the terms "center", "upper", "lower", "left", "right", "vertical", "horizontal", "inner", "outer", etc., indicating the orientation or positional relationship, are based on the orientation or positional relationship shown in the drawings, and are only for the convenience of describing the present application and simplifying the description, rather than indicating or implying that the device or element referred to must have a specific orientation, be constructed and operated in a specific orientation, and therefore cannot be understood as limiting the present application. In addition, the terms "first", "second", and "third" are used for descriptive purposes only, and cannot be understood as indicating or implying relative importance.

[0214] Finally, it should be noted that the above-described embodiments are only specific implementation methods of the present application, which are used to illustrate the technical solutions of the present application, rather than to limit them. The protection scope of the present application is not limited thereto. Although the present application is described in detail with reference to the above-described embodiments, ordinary technicians in the field should understand that any technician familiar with the technical field can still modify the technical solutions recorded in the above-described embodiments within the technical scope disclosed in the present application, or can easily think of changes, or make equivalent replacements for some of the technical features therein; and these modifications, changes or replacements do not make the essence of the corresponding technical solutions deviate from the spirit and scope of the technical solutions of the embodiments of the present application, and should be included in the protection scope of the present application. Therefore, the protection scope of the present application shall be based on the protection scope of the claims.

Claims

1. A method for calculating rural road connectivity paths, characterized in that: include: Obtain the road network data of the current area and construct a rural road network dataset based on preset node attributes; The rural road network data set includes a rural road atlas, a node set and an inter-node distance set; the node type of the node set includes an upper-level road network node; Determine the important nodes in the current area based on preset important node attributes, and generate an important node set; By using a preset distance calculation method, the important node set is traversed to calculate the target path and straight-line distance between the current important node and other nodes respectively; The other nodes include other important nodes or other upper-level road network nodes in the important node set except the current important node; the target path includes the calculation node and the road category; the straight-line distance includes the calculation node; Filtering the to-be-determined paths with the same calculation node from the target path and the straight-line distance, calculating the path ratio of the to-be-determined paths, and determining the to-be-determined paths with the path ratio greater than a first preset threshold as newly added paths; The path ratio is the ratio of the path distance of the target path to the straight-line distance; Calculating a path weighted score of the path to be determined, and determining a path to be determined whose path weighted score is greater than a second preset threshold as a bottleneck path; The path weighted score is a total score calculated based on the road category and a preset weight value of the path to be determined; The newly added path and the bottleneck path are used as the paths to be planned in the current area.

2. The rural road connection path calculation method according to claim 1, characterized in that: When the rural road network dataset is a rural road atlas, the step of acquiring the road network data of the current area and constructing the rural road network dataset based on preset node attributes includes: Acquire rural road map data of the current area; the rural road map data includes county road map data, township road map data and village road map data; the rural road map data includes geometric shape data and road network attribute data of each route; the road network attribute data includes route code, route mileage, route starting point pile number, route end point pile number, design speed and the road category; Determine the routes having the same geometric shape data, route code, route starting point pile number and route end point pile number in the county road map data, the township road map data and the village road map data as matching routes, and generate a matching route group based on the matching routes; the matching route group is composed of at least two matching routes; Determine whether other road network attribute data of each of the matching routes in the matching route group are the same; the other road network attribute data is the road network attribute data except the route code, the starting point pile number of the route and the end point pile number of the route; If each of the other road network attribute data is the same, retain one of the matching routes as the merged route; if one of the other road network attribute data is different, merge the matching routes into one of the merged routes by merging the other road network attribute data based on a preset merging rule; updating the route based on the merged route to obtain an updated route, and generating an initial rural road atlas based on the updated route and the rural road map data; Traversing the initial rural road atlas, based on a preset first tolerance value, generating a first buffer zone at the current route starting point pile number and the current route end point pile number of the current route respectively; Determine whether the starting point pile number or the ending point pile number of other routes of other routes is in the first buffer zone; the other routes are routes other than the current route in the initial rural road atlas; If the starting point pile number or the ending point pile number of one of the other routes is in the first buffer, record the current route and the other route as routes to be extended; Determine whether the starting point pile number of the current route or the ending point pile number of the current route is the same as the starting point pile number of the other route or the ending point pile number of the other route; If they are the same, connecting the current route and the other routes into an extended route; if they are not the same, connecting the current route and the other routes into the extended route based on a preset extension method; The route is updated based on the extended route to generate an updated route, and the initial rural road atlas is updated based on the updated route to generate the rural road atlas.

3. The rural road connection path calculation method according to claim 2, characterized in that: When the rural road network data set is the node set, the method further includes: Identify the first intersection of all the routes in the rural road atlas, determine the intersection as a first target node, and add the first target node to the node set; the first intersection is a geographical location where two or more of the routes intersect on a plane; the node type of the first target node is a common node; Identify the route starting point pile number and the route ending point pile number of each of the routes, determine the route starting point pile number or the route ending point pile number that is not connected to other route starting point pile numbers or other route ending point pile numbers as the second target node, and add the second target node to the node set; the node type of the second target node is an independent node; identifying bridges in said rural highway atlas; Based on a preset second tolerance value, generating a second buffer zone at the bridge; Determine whether there is a node in the node set in the second buffer; If it exists, determine the node as the third target node; if it does not exist, determine the second intersection point of the route and the bridge as the third target node; save the third target node to the node set; the second intersection point is at least one geographical location where the route and the bridge intersect on the plane; the node type of the third target node is a bridge node; Acquire superior road network data connected to the rural road map data; the superior road network data includes expressway map data, national road map data and provincial road map data; Identify the third intersection of the route in the rural road atlas and the superior road network data as the fourth target node; save the fourth target node to the node set; the third intersection is a geographical location where at least one of the routes intersects with the superior road network data on the plane; the node type of the fourth target node is an superior road network node.

4. The rural road connection path calculation method according to claim 3, characterized in that: When the rural road network data set also includes a rural road section set, the method further includes: Based on the nodes in the node set, the routes in the rural road atlas are divided into a plurality of sections; each section corresponds to two nodes and one route; Based on the road network attribute data and node categories, determining the road section distance, the design speed, the number of bridge nodes and the bridge technical condition assessment grade corresponding to each road section; The road section is associated with the road section distance, the design speed, the number of bridge nodes and the bridge technical condition assessment grade and saved as the rural road section set.

5. The rural road connection path calculation method according to claim 1, characterized in that: The node types also include non-upper level road network nodes; the non-upper level road network nodes are common nodes, independent nodes and bridge nodes; When the other nodes are the other important nodes, the step of traversing the important node set by a preset distance calculation method to calculate the target path and straight-line distance between the current important node and the other nodes includes: Determine any one of the important nodes in the important node set as the current important node, and the important nodes other than the current important node as the other important nodes; Based on the spatial topology analysis algorithm, the important node set and the non-upper-level road network nodes in the node set, determine the non-upper-level road network node with the shortest straight-line distance to the current important node as the first calculation node, and determine the non-upper-level road network node with the shortest straight-line distance to the other important nodes as the second calculation node; Based on the Dijkstra algorithm and the rural road network data set, calculating at least one first node path between the first computing node and the second computing node; Sorting the node paths based on a preset optimal path sorting standard to generate a first node path sorting; Determine a first preset number of the first node paths in the sorting of the first node paths as first target paths, and save the first target paths to a target path set; A first straight-line distance between the first computing node and the second computing node is calculated, and the first straight-line distance is saved in the inter-node distance set.

6. The rural road connection path calculation method according to claim 1, characterized in that: The node types also include non-upper level road network nodes; the non-upper level road network nodes are common nodes, independent nodes and bridge nodes; When the other nodes are the other upper-level road network nodes, the step of traversing the important node set by a preset distance calculation method to calculate the target path and straight-line distance between the current important node and the other nodes includes: Determine any of the important nodes in the important node set as the current important node, and determine any of the upper-level road network nodes in the node set within a preset upper-level road network node range of the current important node as the other upper-level road network node; Based on the spatial topology analysis algorithm, the important node set and the non-superior road network nodes in the node set, determine the non-superior road network node with the shortest straight-line distance to the current important node as the first calculation node, and determine the non-superior road network node with the shortest straight-line distance to the other superior road network nodes as the third calculation node; Based on the Dijkstra algorithm and the rural road network data set, calculating at least one second node path between the first computing node and the third computing node; Sorting the second node paths based on a preset optimal path sorting standard to generate a second node path sorting; Determine a preset number of the second node paths in the sorting of the second node paths as second target paths, and save the second target paths to a target path set; A second straight-line distance between the first computing node and the third computing node is calculated, and the second straight-line distance is saved in the inter-node distance set.

7. The rural road connection path calculation method according to claim 1, characterized in that: The target path set includes at least one target path; the target path set is associated with and stores the path distance corresponding to the target path; the inter-node distance set includes at least one straight-line distance; The step of selecting the to-be-determined paths having the same calculation node from the target path and the straight-line distance, calculating the path ratio of the to-be-determined paths, and determining the to-be-determined paths having the path ratio greater than a first preset threshold as the newly added paths includes: Based on the calculation node of the straight-line distance, determining the target path in the target path set that is the same as the calculation node of the straight-line distance as the path to be determined; Determine the ratio of the path distance of the to-be-determined path to the straight-line distance as the path ratio; Determining whether the path ratio is greater than the first preset threshold; If yes, it is determined that the path to be determined is the newly added path, and the newly added path is saved in a newly added path set.

8. The rural road connection path calculation method according to claim 7, characterized in that: The target path set is associated with and stores at least one of the road categories corresponding to the target path; The step of calculating the path weighted score of the path to be determined, and determining the path to be determined whose path weighted score is greater than a second preset threshold as a bottleneck path, includes: Obtaining the highway category of each of the paths to be determined; Based on the preset weight value and the road category, calculating the path weighted score of each of the paths to be determined; Determining whether the path weighted score is greater than the second preset threshold; If yes, it is determined that the path to be determined is the bottleneck path, and the bottleneck path is saved in a bottleneck path set.

9. A rural road connection path calculation device, characterized in that: include: The collection generation module is used to obtain the road network data of the current area and construct a rural road network dataset based on preset node attributes; The rural road network data set includes a rural road atlas, a node set and an inter-node distance set; the node type of the node set includes an upper-level road network node; The set generation module is further used to determine the important nodes in the current area based on preset important node attributes and generate an important node set; A calculation module, used to traverse the important node set and calculate the target path and straight-line distance between the current important node and other nodes by using a preset distance calculation method; The other nodes include other important nodes or other upper-level road network nodes in the important node set except the current important node; the target path includes the calculation node and the road category; the straight-line distance includes the calculation node; a to-be-planned path judgment module, configured to select, from the target path and the straight-line distance, a to-be-judged path with the same calculation node, calculate a path ratio of the to-be-judged path, and determine a to-be-judged path with a path ratio greater than a first preset threshold as a newly added path; the path ratio is a ratio of the path distance of the target path to the straight-line distance; The to-be-planned path judgment module is further used to calculate a path weighted score of the to-be-judged path, and determine a to-be-judged path whose path weighted score is greater than a second preset threshold as a bottleneck path; the path weighted score is a total score calculated based on the highway category and a preset weight value of the to-be-judged path; The to-be-planned path determination module is further configured to use the newly added path and the bottleneck path as the to-be-planned paths in the current area.

10. An electronic device, characterized in that: It includes a processor and a memory, wherein the memory stores computer executable instructions that can be executed by the processor, and the processor executes the computer executable instructions to implement the rural road connection path calculation method described in any one of claims 1-8.

Images