Energy-Efficient Route Planning Method for Ships Based on Level Set

To reduce the fuel consumption of ships' oceanic voyages, this study incorporates the influence of ocean currents into the traditional level set algorithm and proposes a route planning algorithm capable of identifying energy-efficient routes in complex and variable sea conditions. The approach introduces the influence factor of ocean current to optimize routing in dynamically changing marie environments. First, models for the energy consumption of ships and flow fields are established. The level set curve is then evolved by integrating the flow environment and energy consumption gradient, solving the Hamilton-Jacobi equation with energy consumption parameters. The optimal path is subsequently determined through backtracking along the energy consumption gradient, enabling energy-efficient route planning from the starting point to the endpoint in complex ocean conditions. To verify the effectiveness of the proposed algorithm, its performance is evaluated through two case studies, comparing energy consumption under different environmental conditions. The experimental results demonstrate that, compared to the shortest path method based on the level set algorithm, the proposed approach achieves an energy saving rate of approximately 2.1% in obstacle-free environments and 1.4% in environments with obstacles.

Authors

Institutions

Publication Details

Journal
Sensors
Published
2025-01-10
DOI
https://doi.org/10.3390/s25020381
Citations
5
Primary Topic
Maritime Navigation and Safety
Type
article
Field-Weighted Citation Impact
5.73

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Energy-Efficient Route Planning Method for Ships Based on Level Set

Qiangrong Tang, Yalei Yu, Haiqing Shen, Qin Zhong et al.
5 citations
Sensors
Maritime Navigation and Safety
5.73
article

Energy-Efficient Route Planning Method for Ships Based on Level Set

Qiangrong Tang, Yalei Yu, Haiqing Shen, Qin Zhong, Jingwei Zhu
article en
5 citations

Abstract

To reduce the fuel consumption of ships' oceanic voyages, this study incorporates the influence of ocean currents into the traditional level set algorithm and proposes a route planning algorithm capable of identifying energy-efficient routes in complex and variable sea conditions. The approach introduces the influence factor of ocean current to optimize routing in dynamically changing marie environments. First, models for the energy consumption of ships and flow fields are established. The level set curve is then evolved by integrating the flow environment and energy consumption gradient, solving the Hamilton-Jacobi equation with energy consumption parameters. The optimal path is subsequently determined through backtracking along the energy consumption gradient, enabling energy-efficient route planning from the starting point to the endpoint in complex ocean conditions. To verify the effectiveness of the proposed algorithm, its performance is evaluated through two case studies, comparing energy consumption under different environmental conditions. The experimental results demonstrate that, compared to the shortest path method based on the level set algorithm, the proposed approach achieves an energy saving rate of approximately 2.1% in obstacle-free environments and 1.4% in environments with obstacles.

SensorsVol. 25(2)
Loughborough University (GB), Guangzhou University (CN), Guangzhou Maritime College (CN)
National Natural Science Foundation of China, Fundamental Research Funds for the Central Universities
Affordable and clean energy
Openalex Percentile: Top 5%
Maritime Navigation and Safety
5.73
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.