Linear optimal shortest path search method

A shortest path and path technology, applied in the shortest path search field of linear optimization, can solve the problem of not considering the direction or position of the target node, and achieve the effect of reducing the number of nodes and improving the speed.

Active Publication Date: 2009-06-03
BEIJING RES CENT FOR INFORMATION TECH & AGRI
View PDF0 Cites 8 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0004] from figure 2 It can be seen that the original Dijkstra search method can be approximated as a series of concentric circles with the source node as the center. The search process does not

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
  • Linear optimal shortest path search method
  • Linear optimal shortest path search method
  • Linear optimal shortest path search method

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0028] The following examples are used to illustrate the present invention, but are not intended to limit the scope of the present invention.

[0029] The present invention provides a method for obtaining the shortest path between two places. The method includes steps: S1, obtaining the starting point, the ending point, and the adjacent points of the starting point of the two places; S2, obtaining the distance between the adjacent point and the starting point. S3, obtain the straight-line distance between the above-mentioned adjacent points and the end point; S4, obtain the minimum value of the sum of the above-mentioned shortest path distance and the straight-line distance and the point where the minimum value is obtained; S5, judge the above-mentioned minimum value Whether the point is the end point, if yes, then obtain the path distance from the above starting point to the end point via the point that obtains the minimum value as the shortest path distance between the start ...

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 relates to a linear optimal shortest path search method. In the method, the shortest path distance between a marked temporary node and a source node and the linear distance between the temporary node and a target node are used as the basis for selecting a permanent marker node from a temporary node set under the conditions that a researched network can be seen as a planar network. The provided shortest path search method reduces the number of traversing nodes in search, thereby increasing the searching speed.

Description

technical field [0001] The invention relates to the field of path search, in particular to a straight line optimization shortest path search method. Background technique [0002] The most famous solution of the shortest path method is the Dijkstra search method. The original Dijkstra search method divides network nodes into three types: unmarked nodes, temporary marked nodes and permanent marked nodes. All nodes in the network are first initialized as unmarked nodes, and the nodes connected to the shortest path nodes during the search process are temporary marked nodes, and each cycle searches for the path length from the source point from the temporary marked nodes The shortest node is used as a permanent marker node, and the search process is not ended until the target node is found or all nodes become permanent marker nodes. [0003] In the original Dijkstra search process, since the temporary marked nodes are stored out of order, all temporary marked nodes must be trav...

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): H04L12/56H04W40/20G06F17/30H04L12/721
Inventor 赵春江王开义张方田刘忠强隋静喻钢
Owner BEIJING RES CENT FOR INFORMATION TECH & AGRI
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