Path planning method and system

Abstract

The invention provides a path planning method and system, wherein the method comprises the following steps: mapping roads into nodes in a traffic network topological graph and mapping endpoints of the roads into arc sections in the traffic network topological graph; searching bi-directionally from an original node and a destination node, thus obtaining a plurality of current nodes; calculating the cost from a plurality of current nodes to the original node and the destination node sequentially and obtaining a current node of the minimum cost from the original node to the destination node; and according to the current node of the minimum cost, the original node and the destination node, obtaining a path plan from the original node to the destination node. The method and the system overcome the defect in the prior art that a Dijkstra method of adjacent matrices is adopted to store traffic network topological data, although whether (i; j) is a network edge can be queried within the time O (1), the complexities for querying relevant nodes which are the most significant for the shortest path plan are all O (n), which causes higher query complexity.

Description

technical field [0001] The present invention relates to the field of traffic, in particular to a path planning method and system. Background technique [0002] Today, as the road network (referred to as the road network) is increasingly developed, it is no longer easy for users to travel. [0003] Route planning is the process of helping single-vehicle drivers plan their driving route before travelling. The main problem it solves is to find the optimal path from the starting point to the destination in a given road network. [0004] The prior art provides a Dijkstra method based on an adjacency matrix to solve the problem of the shortest path with the minimum cost in the above-mentioned path planning. [0005] In the process of realizing the present invention, the inventor finds that the Dijkstra method of adjacency matrix is ​​used to store traffic network topology data in the prior art, although the query of whether (i; j) is a network edge can be completed in O(1) time,...

AI Technical Summary

Problems solved by technology

[0006] The present invention aims to provide a path planning method and system, which can solve the problem of using the Dijkstra method of adjacency matrix to store traffic network topology data in the prior art, although it can be completed in O(1) time whether (i; j) is a The query on the network side, but the query on the most critical associated nodes of the shortest path planning, its complexity is O(n), which leads to the problem of high query complexity

Images