Method for finding optimal path in road network based on graph embedding

An optimal path and road network technology, applied in special data processing applications, instruments, electrical digital data processing, etc., can solve problems such as low efficiency and inability to respond to user queries in a timely manner, achieve good pruning effect, reduce The effect of searching space and improving search efficiency

Inactive Publication Date: 2011-08-17
FUDAN UNIV
View PDF0 Cites 19 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

Since the path minimum heap maintained by this method will increase sharply with the increase of the number of attributes involved in the optimal path query, this method is not efficient in real road networks and cannot meet the requirements of timely response to user queries

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 finding optimal path in road network based on graph embedding
  • Method for finding optimal path in road network based on graph embedding
  • Method for finding optimal path in road network based on graph embedding

Examples

Experimental program
Comparison scheme
Effect test

specific Embodiment approach

[0049] by figure 1 In a road network represented by , the user enters the starting point s ,end t , and two property collections: M 1 ={ g 1 , g 2 , g 3 , g 4}, M 2 = { b 1 , b 2 , b 3 , b 4 , b 5}, then follow these steps to find:

[0050] (1) Select a reference point r 1 , r 2 , calculate the distance from each point to the reference point, get a 2D vector and store it;

[0051] (2) Calculate the greedy path as R g = R ( s , g 1 , b 2 , t );

[0052] (3) Traverse the collection M 1 and M 2 , delete the invalid path, and get the candidate path as R 1 ( s , g 1 , b 2 , t )and R 2 ( s , g 1 , b 3 , t );

[0053] Accurate calculation R 1 and R 2 The length of the comparison, the smallest length is taken out as R 2 ( s , g 1 , b 3 , t ), so the optimal path is ( s , g 1 , b 3 , t ).

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 belongs to the technical field of a spatial database, specifically relates to a method for finding an optimal path in a road network based on graph embedding. The method comprises the following steps of: defining point sets M1, M2, ..., and Mn of n attributions in a road network; and defining a starting point s and an ending point t; providing upper and lower limits according to a graph embedding frame by taking s as the starting point; finding out a greedy path Rg by finding the nearest neighbour with iteration; then traversing the point sets M1, M2, ..., and Mn of the n attributions according to a sequence; pruning the existing path by combining with the upper and lower limits and taking the length of the greedy path as the upper limit; and finally counting the residual candidate paths precisely to find the optimal path. The finding method based on graph embedding provided by the invention has the advantages that the searching space is greatly reduced, and the finding efficiency is high.

Description

technical field [0001] The invention belongs to the technical field of road networks, and in particular relates to an optimal path search method in the road network. Background technique [0002] With the development of wireless communication technology and the large-scale application of mobile devices, spatial database technology has been well applied in reality and has become one of the current research hotspots, and its development prospects are widely optimistic. As one of the most common queries in spatial databases, the optimal path query is, given n set of points with attributes M 1 、M 2 、…、M n , and a starting point s and an end point t , to find a path of minimum length R ,in R started from s , in turn through M 1 , M 2 ,..., M n At least one point in each set, eventually reaching the end t . [0003] Most of the existing optimal path query methods are based on the Euclidean space environment. In the Euclidean space environment, the distance betwe...

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 FUDAN 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