Road grade-based shortest route-planning algorithm

Abstract

The invention relates to a road grade-based shortest route-planning algorithm. The road grade-based shortest route-planning algorithm comprises the following steps: firstly, data preparation and data preprocessing; secondly, road network hierarchical expression, wherein road network grade division and road grade-based hierarchical expression are included; thirdly, road network passing time calculation; fourthly, shortest route approximate calculation. According to the road grade-based shortest route-planning algorithm provided by the invention, a large number of experiments prove that the passing capacity of different grades of roads are taken into full consideration; the passing time is taken as a judgment standard; a calculation method is general; the results are more precise; in emergency rescue, if a fault road section in a rod network can be excluded by road detection information, the real-time passing speed is calculated by acquiring traffic flow, and the planning result is more accurate.

Description

technical field [0001] The invention belongs to the fields of computer science and geographic information science, and relates to a shortest path planning algorithm based on road grades. Background technique [0002] The calculation of the shortest path is a classic problem. One of the most practical applications is path analysis in road networks, such as finding the best path from the starting point to the destination point in a given road network. The current shortest path analysis method can be summarized into two categories in terms of the algorithm’s realizability and stability: one is to make full use of the spatial correlation of the shortest path in the road network, and compress the shortest path in the road network into a simple format, which can greatly improve query efficiency. This method is more representative of the improved SILC (Spatially Induced Linkage Cognizance) algorithm proposed by H.Samet and J.Sankaranarayanan et al., and the PCPD (PCPD) proposed by ...

AI Technical Summary

Problems solved by technology

Although some new algorithms have been proposed based on this, these algorithms are not very effective

For the first type of method, it is necessary to calculate the correlation between different roads constructed by road nodes, so as to perform alternative calculations. The algorithm is complex and the amount of calculation is large.

Therefore, the second type of method is more commonly used, but the existing research often only considers the weight of road nodes, but does not consider different road grades and the minimum time limit under different road grades. Therefore, a combination of road grades and road grade constraints is studied. A new algorithm for the shortest time is very necessary

Images