EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Autonomous Coverage Path Planning Model for Maritime Search and Rescue with UAV Application

Chuxiong Zhang, Ning Huang, Chaoxian Wu

Journal of Marine Science and Engineering · 09.09.2025 · 13 (9) · 1735

DOI: 10.3390/jmse13091735 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Journal of Marine Science and Engineering, online erschienen am 09.09.2025. Verfasst von Chuxiong Zhang und 2 weiteren Autor:innen. Die Arbeit wurde bisher 13-mal zitiert (Crossref) und nennt 40 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: the University Industry-University-Research Innovation Fund for New Generation Information Technology Innovation, Ministry of Education, China, Sun Yat-sen University, Aeronautical Science Foundation of China.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Maritime transport is vital to the global economy, yet the frequency of natural disasters at sea continues to rise, resulting in more persons falling overboard. Therefore, effective maritime search and rescue (SAR) hinges on accurately predicting the probable distribution of drifting victims and on rapidly devising an optimal search plan. Conventional SAR operations either rely on rigid, pre-defined patterns or employ reinforcement-learning techniques that yield non-unique solutions and incur excessive computational time. To overcome these shortcomings, we propose an adaptive SAR framework that integrates three modules: (i) the AP98 maritime-drift model, (ii) Monte Carlo particle simulation, and (iii) a mixed-integer linear programming (MILP) model. First, Monte Carlo particles are propagated through the AP98 model to generate a probability density map of the victim’s location. Subsequently, the MILP model maximizes the cumulative probability of rescue success while minimizing a composite cost index, producing optimal UAV search trajectories solved via Gurobi. Experimental results on a 10 km × 10 km scenario with five UAVs show that, compared with traditional parallel-line search, the proposed MILP approach increases cumulative success probability by 12.4% within the first twelve search steps, eliminates path overlap entirely, and converges in 9.5 s with an optimality gap of 0.79%, thereby demonstrating both efficiency and real-time viability. When MIPFocus (a solver setting in Gurobi that controls the emphasis of the Mixed Integer Programming solver) aims at the optimal solution and uses the parallel solution method at the same time, the best result is achieved.

Förderung

  • the University Industry-University-Research Innovation Fund for New Generation Information Technology Innovation, Ministry of Education, China
  • Sun Yat-sen University
  • Aeronautical Science Foundation of China

Zitieren

APA

Zhang, C., Huang, N., & Wu, C. (2025). Autonomous Coverage Path Planning Model for Maritime Search and Rescue with UAV Application. Journal of Marine Science and Engineering, 13(9), 1735. https://doi.org/10.3390/jmse13091735

Vancouver

Zhang C, Huang N, Wu C. Autonomous Coverage Path Planning Model for Maritime Search and Rescue with UAV Application. Journal of Marine Science and Engineering. 2025;13(9):1735. doi:10.3390/jmse13091735

BibTeX
@article{Zhang2025,
  author = {Zhang, Chuxiong and Huang, Ning and Wu, Chaoxian},
  title = {Autonomous Coverage Path Planning Model for Maritime Search and Rescue with UAV Application},
  journal = {Journal of Marine Science and Engineering},
  year = {2025},
  volume = {13},
  number = {9},
  pages = {1735},
  doi = {10.3390/jmse13091735}
}
Kostenlos starten →