Method, device, electronic device and storage medium for acquiring path information

Abstract

The present disclosure relates to a method, an apparatus, an electronic device and a storage medium for acquiring route information, the method comprising: receiving a route request message, the route request message including a start position and an end position for requesting route information; in a road network Determine the first road section corresponding to the starting point position and the second road section corresponding to the end point position; determine the target query identifier corresponding to the first road section and the second road section; pass the path correspondence according to the target query identifier, Obtaining the target path information between the start position and the end point position; the path correspondence includes the correspondence between the target query identifier and the target path information, thereby saving calculation time and improving path information acquisition s efficiency.

Description

technical field [0001] The present disclosure relates to the field of route planning, and in particular, relates to a method, device, electronic device and storage medium for acquiring route information. Background technique [0002] Current navigation applications all have the function of path planning, and the user can obtain the path information from the start point to the end point (such as the path distance from the start point to the end point) by inputting the start point and the end point through the navigation type application program. [0003] In the existing technology, the distance is generally obtained by converting the road network into a weighted directed graph and calculating it through a path planning algorithm. However, since the calculation time of the path planning algorithm is usually more than tens of milliseconds, it is time-consuming. It cannot meet the demand for high-performance scheduling scenarios (such as taxi-hailing or food-delivery scenarios)....

AI Technical Summary

Problems solved by technology

[0003] In the existing technology, the distance is generally obtained by converting the road network into a weighted directed graph and calculating it through a path planning algorithm. However, since the calculation time of the path planning algorithm is usually more than tens of milliseconds, it is time-consuming. Unable to meet the demand for high-performance scheduling scenarios (such as taxi or food delivery)

Images