A Boundary Adaptive Neural Network Coverage Path Planning Algorithm for Maritime Search and Rescue With AUVs Based on Target Drift Prediction
The development of maritime trade and operations has led to a gradual increase in maritime accidents. Research on the specificity of maritime search and rescue (SAR) missions is essential to improve mission efficiency; however, traditional SAR programs usually use predefined paths to conduct searche...
Saved in:
| Published in | Journal of field robotics |
|---|---|
| Main Authors | , , , , , , |
| Format | Journal Article |
| Language | English |
| Published |
23.09.2025
|
| Online Access | Get full text |
| ISSN | 1556-4959 1556-4967 |
| DOI | 10.1002/rob.70053 |
Cover
| Summary: | The development of maritime trade and operations has led to a gradual increase in maritime accidents. Research on the specificity of maritime search and rescue (SAR) missions is essential to improve mission efficiency; however, traditional SAR programs usually use predefined paths to conduct searches, which is difficult to meet the timeliness and uncertainty requirements. To solve the challenge, we propose a Boundary Adaptive Neural Network Coverage Path Planning Scheme based on Target Drift Prediction (BANCP‐TDP). The framework includes three modules: drift trajectory prediction, optimal region determination, and coverage search. First, the Limited Red‐billed Blue Magpie Optimizer Back Propagation drift model is used to predict the drift trajectory of the wrecked target. Subsequently, we use the Multiphysics Monte Carlo Gravitational Search prediction model to determine the distribution of targets at different moments and the optimal SAR region for guiding an autonomous underwater vehicle to carry out SAR missions. Then, we propose a BANCP for the SAR regions with complex boundaries, aiming to minimize the path length and maximize the coverage ratio. The comparative field experiments at Qingdao Jin Cao Gou reservoir and simulation results show that the proposed framework can effectively shorten path length while minimizing the repeated paths. |
|---|---|
| ISSN: | 1556-4959 1556-4967 |
| DOI: | 10.1002/rob.70053 |