Fast shortest-path planning method based on road chains

Abstract

The invention discloses a fast shortest-path planning method based on road chains and aims to improve problems that the list open in an existing A* algorithm contains many nodes, the A* algorithm is time-consuming and a planned path has many turns. The fast shortest-path planning method includes the steps of firstly, generating a node topology table K according to a city road network; secondly, generating a road chain topology table U according to the node topology table K; thirdly, creating a list open and a list closed; initiating the list open, maintaining the list open and the list closed according to the road chain topology table U, and marking out the shortest traveling path. The fast shortest-path planning method has the advantages that data units which need to be processed in path planning are reduced, path planning time is reduced, road integrity and visual consistency are kept, turns in the output path are reduced, and the method is applicable to vehicle or walking navigation.

Description

technical field [0001] The invention belongs to the technical field of road networks, and in particular relates to a shortest path planning method, which can be used for vehicle and pedestrian navigation. Background technique [0002] To analyze the shortest path of an urban road network, it is first necessary to abstract the actual urban road network entity into a network in network graph theory. The existing technology is usually based on the "node-segment" topological data model to realize the interaction between the two. Mapping, each natural road is artificially divided into several road sections. The disadvantage of this is that, firstly, the path planning algorithm needs to process more data units, and secondly, the planned travel path is composed of road sections, resulting in many turns in the travel path, which does not conform to people's travel planning experience. [0003] Liu Kang and others proposed a method of applying road links to route planning in their ...

AI Technical Summary

Problems solved by technology

The disadvantage of this is that, firstly, the path planning algorithm needs to process more data units, and secondly, the planned travel path is composed of road sections, resulting in many turns in the travel path, which does not conform to people's travel planning experience

The disadvantages of this method are: firstly, this scheme is only an index for converting road links into road sections, which is used to reflect the importance of road sections. The topological network relationship based on "node-road section" will artificially divide each natural road into several road sections, which will lead to more data units processed by the algorithm. Secondly, this method uses Dijkstra algorithm for path planning, and does not use time complexity. Lower A* Algorithm

However, there are too many elements in the open table, and it takes a long time to maintain the open table at a time, which makes the overall path planning take a long time

Images