Shortest path generation method and related device

A shortest path and path technology, applied in data processing applications, forecasting, computing and other directions, can solve problems such as high time complexity and inability to meet timeliness

Pending Publication Date: 2020-12-22
SAIC MOTOR
View PDF0 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

However, the disadvantage of this method is that the scale of the graph after the introduction of virtual nodes is very large,

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
  • Shortest path generation method and related device
  • Shortest path generation method and related device
  • Shortest path generation method and related device

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0067] As mentioned in the background art, in the prior art, the most mature algorithm for solving the shortest path problem was proposed by Yen in 1971. Yen's algorithm first uses Dijkstra's algorithm to find the shortest path from the starting point s to the ending point t, taking it as p 1 and put into the result list A. After finding the first k paths {p 1 ,p 2 ,...,p k} After that, calculate p k+1 The process is as follows:

[0068] (1) Take p k every node v except the terminating node t in i As possible deviating nodes, compute v i The shortest path to node t. calculating v i When the shortest path to t, the following two conditions need to be met: First, in order to ensure no loop, the path cannot pass through the current shortest path p k up from s to v i any node in between; second, to avoid duplication with previously found paths, from node v i The forked edge cannot be connected to the previously found shortest path p 1 , p 2 ,...,p k on from v i 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 discloses a shortest path generation method and a related device, and the method comprises the steps of simplifying a generation problem of a shortest path with a plurality of non-negative weight values of a sideband into a problem of a single non-negative weight value of the sideband; sequentially screening the K candidate paths by using other non-negative weight values of each edgein the directed graph to obtain K final paths, thereby solving the problem of multiple non-negative weight values of a sideband; according to the method, the shortest path problem of a single non-negative weight value of a sideband is restored to the shortest path problem of a plurality of non-negative weight values of the sideband through an incremental screening algorithm, virtual nodes do notneed to be introduced in the process, the problem that the scale of a graph is huge after the virtual nodes are introduced is avoided, and the purposes of reducing time complexity and improving timeliness are achieved.

Description

technical field [0001] The present application relates to the technical field of path planning, and more particularly, to a method for generating a shortest path and a related device. Background technique [0002] The shortest path algorithm is an algorithm that calculates the shortest path of all other nodes in a node in the graph. [0003] The shortest path algorithm has a very wide range of applications in the fields of transportation, communication, robot motion planning, computational molecular biology, and Huffman coding. Taking the communication field as an example, when a communication network includes multiple network devices, each network device needs to use itself as the root node to calculate the shortest path from itself to other network devices, thereby generating the Shortest Path First Tree (Shortest Path First Tree). , SPF tree), communicate with other network devices based on the shortest path priority tree in the communication process, thereby improving t...

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): G06Q10/04
CPCG06Q10/047
Inventor 李友金忠孝
Owner SAIC MOTOR
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