Area Decomposition Algorithm for Large Region Maritime Search

Abstract

In this paper, an area decomposition algorithm is presented that is suitable for multiple vessels and multiple aircraft participating in maritime searches over a large region. The algorithm can decompose the entire sea region to be searched (deemed as polygonal area) into nonoverlapping subpolygons (search subareas) according to the sizes of the areas covered by various search facilities while considering their search capabilities as well as their corresponding commence search points. The algorithm draws on the concept of a polygon division algorithm in computational geometry. The main novelty in this study is the optimization of the classic polygon division algorithm by introducing a “maximizing-minimum-angle” strategy, which can effectively compensate for the deficiency of the traditional algorithm, as reflected in the area decomposition result. This improved algorithm can produce rectangle-like subareas, especially for a rectangular search region, which is commonly used in maritime search operations. For nonrectangular search regions, a right-angle division can be achieved so that the shapes of the search subareas are more conducive to planning specific search routes for search facilities. Fast maritime search coverage over a large region can be achieved. The effectiveness of the algorithm is validated by comparing decomposition results before and after the improvement.

Keywords

• Maritime search
• area decomposition
• marine safety
• search facility
• search subarea