Rapid K shortest path planning method applied to GPS

A technology of the shortest path and path, which is applied in the field of computer networks to achieve the effect of improving practicability, reducing occupied space, and improving search efficiency

Active Publication Date: 2013-12-11
UNIV OF ELECTRONICS SCI & TECH OF CHINA
View PDF2 Cites 9 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0006] At present, there are many terminal devices with GPS navigation functions, but they can only provide the shortest route or the

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 more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Rapid K shortest path planning method applied to GPS
  • Rapid K shortest path planning method applied to GPS
  • Rapid K shortest path planning method applied to GPS

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0054] The present invention will be described in further detail below in conjunction with the accompanying drawings and embodiments.

[0055] refer to figure 1 , for the K short path computer algorithm flow process described in the present invention, in conjunction with above concrete problem analysis, obtain the concrete steps as follows:

[0056] Step 1: Call A* algorithm on node t to get the shortest path, define variable k, let k=1;

[0057] Step 2: For all nodes in the path P(π) (except t ), for all outgoing sidetrack edge e of this node, if the state of head (e) is not close, run A* until the state of head (e) is close, add e to π to form a new path π*, calculate Path π*length l(π*)=d(t)-d(head(e))+w(e)+d(tail(e)), add path π* to set C;

[0058] Step 3: If K shortest paths have been obtained, go to Step 7;

[0059] Step 4: If C is empty, go to Step 6;

[0060] Step 5: Take a shortest path from the set C as the current shortest path π, and go to step 2;

[0061] S...

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

No PUM Login to view more

Abstract

The invention provides a rapid K shortest path planning method applied to a GPS. The method applies a dynamic load data searching method and an elicitation type searching thought to recursively calculate K shortest paths: an A* algorithm is utilized to obtain the shortest paths, bead edges of each node on a former shortest path are traversed successively so that a candidate path collection is obtained; recursive searching from the ith shortest path so that the i+1th shortest path is obtained. Advantages of the rapid K shortest path planning method applied to the GPS are that the K shortest paths are rapidly obtained and applied to the GPS so that a problem that the GPS is single in navigation path is solved to a certain degree. Besides, K path schemes are provided for users to select, other needs in driving process of the users are fully considered and practicality of the device is obviously enhanced.

Description

technical field [0001] The invention belongs to the field of computer networks, and in particular relates to a K-shortest path search method, which is applied to GPS navigation equipment. Background technique [0002] Path search problems can generally be solved by the shortest path method in graph theory. Commonly used shortest path methods include classic methods such as Dijkstra and breadth-first methods. However, these methods can only find the shortest path from a given point to any point in the graph. This is often not enough in practice. For example, in GPS navigation, in addition to the shortest path, it may be necessary to find the second shortest path for backup, and even under certain conditions, it may be necessary to search for the third and fourth shortest paths. This type of problem is called the K-short path problem. [0003] Compared with the single-source shortest path problem, the K-short-path problem is more complex in method design. At present, there ...

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
no application Login to view more
IPC IPC(8): G01S19/39
Inventor 刘贵松邱钊谢娟张浩屈鸿陈文宇
Owner UNIV OF ELECTRONICS SCI & TECH OF CHINA
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap