Path update method and device

A path update and shortest path technology, applied in data processing applications, forecasting, and other database retrieval, to achieve the effects of reducing redundant calculations, reducing update costs, and improving dynamic update efficiency

Active Publication Date: 2021-11-12
CAPITAL NORMAL UNIVERSITY
View PDF4 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

There are some shortcomings in the existing technology such as the triangle heuristic algorithm (A*Landmarks Triangle, ALT). When the updated weight value of a side in the TDN network is smaller than the initial weight value, it is necessary to recalculate the preprocessed data, which will generate a lot of unnecessary update operation

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
  • Path update method and device
  • Path update method and device
  • Path update method and device

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0022] In order to make the purpose, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention will be clearly and completely described below in conjunction with the drawings in the embodiments of the present invention. Obviously, the described embodiments It is a part of embodiments of the present invention, but not all embodiments. The components of the embodiments of the invention generally described and illustrated in the figures herein may be arranged and designed in a variety of different configurations. Accordingly, the following detailed description of the embodiments of the invention provided in the accompanying drawings is not intended to limit the scope of the claimed invention, but merely represents selected embodiments of the invention. Based on the embodiments of the present invention, all other embodiments obtained by persons of ordinary skill in the art without cre...

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

A path updating method and device provided in an embodiment of the present invention relate to the technical field of path processing. The method includes acquiring a plurality of landmarks in a time-varying road network, and constructing a forward shortest path tree and a backward shortest path tree corresponding to each landmark in the plurality of landmarks based on the time-varying road network; When it is detected that the weight of a side in the time-varying road network changes, obtain the forward shortest path tree or the backward shortest path tree corresponding to the landmarks associated with the side, and the landmarks associated with the side The nodes in the corresponding forward shortest path tree or backward shortest path tree that are affected by the change of the weight are updated. Using the structural characteristics of the forward shortest path tree and backward shortest path tree corresponding to each landmark constructed in the time-varying road network, redundant calculations are reduced, and the dynamic update efficiency of the shortest path tree is improved, thereby reducing the update cost of preprocessing data.

Description

technical field [0001] The present invention relates to the technical field of path processing, in particular to a path updating method and device. Background technique [0002] The shortest path algorithm was born in operations research and computer science, and is a classic algorithm of graph theory. Many practical problems in other fields can be abstracted into the shortest path problem (ShortestPath, SP) in operations research through computer technology such as data structure, such as traffic path planning. The traditional shortest path model is based on the static network structure, that is, the structure of the formalized network graph is known, and the weight of the arc (or edge) is unchanged. However, in the actual traffic road network, the weight of each arc edge will change with time, for example, the traffic capacity and speed of the road will be affected by dynamic factors such as traffic conditions. For time-dependent networks (Time-Dependent Networks, TDN), ...

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): G06F16/901G06Q10/04
Inventor 王旭仁许祎娜苏红莉冯安然马慧珍
Owner CAPITAL NORMAL UNIVERSITY
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