Discrete mission planning algorithm for air-sea integrated search model
Abstract The selection of optimal search effort for air-sea integrated search has become the most concerned issue for maritime search and rescue (MSAR) departments. Helicopters play an important role in maritime search because of their strong maneuverability and hovering ability. In this work, the r...
Saved in:
| Main Author: | |
|---|---|
| Format: | article |
| Language: | EN |
| Published: |
Nature Portfolio
2021
|
| Subjects: | |
| Online Access: | https://doaj.org/article/d65e765aeebb4b9ea38c6d26b0b127fa |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Abstract The selection of optimal search effort for air-sea integrated search has become the most concerned issue for maritime search and rescue (MSAR) departments. Helicopters play an important role in maritime search because of their strong maneuverability and hovering ability. In this work, the requirements of maritime search were analyzed, from which a global optimization model with quantitative constraints for vessels and aircraft was developed by setting the least search time as single-objective optimization problem; then the improved Dinkelbach algorithm was used to solve the continuous programming problem, and the discrete mission planning algorithm was used to improve the calculation accuracy of search time and area. A case study shows that the errors in calculating search time and area decrease from 12–18 min to 36 s and from 76.5 to 0.45 n mile2, respectively. The results obtained from the discrete mission planning algorithm can provide better guidance for MASR departments in selecting optimal search scheme. |
|---|