{'fraction_non_alphanumeric': 0.008724100327153763, 'fraction_numerical': 0.0, 'mean_word_length': 5.244897959183674, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
A novel optimal route planning algorithm for searching on the sea

ABSTRACT Emergency search and rescue on the sea is an important part of national emergency response for marine perils. Optimal route planning for maritime search and rescue is the key capability to reduce the searching time, improve the rescue efficiency, as well as guarantee the rescue target’s safety of life and property. The main scope of the searching route planning is to optimise the searching time and voyage within the constraints of missing search rate and duplicate search rate. This paper proposes an optimal algorithm for searching routes of large amphibious aircraft corresponding to its flight characteristics and sea rescue capability. This algorithm transforms the search route planning problem into a discrete programming problem and applies the route traceback indexes to satisfy the duplicate search rate and missing search rate.