Dynamic road network based hierarchy priority optimal path calculation method

An optimal path and dynamic road network technology, applied in the field of intelligent transportation, can solve the problem of no road characteristic analysis, achieve the effect of more adaptability and reliability, reduce travel time, and improve connectivity

Active Publication Date: 2018-05-08
WUHAN UNIV
View PDF3 Cites 17 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0004] In addition, in the process of planning vehicle travel routes, there are not many studies that can combine human cognitive behaviors, although some studies suggest that people tend to pass on routes with fewer turns during travel, not just limited to The shortest distance in the physical sense, because this will greatly reduce the cognitive load, but no further detailed analysis of the characteristics of these roads

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
  • Dynamic road network based hierarchy priority optimal path calculation method
  • Dynamic road network based hierarchy priority optimal path calculation method
  • Dynamic road network based hierarchy priority optimal path calculation method

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0070] The road network is actually a data set with a hierarchical structure associated with the road network level. Mathematically, the planar road network is expressed as G(V,E), where V represents the collection of road intersections, and E represents the collection of road sections. For example, a road network with three levels can be expressed as HG(V',E'), where V' is determined by V 1 , V 2 and V 3 The set consisting of, E' is composed of E 1 ,E 2 and E 3 The set consisting of, V 1 , V 2 , V 3 Respectively represent the collection of road intersection endpoints at different levels, E 1 ,E 2 ,E 3 Respectively represent a collection of road segments of different levels. in:

[0071] E. 1 ={e|e∈E and e.class=1};

[0072] E. 2 ={e|e∈E and e.class=1or 2};

[0073] E. 3 ={e|e∈E and e.class=1or 2or 3};

[0074] e.class indicates the grade of road section e, E 1 Indicates the set of road sections of the first level, which is composed of the road sections of 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 discloses a dynamic road network based hierarchy priority optimal path calculation method. The method includes a step 1 of performing hierarchy division on road networks according to road ranks and generating Voronoi maps corresponding to the different levels of road networks; a step 2 of performing path searching by adopting a multi-level search strategy and searching the body partand the branch part of the optimal path based on a shortest path searching method; a step 3 of generating the optimal path according to the body part and the branch part of the optimal path. Accordingto the invention, the driving time of automobiles on roads can be reduced substantially and change of traffic flow states in road networks can be responded. Further, a reliable real time solution canbe provided for path selection for travelling vehicles, so that adaptability and reliability of travel schemes can be enhanced.

Description

technical field [0001] The invention belongs to the technical field of intelligent transportation, and in particular relates to a method for calculating a hierarchical priority optimal path based on a dynamic road network. Background technique [0002] In recent years, how to find an optimal path between the starting point and the ending point of travel has become a hot research topic in intelligent transportation. It not only directly affects people's travel efficiency, but also involves issues such as urban development and environmental pollution. For example, driving on a road with poor road conditions will not only increase travel costs, but also further aggravate road traffic congestion and the resulting exhaust pollution. Many professional geographic information system software (such as ArcGIS) provide the function of finding the shortest path from the source location to the target location in the road network, but the conventional methods are based on static traffic ...

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): G06Q10/04
CPCG06Q10/047
Inventor 贾涛胡正华
Owner WUHAN 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