Method for searching for heuristic shortest path based on direction optimization

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

Inactive Publication Date: 2013-12-04
ZHEJIANG UNIV
View PDF2 Cites 11 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 traverse the entire node network and does not improve the overall search speed, especially for traffic networks with a large number of nodes. Redundancy is inevitable

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
  • Method for searching for heuristic shortest path based on direction optimization
  • Method for searching for heuristic shortest path based on direction optimization
  • Method for searching for heuristic shortest path based on direction optimization

Examples

Experimental program
Comparison scheme
Effect test

Embodiment

[0037] 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, such as Figure 4 .

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

[0039]

[0040] Table 2 Data (0,120) Comparison data of two methods

[0041]

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

[0043]

[0044] 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 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 method for searching for a heuristic shortest path based on direction optimization. The method includes the steps that directivity selection is performed on expandable nodes of current nodes, and a range in searching for nodes is reduced; path estimated values of nodes meeting the requirements are compared according to a heuristic searching function, nodes with low option values are preferentially selected to be expanded, and father node information of the nodes are recorded. With the depth-first method, path nodes are searched for in a step-and-step deepening mode till all the expandable nodes are traversed. The method for searching for the heuristic shortest path based on direction optimization has the advantages that the direction optimization principle is used, so that the traversing number of the nodes is greatly reduced, and the searching speed is improved; meanwhile, the heuristic function is introduced so as to reduce blindness in expanding the nodes with the depth-first method, the optimal node is preferentially considered to be expanded so that the shortest path can be found in early-stage searching, 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
Patent Type & Authority Applications(China)
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