Method and device for searching shortest path of road network

A technology of shortest path and search method, applied in the field of map search, can solve the problems of many nodes in traversal calculation and low efficiency, and achieve the effect of high efficiency and real-time requirements.

Active Publication Date: 2015-01-07
TSINGHUA UNIV +1
View PDF7 Cites 38 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

However, although the Dijkstra algorithm can obtain the optimal solution of the shortest path, there are too many

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 and device for searching shortest path of road network
  • Method and device for searching shortest path of road network
  • Method and device for searching shortest path of road network

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0030] Embodiments of the present invention are described in detail below, examples of which are shown in the drawings, wherein the same or similar reference numerals designate the same or similar elements or elements having the same or similar functions throughout. The embodiments described below by referring to the figures are exemplary and are intended to explain the present invention and should not be construed as limiting the present invention.

[0031] In addition, the terms "first" and "second" are used for descriptive purposes only, and cannot be interpreted as indicating or implying relative importance or implicitly specifying the quantity of indicated technical features. Thus, a feature defined as "first" and "second" may explicitly or implicitly include one or more of these features. In the description of the present invention, "plurality" means two or more, unless otherwise specifically defined.

[0032] In the present invention, unless otherwise clearly specified...

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 and device for searching the shortest path of a road network. The method comprises the following steps of dividing the road network into a plurality of sub-networks to generate the road network with a tree structure; calculating the shortest path between boundary nodes of the sub-networks at the same layer; inputting an enquiry point and a target point; according to the shortest path, implementing a dynamic programming algorithm to obtain the initial shortest path between the enquiry point and the target point; and supplementing the initial shortest path to obtain the complete shortest path between the enquiry point and the target point. According to the method, the road network is divided into the plurality of sub-networks so as to generate the road network with the tree structure, and the shortest distance between the boundary nodes of the sub-networks at the same layer is calculated, so that the shortest path between the enquiry point and the target point can be rapidly obtained when the enquiry point and the target point are input; the method and the device not only are high in efficiency, but also well meet the requirement of real-time property.

Description

technical field [0001] The invention relates to the technical field of map search, in particular to a shortest path search method and device for road networks. Background technique [0002] The shortest path problem is a classic algorithm problem in graph theory research, which aims to find the shortest path between two nodes in a graph (composed of nodes and paths). In related technologies, for example, the Dijkstra algorithm is a traditional solution, and its main feature is to expand outward layer by layer around the starting point until it reaches the end point. However, although the Dijkstra algorithm can obtain the optimal solution of the shortest path, it traverses and calculates too many nodes, which leads to low efficiency and cannot well meet the real-time requirements. Contents of the invention [0003] The present invention aims at solving one of the technical problems in the related art mentioned above at least to a certain extent. [0004] Therefore, an obj...

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): G01C21/34G06F19/00
CPCG01C21/3446G01C21/3453
Inventor 李国良冯建华陈硕朱璇
Owner TSINGHUA 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