Unlock instant, AI-driven research and patent intelligence for your innovation.

A method and system for planning a path

A technology for planning paths and shortest path algorithms, applied to road network navigators, navigation, instruments, etc., can solve problems such as easy loops, high error rates, and inability to calculate optimal paths in real time, so as to improve efficiency and avoid The effect of circular paths

Active Publication Date: 2021-04-27
FENGHUO COMM SCI & TECH CO LTD
View PDF6 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

This method can calculate the optimal path between two points, but in practical applications, the quantity on the edge is constantly changing with time or the environment, so the optimal path between two points cannot be calculated in real time, and there is a speed Slow, high error rate, prone to problems such as loops, unable to meet the growing needs of path planning

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 and system for planning a path
  • A method and system for planning a path
  • A method and system for planning a path

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0062] see figure 1 As shown, the embodiment of the present invention provides a method for planning a path, including the following steps:

[0063] S1. Abstract the source point according to the actual network and inject it into the topology map;

[0064] S2. Abstract nodes and edges according to the actual network and inject them into the topology graph;

[0065] S3. Traverse the connected nodes of each injection node, find the smallest ring, and converge to a node; use the shortest path algorithm to calculate the path of each node for the converged topology graph; then expand the previously formed smallest rings to generate each node primary / standby trace path for ;

[0066] S4. Output the path from each node to the source point.

[0067] The present invention starts from the node connected to the injection node, traverses the connected nodes of each injection node, finds the smallest ring and converges into one node, and forms several smallest rings; uses the shortest p...

Embodiment 2

[0069] On the basis of embodiment 1, the concrete process of step S2 is:

[0070] According to the reachable route, all tracking nodes that are connected to the source point are obtained, and all nodes will be constructed into a connected topology graph, and each tracking node and the source point are reachable by paths.

Embodiment 3

[0072] On the basis of Embodiment 2, step S2 further includes the following steps: if the node has multiple connections, use the connection with the highest transmission rate as the 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 method and system for planning a path, and relates to the technical field of path planning algorithms. The invention starts from the nodes connected to the injection nodes, traverses the connected nodes of the respective injection nodes, finds the minimum ring and converges to a node, and forms several minimum loops. Ring; use the shortest path algorithm to calculate the path of each node on the converged topology map; expand the previously formed minimum rings, obtain the planned path of all nodes and output the path from all nodes to the source point. Since the topology after convergence is often star-shaped or chain-shaped, the number of nodes will be greatly reduced, so the efficiency of the shortest path algorithm will be improved and the generation of ring paths will be avoided.

Description

technical field [0001] The present invention relates to the technical field of planning path algorithms, in particular to a method and system for planning paths. Background technique [0002] With the rapid development of science and technology applications, more and more path planning requirements have been proposed. In the existing technology, in the field of intelligent control technology, the calculation of the optimal path between one logical network node and another logical network node The method is: first create a topology file consisting of logical network nodes, edges and quantities on the edges, where the edge is the connection between two logical network nodes, and the quantities on the edges are the weights assigned to the edges; then according to the The topology file uses the shortest path between two points to calculate the shortest path between two logical network nodes; the calculated shortest path is used as the optimal path. This method can calculate the...

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/34
CPCG01C21/3423
Inventor 夏莹辉鄢大伟吴昊王舣
Owner FENGHUO COMM SCI & TECH CO LTD