Route planning method based on road chain

Abstract

The invention discloses a route planning method based on a road chain, and mainly solves the problems of long search time and many route corners of the existing route planning method. The method adopts the scheme that the method comprises the following steps: extracting node-arc section information of a road network, obtaining relevance between nodes, between the nodes and arc sections as well as between the arc sections, extracting the road chain meeting road consistency by using the node-arc section information, obtaining feasible routes from an origin to a destination by using a bidirectional search route planning method according to road chain information, origin and destination positions input by a navigation system, and selecting the optimal route from origin to the destination by comparing weights of the feasible routes. The method shortens the route search time, reduces the frequency of the route corners, and can be used for traffic control, resource allocation and vehicle navigation, and the obtained route keeps the road consistency.

Description

technical field [0001] The invention belongs to the technical field of navigation, and in particular relates to a route planning method, which can be used in traffic control, resource allocation and vehicle navigation. Background technique [0002] Path planning refers to finding a collision-free path from the initial state to the goal state in an environment with obstacles according to certain evaluation criteria. The path planning problem can be abstracted into the shortest path search problem in graph theory, that is, the problem of solving the optimal path of a weighted directed graph in graph theory. In traffic control, resource allocation, vehicle navigation and other fields, the shortest path algorithm has increasingly become a research hotspot. [0003] In terms of path planning, many scholars have proposed a series of planning methods to solve the maximum benefit from the starting point to the end point, among which the more classic ones are the path planning based...

AI Technical Summary

Problems solved by technology

[0005] The Dijkstra algorithm and the A* algorithm are based on the "node-arc" model. Each road is segmented into many arc segments by nodes, and the road network data is trivial. Each search step needs to access a large number of node and arc segment information, and the search space is large. , the amount of calculation increases, and the efficiency of the algorithm decreases

Secondly, the Dijkstra algorithm and the A* algorithm have high accuracy in path planning, but the road continuity is poor and the number of corners is large, which does not conform to people's perceptual understanding of the road.

Images