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

A method for planning the shortest driving route of motor vehicles based on graph partition based on communication equilibrium

A technology for driving routes and motor vehicles, applied in mechanical equipment, combustion engines, road network navigators, etc., can solve problems such as low efficiency and achieve the effect of reducing transmission volume

Active Publication Date: 2022-06-07
FUZHOU UNIV
View PDF2 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

If the road network is not partitioned and the shortest route is calculated in parallel, the efficiency of planning the shortest route will be very inefficient

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 planning the shortest driving route of motor vehicles based on graph partition based on communication equilibrium

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0032] In order to make the features and advantages of this patent more obvious and easy to understand, the following specific examples are given and described in detail as follows:

[0033] like figure 1 As shown in the figure, the method for planning the shortest driving route of a motor vehicle based on the communication balanced graph partition proposed in this embodiment mainly includes the following modules, which are executed in sequence according to the process: a road network construction module, a cluster node-based bisection module, a balanced network partition module, circular distribution node module, calculation driving route module and output module.

[0034] The road network building module realizes the construction of a road network G=(V, E, W) that can be divided into graphs by taking the locations recorded in the database as nodes, the reachability relationship between locations as edges, and the distance between locations as weights, where V represents the...

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 proposes a communication-balanced graph partition-based motor vehicle shortest route planning method, aiming at the problem of motor vehicle route planning in daily life, and a communication-balanced graph partition-based motor vehicle shortest route planning method. Ensure the load balance of each network partition calculation when calculating the driving route, and reduce the amount of cross-network transmission. According to the road information included in the database, a road network that can be partitioned can be constructed. Using this method, complex road networks can be partitioned efficiently and accurately, and batches of shortest driving routes can be calculated in parallel in each network partition.

Description

technical field [0001] The invention belongs to the technical field of motor vehicle driving route optimization, and in particular relates to a method for planning the shortest driving route of a motor vehicle based on a communication-balanced graph partition. Background technique [0002] Faced with a complex road network, it is often difficult for drivers to directly detect the least time-consuming traffic route with the naked eye. If there is map navigation to indicate the shortest route from the departure point to the destination point, it can avoid spending more time on the road and arrive at the destination point in time. [0003] The road network is widely distributed and contains a huge amount of information. Therefore, the planning efficiency of the batch shortest driving route must be considered. Without partitioning the road network and computing the shortest route in parallel, planning the shortest route would be very inefficient. SUMMARY OF THE INVENTION [...

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): G01C21/34G06Q10/04
CPCG01C21/343G01C21/3453G06Q10/047Y02T10/40
Inventor 郭昆徐凯吴伶董燕梅
Owner FUZHOU UNIV
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

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com