Planning method and system for shortest path

A shortest path and planning technology, applied in road network navigators, measuring devices, instruments, etc., can solve problems such as unguaranteed algorithm effects and dimension disasters, and achieve the effect of avoiding dimension disasters and reducing time complexity and space complexity

Active Publication Date: 2020-03-27
海南中智信信息技术有限公司
View PDF7 Cites 9 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0004] Therefore, this type of algorithm has two deficiencies. On the one hand, due to the addition of heuristic search on the basis of breadth-first search, the feasible path finally selected may not be the shortest path, and the selection of feasible paths is largely Affected by the induction function, the effect of the algorithm can...

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
  • Planning method and system for shortest path
  • Planning method and system for shortest path
  • Planning method and system for shortest path

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0045] The application will be further described in detail below in conjunction with the accompanying drawings and embodiments. It should be understood that the specific embodiments described here are only used to explain related inventions, rather than to limit the invention. It should also be noted that, for the convenience of description, only the parts related to the related invention are shown in the drawings.

[0046] It should be noted that, in the case of no conflict, the embodiments in the present application and the features in the embodiments can be combined with each other. The present application will be described in detail below with reference to the accompanying drawings and embodiments.

[0047] figure 1A flow chart of a shortest path planning method according to an embodiment of the present application is shown. Such as figure 1 As shown, the method includes the steps of creating a grid, computing the minimum step size and obtaining the shortest path.

[...

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 planning method and system for a shortest path. The method comprises the following steps of establishing an initial grid map according to the environmental information, and respectively marking the grid points of the grid map as a starting point, candidate points and obstacle points; traversing the candidate points to calculate the minimum step length from the candidate points to the starting point so as to form a minimum step length matrix graph; and selecting one of the candidate points as an ending point, and performing the recursive traversal through a reverse depth-first algorithm to obtain a shortest path plan from the ending point to the starting point. The method and the system of the scheme are based on a grid map global expansion algorithm, not only solve the problem that the final path is the shortest path, but also greatly reduce the time complexity and the space complexity of the operation.

Description

technical field [0001] The present application relates to a path planning technology, in particular to a planning method and system for the shortest path. Background technique [0002] The main function of global path planning is to find an optimal or near-optimal path from the starting point to the end point on the known static map. The path is generally continuous, smooth, without obstacles, and suitable for direct execution of the global path. Path planning algorithm is the basis of the whole navigation system, and its results provide path information for subsequent local trajectory planning. [0003] Path planning technology is a research hotspot in many fields at present, and has broad application prospects and scientific research value. It has important applications in robot pathfinding, traffic route navigation, artificial intelligence, game design and other fields. Among them, in the path planning scenario based on the grid map, A* and the optimization algorithm of...

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
IPC IPC(8): G01C21/34
CPCG01C21/343G01C21/3446
Inventor 严海波于建港吴嘉琪陈学轩
Owner 海南中智信信息技术有限公司
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