Heuristic shortest path search method based on direction optimization

A technology of the shortest path and search method, applied in the field of road search, which can solve the problems of redundancy and failure to improve the overall search speed, and achieve the effects of avoiding search, reducing blindness, and improving efficiency

Inactive Publication Date: 2013-07-31
ZHEJIANG UNIV
View PDF2 Cites 21 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

Zhang Lianpeng et al. proposed a fast search method for direction optimization to increase the speed of searching for the optimal path, but this method still needs to

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
  • Heuristic shortest path search method based on direction optimization
  • Heuristic shortest path search method based on direction optimization
  • Heuristic shortest path search method based on direction optimization

Examples

Experimental program
Comparison scheme
Effect test

Embodiment

[0034] In order to verify the effectiveness of the present invention, the present invention adopts the road network of a certain district of Wenzhou City, Zhejiang Province to carry out the application test of the method. The road network contains 140 points and 197 edges.

[0035] Table 1 data (3,118) comparison of two methods

[0036]

[0037] Table 3 data (56,111) comparison of two methods

[0038]

[0039] Tables 1-3 are comparisons between the heuristic depth-first method and the method of the present invention. The difference between the two is that the heuristic depth-first method simply uses the heuristic function to optimize the depth-first method, and does not use the principle of direction optimization for node preprocessing. It can be seen from the experimental results that the present invention is obviously superior to the heuristic depth-first method in terms of the number of search nodes and the total running time, and the actual time for searching the 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 discloses a heuristic shortest path search method based on direction optimization, which comprises the steps that expandable nodes of the current nodes are subjected to directional selection; a node search scope is reduced; according to a heuristic search function, satisfactory path estimated values of the nodes are compared; the node with a lower weight value is selected preferentially; information of a father node of the node is recorded; and road nodes are searched step by step in a depth-first mode till all the expandable nods are ergodic. The method has the advantages that the ergodic number of the nodes is reduced greatly by using a direction optimization principle; the search speed is increased; in addition, the heuristic function is introduced, so that the blindness in a node expanding process by a depth-first method can be reduced; the priority is given to the optimal node for expansion, so that the shortest path can be found at an early search stage; and multiple alternative paths can be provided.

Description

technical field [0001] The invention relates to a road search method, in particular to a heuristic shortest path search method based on direction optimization. Background technique [0002] The shortest path problem has always been a hot topic in various disciplines, and has been applied in urban planning, transportation, emergency management and other fields. The study of the optimal route usually abstracts the urban road network into a network problem in the sense of graph theory, and the core of the problem becomes the shortest path problem in the network graph. In the network model, find the path with the least obstruction between two nodes; in the time model, calculate the path with the least time between two nodes; in the economic model, find the lowest consumption method of the event; the key methods in these models are the shortest path method. At the same time, this problem is also a basic problem in GIS network analysis. We can use GIS technology to transform th...

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): G06F17/30
Inventor 杜震洪张丰刘仁义房佳徐聪
Owner ZHEJIANG UNIV
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