Ships route planning on heavy-traffic marine area based on historical data.

This paper is devoted to the problem of planning the route of the passage of a sea vessel. Ship navigator must adhere to a certain traffic pattern adopted in a particular water area when sailing in heavy traffic conditions. This scheme can also exist informally, being a generalization of the collective navigator's experience. In this case, it seems productive to plan a route based on data on the movement of other vessels that were in the water area earlier (the same idea underlies the methods of "big data" tasks). In earlier papers, such route planning was based on a cluster analysis of historical traffic data. It assumed the division of the water area into sections and the allocation of characteristic values of velocities and courses in them. The problem with this approach was the choice of partitioning parameters, which had to be set for each specific water area separately. In this paper, another approach is proposed, when the graph of possible routes includes a selection of the trajectories of individual ships that were previously implemented in the selected water area. The article considers a method for constructing such a graph of possible routes, estimates the number of its vertices and edges, and gives recommendations on choosing a method for finding the shortest path on this graph. A possible method for interpolating the missing data required to build a graph is discussed, which is based on the idea of combining straight and maneuverable sections of vessel traffic. Examples of route planning in a number of real water areas are given Vladivostok, Tokyo Bay, Tsugaru Strait. [ABSTRACT FROM AUTHOR]