Path planning method and device

Abstract

The invention discloses a path planning method and device, and relates to the technical field of logistics. One embodiment of the method comprises the following steps: dividing a target road network into a plurality of sub road networks according to each destination address in a destination set; taking each destination address as a node, for each sub-road network, querying the distance between nodes in the sub-road network, and determining a sub-path according to the distance and a preset constraint condition; and merging the sub-paths among different sub-road networks to obtain a moving path.According to the embodiment, the target road network is divided into the plurality of sub road networks according to the destination address, the path in each sub road network is planned respectively, and then the paths between different sub road networks are planned, so that when the distance is inquired, the distance between the destinations in each sub road network is inquired firstly, and then the distance between the sub paths of different sub road networks is inquired; therefore, the distance is inquired in two stages, so that the inquiry quantity can be effectively reduced, and the inquiry efficiency is improved.

Description

technical field [0001] The invention relates to the field of logistics technology, in particular to a path planning method and device. Background technique [0002] Logistics distribution widely exists in daily life and business operations. It connects production and consumption to meet the growing social consumption demand. Efficient and reasonable distribution is the guarantee for the smooth operation of the logistics system. Whether the distribution route arrangement is reasonable or not has a great impact on the distribution speed, cost and benefit, especially the determination of multi-user distribution routes is more complicated. Arranging the delivery route of vehicles correctly and reasonably can effectively save transportation time, improve vehicle utilization, and reduce costs. [0003] In the process of realizing the present invention, the inventors found that there are at least the following problems in the prior art: for the whole network data query method, in ...

AI Technical Summary

Problems solved by technology

[0003] In the process of realizing the present invention, the inventors found that there are at least the following problems in the prior art: for the whole network data query method, in the large-scale path planning problem, due to the large amount of data, it is impossible to obtain all the distances between two locations in a short time. The path distance; similarly, the basic data of the road network is too large, which will also reduce the solution efficiency of large-scale path planning

For a larger order volume, the query time is longer. Such a query speed is not enough for real-time path planning, and as the order volume increases, the query time increases exponentially.

Images