Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

A Method for Obtaining the Shortest Path of Urban Road Network Based on Directional Induction

An urban road network and shortest path technology, which is applied in the field of navigation optimization of the existing urban road network, can solve the problem of intertwining, reduce the directionality and regionality of the route search in the navigation process, and does not consider the directionality of the driver's driving. And other issues

Active Publication Date: 2021-09-14
HEFEI UNIV OF TECH
View PDF0 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0003] In the current urban road network, roads of various grades (express roads, main roads, secondary roads, and branch roads) are intertwined, and road grade factors seriously affect all aspects of the navigation itinerary. The current navigation products are often not effective in the navigation process. Using this factor to improve the timeliness of the navigation process seriously affects the driver's travel experience and the utilization efficiency of the urban road network.
In addition; in the route search stage of the specific navigation process, the existing route search methods are often based on real-time road network information to perform route search on a global scale. This route search method does not take into account the direction of the driver during navigation. , which reduces the directionality and regionality of the path search in the navigation process

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
  • A Method for Obtaining the Shortest Path of Urban Road Network Based on Directional Induction
  • A Method for Obtaining the Shortest Path of Urban Road Network Based on Directional Induction
  • A Method for Obtaining the Shortest Path of Urban Road Network Based on Directional Induction

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0045] Such as figure 1 As shown, a method for obtaining the shortest path of the urban road network based on directionality induction is always carried out in a local area with a boundary similar to an ellipse (Ellipse), so the method for obtaining the shortest path can be referred to as the E* algorithm for short. Specifically, , proceed as follows:

[0046] Step 1: Construct the city network and obtain the plane coordinates of any intersection;

[0047] Obtain real-time road network data to obtain the urban road network G=(V,A), where V represents the set of intersections, and V={v 1 ,v 2 ,...,v q ,...,v Q},v q Represents the qth intersection, q=1,2,...,Q; A represents the road segment set between intersections, and A={a ij =(v i ,v j )|i,j=1,2,...Q}, a ij Denotes the i-th intersection v i with the jth intersection v j section between, and a ij ∈{A 1 ,A 2 ,A 3 ,A 4}, where A 1 Expressway, A 2 Indicates the main road, A 3 Indicates a secondary road, A 4 I...

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 obtaining the shortest path of an urban road network based on directionality induction, including: 1. Constructing an urban network from real-time road condition information; 2. Introducing a set of intersections U n , the upper bound of travel time and the lower bound of travel time at intersections outside the boundary T ; 3. Update set U n Sum set 4. Obtain the shortest travel time and route from the intersection of the starting point to the intersection of the destination point through the label correction method; 5. If the travel time from the starting point to the destination point is equal to T or set U n No longer update, then end to get the shortest path, otherwise update T , go to step 3. The invention considers adding directional induction into the navigation of the urban road network and effectively narrowing the search range, so as to improve the navigation efficiency and provide the driver with a more humanized and efficient driving path.

Description

technical field [0001] The invention belongs to the field of navigation optimization of the existing urban road network, in particular to a method for obtaining the shortest path of the urban road network based on directional induction. Background technique [0002] With the development of society, Internet-based traffic navigation has brought more and more convenience to users. Users can input their own starting point and destination at the beginning of navigation, and then they can obtain the route automatically planned by navigation products. However, as the number of cars in cities gradually increases, the construction of road networks is relatively lagging behind, traffic resources are wasted, and travel efficiency is low. Loss. Therefore, it is necessary to study a route navigation method to improve the travel level and the utilization rate of the urban road network. With the development of GPS, network technology, and computer technology, the conditions for the esta...

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 Patents(China)
IPC IPC(8): G08G1/0968
CPCG08G1/096805G08G1/096844
Inventor 丁建勋江宇鹏周润东冯战雨满忠运丁卫东朱孔金龙建成石琴
Owner HEFEI UNIV OF TECH
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products