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

Motor vehicle shortest driving route planning method based on communication balance graph partitioning

A technology for driving routes and motor vehicles, applied to 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: 2021-04-09
FUZHOU UNIV
View PDF9 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
  • Motor vehicle shortest driving route planning method based on communication balance graph partitioning

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 special examples are described in detail as follows:

[0033] Such as figure 1 As shown, the shortest driving route planning method for motor vehicles based on graph partitioning based on communication balance proposed in this embodiment mainly includes the following modules, which are executed sequentially according to the flow: road network construction module, cluster node-based binary division module, and balanced division of network partitions Module, Cycle Assignment Node Module, Calculate Driving Route Module, and Output Module.

[0034] The road network construction module realizes the construction of a road network G=(V, E, W) that can be partitioned by using 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 node set, E repres...

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 provides a method for planning the shortest driving route of a motor vehicle based on a communication-balanced graph partition, and provides a method for planning the shortest driving route of a motor vehicle based on a communication-balanced graph partition in order to solve the problem of planning the driving route of a motor vehicle in life; wherein the load balance of calculation of each network partition during calculation of a driving route is ensured, and the cross-network transmission quantity is reduced. According to the road information recorded in the database, the road network capable of carrying out graph partitioning is constructed, by using the method, the complex road network can be partitioned efficiently and accurately, and the shortest driving routes in batches 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 motor vehicles based on communication-balanced graph partitions. Background technique [0002] Faced with an intricate road network, it is often difficult for drivers to directly detect the traffic route that takes the least time with the naked eye. If there is a map navigation indicating the shortest route from the departure point to the destination point, it can avoid spending more time on the road and reach 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. If the road network is not partitioned and the shortest routes are calculated in parallel, the efficiency of planning the shortest route will be very low. Contents o...

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): 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