Intelligent vehicle route planning method based on improved Floyd algorithm

A technology for path planning and intelligent vehicles, which is applied in directions such as road network navigators to achieve the effect of small calculation amount, comprehensive information and convenient use.

Inactive Publication Date: 2018-12-18
SOUTH CHINA UNIV OF TECH
View PDF3 Cites 6 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

Existing algorithms have high efficiency in solving the shortest path, but for the case of multiple shortest paths, further research is still needed

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
  • Intelligent vehicle route planning method based on improved Floyd algorithm
  • Intelligent vehicle route planning method based on improved Floyd algorithm
  • Intelligent vehicle route planning method based on improved Floyd algorithm

Examples

Experimental program
Comparison scheme
Effect test

Embodiment

[0030] Such as figure 2 As shown, an intelligent vehicle path planning method based on the improved Floyd algorithm realizes the shortest path planning from the initial parking point to the target parking point in the underground parking garage, and all possible equivalent shortest paths can be obtained, and The client pops up a prompt sign at the path turning point; the method specifically includes the following steps:

[0031] (1) if figure 1 As shown, the parking spaces in the parking garage are numbered according to the spatial order, and the number of the parking spaces is used as a shared node, and the weight matrix between the parking spaces is imported, and the weight matrix W is initialized, where the element w[i] [j] represents the weight of node i to node j;

[0032] In this embodiment, the initialization rule for the element w[i][j] of the weight matrix W is: if node i is adjacent to node j, then the weight from node i to node j represented by w[i][j] The value...

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 an intelligent vehicle route planning method based on an improved Floyd algorithm. The method comprises the following steps: firstly, numbering parking spots of parking spacesof a parking garage according to a spatial order, and importing a weight matrix between the parking spaces of the parking garage; then, performing calculation according to the weight matrix and the improved Floyd algorithm to obtain a distance matrix and a route matrix, and storing the route matrix in a local system; after a starting parking space serial number and a target parking space serial number are input, searching the route matrix to obtain all possible shortest routes; and finally, displaying all possible equivalent shortest routes in a client interface one by one. According to the method disclosed by the invention, the shortest route planning from the parking spot of the starting parking space to the parking spot of the target parking space in an underground parking garage is achieved, all possible equivalent shortest routes can be obtained, and a client pops up a prompting sign at a route turning point, thereby having practical reference significance for the route planning of intelligent driving of vehicles.

Description

technical field [0001] The invention relates to the field of path planning, in particular to an intelligent vehicle path planning method based on the improved Floyd algorithm. Background technique [0002] In recent years, under the wave of intelligent development of automobiles, intelligent driving technology has made great progress. Intelligent vehicle path planning refers to planning a feasible path from the initial state to the target state in a modeled environment according to certain evaluation criteria. Existing algorithms have high efficiency in solving the shortest path, but for the case of multiple shortest paths, further research is still needed. The Floyd algorithm has high execution efficiency and a small amount of calculation. After improvement, it can be well applied to the intelligent vehicle autonomous guidance parking path planning system. Contents of the invention [0003] The purpose of the present invention is to overcome the shortcomings and deficie...

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/34
CPCG01C21/34
Inventor 姜立标杨杰艾皖东台啟龙
Owner SOUTH CHINA UNIV OF TECH
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