Rapid path planning method

Abstract

The invention discloses a rapid path planning method comprising the following steps: (S1) establishing space sublayers for a road network according to a road grade, dividing mesh regions for each layer of road network, and establishing a topological structure of the road network according to road data; (S2) respectively carrying out lifting exploration on an initial position and a final position of a low-level road network, and searching a hop position entering a high-level road network; and (S3) planning a path between an initial hop and a final hop on the high-level road network according to a shortest path algorithm. In the invention, a navigation path is planned by using methods such as road mergence, two-way lifting exploration and the like, and the requirement of the traditional navigation system for rapidly calculating and planning the optimal path can be met.

Description

technical field

[0001] The invention relates to the field of navigation, and more specifically, relates to a method for fast path planning. Background technique

[0002] In recent years, the application of GPS (Global Positioning System, Global Positioning System) has become more and more common. Obtaining one's own position from GPS, and then planning a route to a destination, greatly facilitates people's daily life.

[0003] The navigation system needs to quickly calculate the best path for navigation, but most of the existing navigation systems rely on some hardware with limited computing and processing capabilities, and the navigation system itself will consume most of the system resources, so the path planning method must be Efficient and fast.

[0004] The current method for selecting the navigation path is to abstract the traffic network into a topological network containing multiple nodes, and then plan a path from the start point to the end point through the shorte...

Images