Heuristic route segment path-finding method for ship route design

Abstract

The invention discloses a heuristic route segment path-finding method for ship route design, comprising heuristic search, a heuristic shortest route segment path-finding algorithm analysis method, an A* algorithm heuristic principle and an improved shortest path algorithm, wherein the heuristic route segment path-finding algorithm puts forwards a method establishing a navigable path tree to reduce meaningless path searching time by being based on a point to point navigable line algorithm and combining with the A* algorithm heuristic principle. By analyzing the particularity of the route segment path-finding algorithm based on a vector diagram in the ship route design, the route segment path-finding algorithm is improved according to an analysis result, the accuracy of a generated route segment path is enhanced and the path-finding efficiency is further increased. Lands, islands and other barriers positioned on a map of the world are expressed by polygons in the vector diagram, and route segment path-finding is to finally find an optimal route segment from communicated paths which are generated between the two outer points of the polygons without passing through the polygons.

Description

technical field [0001] The invention relates to the technical field of navigation, in particular to a heuristic route-finding method for ship route design. Background technique [0002] In shipping, the pros and cons of route design have a major impact on improving the economic benefits of shipping. To this end, it is crucial to design an ideal route. Route design is a relatively complex and meticulous work, involving a wide range of knowledge, strong selectivity and variability. Ships sailing at sea are quite different from cars and trains traveling on fixed routes on land. Due to the wide sea area, large room for activities, and changeable weather conditions, the conditions of various ships are different, and the selection of routes has become very complicated. Since the flight segment database is the foundation of route design, the world shipping route traffic network framework is established by the flight segment library. Therefore, path finding for flight segments h...

AI Technical Summary

Problems solved by technology

At present, the design of world navigation routes is based on the route design of the world map. The map is fine and the graphics are complex. If the grid map is used, the following problems will be faced: 1. The problem of rasterization of the map. When the ratio is the same, the ratio is large, It cannot express the connectivity of narrow watersheds such as canals and waterways; the scale is small, and the gridded network is huge, which seriously affects the search speed

However, in a dynamic map, the accessibility of the raster needs to be updated

Images