journal article·2024-12-01Open access

The Concept of Determining a Ship’s Route Based on the Capability Plot and Dijkstra’s Algorithm—Finding the Ship’s Route Between Anchorages

Jakub Wnorowski, Andrzej Łebkowski

Applied Sciences· Volume 14· Issue 23

Abstract

Determining the route from the starting point to the destination is one of the first tasks performed when planning a ship’s voyage. Before the computer age, routes were plotted manually by seafarers based on maps. Nowadays, algorithms are used for this purpose, which make it possible to reach any port in the world. In scientific publications, one can mostly find algorithms that generate global routes based on historical weather and traffic data on major sea lanes. Such routes do not take into account the current hydrometeorological conditions in the area where the ship is currently located, so that disturbances generated by environmental forces can increase energy consumption. A solution to the problem can be local routing based on the currently prevailing hydrometeorological conditions. With this approach, it is possible to respond to dynamically changing sea conditions, determine the route along which the impact of environmental forces on the hull will be least severe and minimize fuel and energy consumption. This paper presents an algorithm that determines the local passage route of an offshore ship using the example of a vessel moving to an anchorage to drop anchor. The algorithm defines a grid of points between the start point (the vessel’s current position) and the end point (the anchor position), and then determines the transition weights between each grid point based on the vessel’s capability plots. Finally, a modified Dijkstra algorithm determines the route where the sum of the transition weights will be as small as possible. During the tests, it was found that the time needed to find the passage route depended on the chosen grid density of the waypoints and was as follows: for a 6 × 6 grid—0.05 s, for an 11 × 11 grid—0.36 s, for a 16 × 16 grid—0.47 s and for a 21 × 21 grid—0.85 s. It was also found that the algorithm identified a route where the impact of environmental forces on the ship’s hull was 13% less than the direct route to the destination, resulting in a 7.5% reduction in energy consumption. The operation of the algorithm for determining the passage route was demonstrated in the anchor design tool developed in the Unity3D environment.
Source: crossref · Quality: baseline

Research context

OpenAlex topics: Maritime Navigation and Safety · Maritime Ports and Logistics · Ship Hydrodynamics and Maneuverability

SciVX discovery tags are terminology-based. OpenAlex topics are source-provided classifications.

Affiliations

Department of Renewable Energy Sources and Electromobility, Faculty of Electrical Engineering, Gdynia Maritime University, Morska St. 83, 81-225 Gdynia, Poland

Funding

Electrical Engineering Faculty, Gdynia Maritime University, Poland

References (36)

