Generation of Ship’s Passage Plan Using Data-Driven Shortest Path Algorithms

Abstract

In this study, an approach for generating the shortest-distance passage plan for a ship is proposed considering the navigable area obtained based on automatic identification system data. The navigable area is designated based on the information from the electronic navigational chart and by considering the ship traffic density using Jenks natural breaks classification. The shortest-path algorithms used in our experiment are the Dijkstra, A*, and improved A*. Then, the Douglas-Peucker algorithm is applied to generate an optimal result by supplementing the passage plan generated by the best-performing shortest-path algorithm. The experiment was divided into two cases depending on whether or not the passage plan covered the target area of this study, namely, the vessel traffic service system control area of Busan Port between Busan New Port and Ulsan Port. The improved A* performed better than Dijkstra and A* in these two cases. Subsequently, the distance of the final passage plan was 98.649 km in the case of passing through the control area and 105.365 km in the case of bypassing, which were less than the distances in the passage plan of the actual ship by approximately 13.18% and 7.27%, respectively. The experimental results of the proposed approach show the possibility of automatically establishing the shortest-distance passage plan for a ship considering the navigable area. In addition, this study suggests an effective approach for coastal navigation, which is more complex than ocean navigation. Further, this study can serve as a basis for generating passage plans for maritime autonomous surface ships.

Auto-Routing Systems (ARSs) with 3D Piping for Sustainable Plant Projects Based on Artificial Intelligence (AI) and Digitalization of 2D Drawings and Specifications

“…Tsai et al [70] developed a site pipeline inspection and auto-adjusting approach by utilizing augmented reality and a grid-based path planning algorithm. Lee et al [71] presented a method for generating the shortest passage plan for a navigable ship based on the automatic identification system data. However, the presented method necessitates a comprehensive setup of the environment and data for its application to alternative routes.…”

Maritime Transport Network in Korea: Spatial-Temporal Density and Path Planning

“…The nodes generated through the quadtree were used to create a quadtree-based graph, and Dijkstra's algorithm was applied to extract the shortest path. Lee et al used the depth data to detect the shortest maritime traffic routes for AIS-based ships [24]. Depth is the most important parameter for preventing maritime accidents when planning ship routes.…”

Replacement of Defected Battle Tankers in Military

“…Graphs can be traversed and analysed using various algorithms. Some of the most common graph algorithms include depth-first search (DFS), breadthfirst search (BFS), Dijkstra's algorithm (7,8) for finding the shortest path (9)(10)(11) , and Kruskal's algorithm for finding the minimum spanning tree. Graph theory provides a rich set of concepts and techniques for analysing and solving graph-related problems.…”

“…The Controller immediately finds the type of problem that occurred and rectifies it with the help of the other attributes mentioned. If the tanker is damaged, then it must be completely replaced with the nearby tanker, which is known by calculating the shortest path (9)(10)(11) from the source tanker. Otherwise, if the tanker is in repairable condition, the controller identifies the type of repair that occurred, calls the specialist for that type of repair, and rectifies the problem.…”