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

A method for obtaining the shortest path of urban road network based on angle restriction and bidirectional search

An urban road network and two-way search technology, applied in the field of navigation optimization of the existing urban road network, can solve the problem of reducing the timeliness matching degree of route search in the navigation process, affecting the driver's travel experience, and the utilization efficiency of the urban road network. Direction and other issues to achieve the effect of improving efficiency, driving process efficiency, and improving navigation efficiency

Active Publication Date: 2022-03-15
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 path search stage of the specific navigation process, the existing path search methods are often based on real-time road network information to carry out path search in a single direction from the start point to the end point in the global scope. This path search method does not take into account The directionality of the driver's driving in the navigation reduces the timeliness of the route search in the navigation process and the degree of matching with the driver's travel intention

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 angle restriction and bidirectional search
  • A method for obtaining the shortest path of urban road network based on angle restriction and bidirectional search
  • A method for obtaining the shortest path of urban road network based on angle restriction and bidirectional search

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0074] In this embodiment, since the method for obtaining the shortest path of the present invention always searches for paths from front to back in two local areas with similar Half-Ellipse boundaries, the method for obtaining the shortest path of the present invention can be referred to as Two-way E* algorithm. Specifically, if figure 1 As shown, a method of obtaining the shortest path of urban road network based on angle restriction and two-way search is carried out as follows:

[0075] Step 1: Construct the urban road network and obtain the plane coordinates of any intersection;

[0076] Obtain real-time road network data and 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 Indicates the qth intersection, q=1,2,...,Q; Q indicates the total number of intersections, A indicates the set of road sections between intersections, and A={a ij =(v i ,v j )|i,j=1,2,...Q}, a ij Denotes the i-th inter...

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 urban road network based on angle restriction and bidirectional search, including: 1. Constructing an urban network based on real-time road condition information; n F , Backward search for the set U of intersections inside and outside the boundary n B , the set of two-way boundary intersections is M n , Upper and lower bounds of travel time T; 3. Update set forward and backward search boundary set U of intersections inside and outside n F , U n B , 4. Obtain the starting point through the two-way boundary intersection set M through the label correction method n The shortest path from the middle intersection to the destination point; 5. The travel time of the shortest path is equal to the lower bound of the travel time T Or search forward and backward for the intersection set U inside the boundary n F , U n B If it is no longer updated, the shortest path can be obtained, otherwise update and go to step 3. The invention considers adding angle limitation and two-way search into the navigation of the urban road network, so as to effectively narrow the search range, improve the navigation efficiency and provide a faster and more 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 angle restriction and bidirectional search. 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 co...

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/096833
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