Show source-provided references
1. The U.S. Navy hydrographic office ship routing program10.1002/j.2161-4296.1958.tb02437.x ↗
2. James, R.J. (1957). Application of Wave Forecast to Marine Navigation. [Ph.D. Thesis, New York University].
3. Pierson, W.J., Neuman, G., and James, R.W. (1955). Practical Methods for Observing and Forecasting Ocean Waves by Means of Wave Spectra and Statistics. (Reprinted 1971).
4. An Improved Genetic Algorithm for Island Route Planning10.1016/j.proeng.2017.01.163 ↗
5. Yanchin, I., and Petrov, O. (2019). Parallel Genetic Algorithm for Planning Safe and Optimal Route for Ship. arXiv.
6. Zhao, W., Wang, Y., Zhang, Z., and Wang, H. (2021). Multicriteria Ship Route Planning Method Based on Improved Particle Swarm Optimization–Genetic Algorithm. J. Mar. Sci. Eng., 9.10.3390/jmse9040357 ↗
7. A genetic algorithm for finding realistic sea routes considering the weather10.1007/s10732-020-09449-7 ↗
8. Ship Route Planning Based on Double-Cycling Genetic Algorithm Considering Ship Maneuverability Constraint10.1109/ACCESS.2020.3031739 ↗
9. Multi-vessels collision avoidance strategy for autonomous surface vehicles based on genetic algorithm in congested port environment10.21278/brod73305 ↗
10. Collision-avoidance path planning for multi-ship encounters considering ship manoeuvrability and COLREGs
11. Wu, Y., Wang, T., and Liu, S. (2024). A Review of Path Planning Methods for Marine Autonomous Surface Vehicles. J. Mar. Sci. Eng., 12.10.3390/jmse12050833 ↗
12. Pennino, S., Gaglione, S., Innac, A., Piscopo, V., and Scamardella, A. (2020). Development of a New Ship Adaptive Weather Routing Model Based on Seakeeping Analysis and Optimization. J. Mar. Sci. Eng., 8.10.3390/jmse8040270 ↗
13. Jang, D., and Kim, J. (2022). Development of Ship Route-Planning Algorithm Based on Rapidly-Exploring Random Tree (RRT*) Using Designated Space. J. Mar. Sci. Eng., 10.10.3390/jmse10121800 ↗
14. A Method for Ship Route Planning Fusing the Ant Colony Algorithm and the A* Search Algorithm10.1109/ACCESS.2023.3243810 ↗
15. Modeling and Optimization Algorithms in Ship Weather Routing
16. AIS Based Shipping Routes Using the Dijkstra Algorithm10.12716/1001.13.03.11 ↗
17. Lee, J.-S., Kim, T.-H., and Park, Y.-G. (2023). Maritime Transport Network in Korea: Spatial-Temporal Density and Path Planning. J. Mar. Sci. Eng., 11.10.3390/jmse11122364 ↗
18. Li, Y., Cui, J., Zhang, X., and Yang, X. (2023). A Ship Route Planning Method under the Sailing Time Constraint. J. Mar. Sci. Eng., 11.10.3390/jmse11061242 ↗
19. Research on Ship Meteorological Route Based on A-Star Algorithm
20. A comprehensive ship weather routing system using CMEMS products and A* algorithm10.1016/j.oceaneng.2022.111427 ↗
21. Wang, Y., Qian, L., Hong, M., Luo, Y., and Li, D. (2024). Multi-Objective Route Planning Model for Ocean-Going Ships Based on Bidirectional A-Star Algorithm Considering Meteorological Risk and IMO Guidelines. Appl. Sci., 14.10.3390/app14178029 ↗
22. Liu, C., Mao, Q., Chu, X., and Xie, S. (2019). An Improved A-Star Algorithm Considering Water Current, Traffic Separation and Berthing for Vessel Path Planning. Appl. Sci., 9.10.3390/app9061057 ↗
23. An Ant Colony Algorithm for efficient ship routing10.2478/pomr-2013-0032 ↗
24. Research on Global Ship Path Planning Method Based on Improved Ant Colony Algorithm10.1109/OJITS.2023.3247377 ↗
25. Mobile robot path planning using an improved ant colony optimization10.1177/1729881418774673 ↗
26. Dynamic Multi-Role Adaptive Collaborative Ant Colony Optimization for Robot Path Planning10.1109/ACCESS.2020.3009399 ↗
27. Ant colony optimization for path planning in search and rescue operations10.1016/j.ejor.2022.06.019 ↗
28. Optimal search and rescue route design using an improved ant colony optimization10.5755/j01.itc.49.3.25295 ↗
29. The study of ship collision avoidance route planning by ant colony algorithm
30. Shen, Y., Wang, F., Zhao, P., Tong, X., Huang, J., Chen, K., and Zhang, H. (2019, January 6–8). Ship Route Planning Based on Particle Swarm Optimization. Proceedings of the 2019 34rd Youth Academic Annual Conference of Chinese Association of Automation (YAC), Jinzhou, China.10.1109/YAC.2019.8787628 ↗
31. Yujie, L., Yu, P., Yixin, S., Huajun, Z., Danhong, Z., and Yong, S. (December, January 30). Ship Path Planning Based on Improved Particle Swarm Optimization. Proceedings of the 2018 Chinese Automation Congress (CAC), Xi’an, China.10.1109/CAC.2018.8623037 ↗
32. Li, B., Chiong, R., and Gong, L. (2014, January 6–11). Search-evasion path planning for submarines using the Artificial Bee Colony algorithm. Proceedings of the 2014 IEEE Congress on Evolutionary Computation (CEC), Beijing, China.10.1109/CEC.2014.6900224 ↗
33. Fossen, T.I. (2011). Handbook of Marine Craft Hydrodynamics and Motion Control, Wiley.10.1002/9781119994138 ↗
34. Robert Stewart (2024, October 15). Ocean-Wave Spectra. Available online: https://wikiwaves.org/Ocean-Wave_Spectra.
35. DNV (2024, October 15). Main Website. Available online: https://www.dnv.com/index.html.
36. Optimal constrained control allocation in marine surface vessels with rudders10.1016/j.conengprac.2007.01.012 ↗