Path planning method and system thereof

Abstract

The present invention discloses a path planning method and a path planning system, wherein the path planning method includes the steps of: receiving a path planning request, the path planning request including a starting place information and a destination information; From the origin information and the destination information, a first alternative route is identified from a map database; according to the origin information and the destination information, a second alternative route is identified from a map database path; solving the ratio of the overlapping segment of the second candidate path and the first candidate path to the first candidate path, and setting the ratio as a first similarity; and responding to the first For the determination that the similarity is less than a preset threshold, the first candidate path and the second candidate path are output.

Description

technical field [0001] The present invention relates to the field of navigation, and more particularly, to a path planning method and system thereof. Background technique [0002] With the vigorous development of new concept cars such as "smart cars" and "Internet cars", the supporting service providers and equipment manufacturers continue to provide consumers with more valuable and more convenient services through network services, among which, Navigation service is one of the popular services. Through the navigation engine route planning service provided by the supplier, consumers can effectively obtain multiple route plans from the starting point to the destination, so that consumers can freely choose according to their own preferences. [0003] There are many algorithm implementation forms for path planning, commonly used A* and Dijkstra algorithms. Dijkstra's algorithm is a typical algorithm used to solve the shortest path. The A* algorithm is a standard algorithm in...

AI Technical Summary

Problems solved by technology

However, this processing strategy will inevitably completely avoid the newly generated planning path S2 and the entire path of the first planning path S1, and cannot guarantee that the difference between the two paths meets the preset requirements

That is to say, the strategy of avoiding the original path is too rough, so that in the process of path planning, many planned paths that may meet the needs of consumers will be filtered, and the expected path cannot be obtained.

At the same time, such a strategy will increase the search range and reduce the path calculation efficiency of the entire path planning.

Images