Navigation head based on layering bidirectional heuristic route planning method
A route planning and navigation device technology, which is applied to road network navigators and other directions, can solve problems such as not being able to meet the real-time requirements of navigation system route planning, and achieve the effect of meeting real-time requirements and clear algorithm flow
Active Publication Date: 2009-02-04
WUHAN ZHONGHAITING DATA TECH CO LTD
View PDF0 Cites 17 Cited by
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Existing algorithms include Dijkstra algorithm, heuristic algorithm, layered algorithm, and bidirectional search algorithm. Any algorithm used alone cannot meet the real-time requirements of the navigation system for route planning.
Method used
the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View moreImage
Smart Image Click on the blue labels to locate them in the text.
Smart ImageViewing Examples
Examples
Experimental program
Comparison scheme
Effect test
Embodiment
[0036] Divide the entire map into two layers, Figure 6 yes Figure 5 a rough picture of Figure 5 is layer 0, Figure 6 is Tier 1. Such as Figure 5 As shown, there are 26 nodes from a to z on the map of layer 0, the side length between every two adjacent points is 1, and the spherical distance between node a and node z is 9. Such as Figure 6 As shown, the side length between every two adjacent points on the first layer is 3. Now it is necessary to calculate the shortest path from map node a to node z, and the final high-level route planning is the first layer.
[0037] We set:
[0038] V: set of edges;
[0039] O[n]: the distance cost of the shortest path from the starting point to node n;
[0040] G[n]: Euclidean distance from node n to the end point;
[0041] D[n]: the distance cost of the shortest path from node n to the destination;
[0042] H[n]: Euclidean distance from node n to the end point;
[0043] C[p, q]: the distance cost from node p to node q;
[...
the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More PUM
Login to View More Abstract
The present invention provides a navigation device that is based on a layering bi-direction enlightening-typed route planning method. The application method of the device integrates the layering calculation, the bi-direction searching calculation and the enlightening-typed calculation. Firstly, the quantity of the high-level layers and the layer-switching condition that are required to be planned are determined, and the bi-direction enlightening-typed route plan is performed at the most bottom layer until the plan satisfies the layer-switching condition. Secondly, switching to the upper layer and judge whether the switched high layer is the finally-planned high layer: if the switched high layer is the finally-planned high layer, the bi-direction enlightening-typed route planning is performed at the layer until the final route is found; if the switched high layer is not the finally-planned high layer, the bi-direction enlightening-typed route planning is performed at the layer until satisfying the layer-switching condition, and finally repeat the confirmation process of the layer switching and the final route. Under the condition that the hardware performance is limit and the data quantity is vast, the navigation device can satisfy the requirements on the real-time property for the route planning of the navigation system, and has clear calculation flow procedures.
Description
technical field [0001] The invention belongs to a route planning algorithm for a navigation device, in particular to a route planning method combining multiple algorithms. Background technique [0002] At present, the performance of the hardware used in the navigation system is limited, and the amount of navigation data it uses is huge (the number of road records exceeds 1 million). However, in the case of limited hardware performance and a huge amount of data, it is necessary to ensure real-time route planning of the navigation system. This puts high demands on the route planning algorithm of the navigation system. Existing algorithms include Dijkstra's algorithm, heuristic algorithm, layered algorithm, and bidirectional search algorithm. Any one of these algorithms alone cannot meet the real-time requirements of the navigation system for route planning. Contents of the invention [0003] The technical problem to be solved by the present invention is to provide a navigat...
Claims
the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More Application Information
Patent Timeline
Login to View More Patent Type & Authority Applications(China)
IPC IPC(8): G01C21/26G01C21/34
Inventor 邓滨陆杨张宗敏谢飞
Owner WUHAN ZHONGHAITING DATA TECH CO LTD