Shortest route planning and navigating method and system

A technology of the shortest path and navigation method, applied in road network navigator, navigation, surveying and mapping and navigation, etc., to achieve the effect of avoiding the singleness of weight and wide application scenarios

Inactive Publication Date: 2016-10-26
CHINA UNIV OF GEOSCIENCES (WUHAN)
View PDF9 Cites 11 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0008] For such problems, the traditional Dijkstra algorithm cannot be completed. Therefore, on the basis of the Dijkstra algorithm, the present invention proposes an improved method for comprehensively evaluating the actual problems in path planning, and processes the data to obtain a method that satisfies the actual situation. The shortest path of the constraints is applied to the actual path planning, which is closer to the user's actual path planning and navigation

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
  • Shortest route planning and navigating method and system
  • Shortest route planning and navigating method and system
  • Shortest route planning and navigating method and system

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0043] The principles and features of the present invention are described below in conjunction with the accompanying drawings, and the examples given are only used to explain the present invention, and are not intended to limit the scope of the present invention.

[0044] In the traditional Dijkstra algorithm, there are only weights representing the path distance, such as figure 1 As shown, in the improved Dijkstra algorithm, the formula is introduced: M(n)=P(n)+Q(n)*A, where M(n) represents the comprehensive evaluation weight, and P(n) represents the path distance weight , Q(n) represents user preference weight, and A is the proportion of user preference weight. Considering the path distance and user preference together, avoiding the single weight of the traditional Dijkstra algorithm, the comprehensive evaluation weight is composed of two items, and the influence ratio of the two on the final path selection can be changed by setting the A value .

[0045] figure 2 It is...

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 relate to a shortest route planning and navigating method. The method comprises the following steps: step one, according to the user preference, adding a user preference weight to a route distance weight, and using a formula: M(n)=P(n)+Q(n)*A to preprocessing the data to obtain a comprehensive evaluation weight M(n); step two, selecting a special node that a user has to pass by, taking the special node as the cutting point, cutting the road network into a first network and a second network by the cutting point, wherein the first network is a node network from the start point to the special node, and the second network is a node network from the special node to the final point; step three, replacing the route distance weight P(n) in Dijkstra algorithm by the comprehensive evaluation weight M(n) obtained in the step one, and then using the improved Dijkstra algorithm to carry out shortest route on the first network and the second network so as to obtain the shortest route from the start point to the special node to the final point.

Description

technical field [0001] The invention relates to the field of path planning and navigation, and specifically designs a shortest path planning and navigation method and system. Background technique [0002] Route planning navigation is accurate and time-sensitive, and is closely related to users' daily life. It is widely used in user travel, search and rescue, and scientific research. A shortest path from the starting point to the destination greatly facilitates the user's actual life. In path planning, the path planning algorithm is an important part. The current traditional Dijkstra algorithm is suitable for calculating the shortest path between two points and is recognized as one of the classic algorithms in path planning. It is built on the abstract network model, abstracts the road section as an edge in the network, and uses the weight of the edge as the distance of the road section. When calculating the shortest path through Dijkstra, you need to specify the starting p...

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
Patent Type & Authority Applications(China)
IPC IPC(8): G01C21/20G01C21/34G01C21/36
CPCG01C21/20G01C21/206G01C21/3446G01C21/3617
Inventor 王瑾张睿吴让仲张晓锋
Owner CHINA UNIV OF GEOSCIENCES (WUHAN)
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