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

被引:0
|
作者
Wnorowski, Jakub [1 ]
Lebkowski, Andrzej [1 ]
机构
[1] Gdyn Maritime Univ, Fac Elect Engn, Dept Renewable Energy Sources & Electromobil, Morska St 83, PL-81225 Gdynia, Poland
来源
APPLIED SCIENCES-BASEL | 2024年 / 14卷 / 23期
关键词
dynamic positioning system; route planning; Dijkstra's algorithm; Unity3D; GENETIC ALGORITHM; MANEUVERABILITY; OPTIMIZATION;
D O I
10.3390/app142311205
中图分类号
O6 [化学];
学科分类号
0703 ;
摘要
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 x 6 grid-0.05 s, for an 11 x 11 grid-0.36 s, for a 16 x 16 grid-0.47 s and for a 21 x 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.
引用
收藏
页数:24
相关论文
共 50 条
  • [1] The Concept of Determining the Ship's Route Based on the Capability Plots
    Wnorowski, J.
    Lebkowski, A.
    TRANSNAV-INTERNATIONAL JOURNAL ON MARINE NAVIGATION AND SAFETY OF SEA TRANSPORTATION, 2023, 17 (01) : 193 - 197
  • [2] On the Method of Ship's Transoceanic Route Planning
    Pipchenko, O. D.
    TRANSNAV-INTERNATIONAL JOURNAL ON MARINE NAVIGATION AND SAFETY OF SEA TRANSPORTATION, 2011, 5 (03) : 385 - 392
  • [3] Determination of least polluted route using Dijkstra’s algorithm
    B. Deep
    International Journal of Environmental Science and Technology, 2023, 20 : 13289 - 13298
  • [4] Determination of least polluted route using Dijkstra's algorithm
    Deep, B.
    INTERNATIONAL JOURNAL OF ENVIRONMENTAL SCIENCE AND TECHNOLOGY, 2023, 20 (12) : 13289 - 13298
  • [5] A genetic algorithm for finding a salesman’s route
    V. V. Kureichik
    V. M. Kureichik
    Journal of Computer and Systems Sciences International, 2006, 45 : 89 - 95
  • [6] Public Transport Route Planning: Modified Dijkstra's Algorithm
    Bozyigit, Alican
    Alankus, Gazihan
    Nasiboglu, Efendi
    2017 INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE AND ENGINEERING (UBMK), 2017, : 502 - 505
  • [7] A genetic algorithm for finding a salesman's route
    Kureichik, V. V.
    Kureichik, V. M.
    JOURNAL OF COMPUTER AND SYSTEMS SCIENCES INTERNATIONAL, 2006, 45 (01) : 89 - 95
  • [8] Sources and the structure of the weather data used for the optimization of the ship's route
    Medyna, Piotr
    Wisniewski, Bernard
    SCIENTIFIC JOURNALS OF THE MARITIME UNIVERSITY OF SZCZECIN-ZESZYTY NAUKOWE AKADEMII MORSKIEJ W SZCZECINIE, 2012, 30 (102): : 88 - 92
  • [9] Ship's route planning in a limited area with speed changing requirement
    Korenev, Alexei S.
    Khabarov, Sergei P.
    Shpectorov, Andrei G.
    MARINE INTELLECTUAL TECHNOLOGIES, 2022, (01): : 160 - 168
  • [10] The Optimization of Logistics Distribution Route Based on Dijkstra's Algorithm and C-W Savings Algorithm
    Ding, Dan
    Zou, Xin
    PROCEEDINGS OF THE 2016 6TH INTERNATIONAL CONFERENCE ON MACHINERY, MATERIALS, ENVIRONMENT, BIOTECHNOLOGY AND COMPUTER (MMEBC), 2016, 88 : 956 - 965