Dynamic path planning method, device and system, and storage medium

Abstract

The present invention provides a dynamic path planning method, device and system, and a storage medium. The method comprises the following steps: determining, in a high-level grid map, at least one initial candidate path according to locations of a start point and an end point; obtaining a grid where the initial candidate path passes in the high-level grid map as a path grid; acquiring a low-levelgrid map corresponding to the path grid; optimizing the initial candidate path according to the low-level grid map to acquire a target candidate path. The dynamic path planning method can reduce processed data of path planning to improve the planning efficiency, and adopts a boundary node according to a dynamic traffic state to improve the accuracy and reasonability of the path planning.

Description

technical field [0001] The present invention relates to the technical field of navigation, and in particular, to a dynamic path planning method, device, system and storage medium. Background technique [0002] With the popularization of network electronic maps, vehicle navigation software, positioning and navigation mobile phones and other products, the path planning technology has received a lot of attention, and people have put forward requirements for path planning such as flexibility, accuracy and speed. [0003] The navigation path can be planned by a variety of algorithms, such as the Dijkstra algorithm, which takes the starting point as the center, performs an extended search on the roads of the entire map until it expands to the end point, compares and filters all feasible roads, and finally obtains the shortest path. . In the case of dense road network areas or long-distance route planning, the amount of data and computation loaded will be quite staggering, resulti...

AI Technical Summary

Problems solved by technology

In the case of dense road network areas or long-distance path planning, the amount of data loaded and the amount of calculation will be quite amazing, resulting in a long planning time

[0004] In reality, the optimal path is not necessarily the shortest path. The selection of the optimal path often also considers factors such as road grade, road surface conditions, and traffic light waiting time. Traditional path planning does not consider real-time traffic information, especially when roads are congested. , even more unable to meet the reasonable path planning requirements under dynamic traffic conditions, and the efficiency of path planning is not good

Images