Key points are not available for this paper at this time.
This paper proposes a route planning algorithm that can comprehensively integrate ship safety, economic benefits and algorithm universality. Firstly, the Polynomial Approximation with the Exponential Kernel method was used to smooth the repaired trajectory and the similarity of the smoothed trajectory was evaluated using Hausdorff distance. The results showed that the similarity of ship trajectories was effectively improved by 36.53%. Using the Douglas Pucker algorithm to compress the smoothed trajectory, the compression rate exceeded 92%. Then, the HDBSCAN self-adjusting clustering analysis method was used to cluster the ship trajectory and the silhouette coefficient index was used to quantitatively evaluate the clustering effect, the calculation result was 0.9032. Finally, using the average centre method to extract the centres of each cluster, 299 key turning points were obtained and connected to construct an undirected route network. Based on this, the Dijkstra algorithm was used to achieve optimal route planning.
Hongjie et al. (Mon,) studied this question.