Abstract
ABSTRACT 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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
