{'fraction_non_alphanumeric': 0.012448132780082987, 'fraction_numerical': 0.0, 'mean_word_length': 5.414893617021277, '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}}
Optimal non-Markovian composite search algorithms for spatially correlated targets

We study the efficiency of a wide class of stochastic non-Markovian search strategies for spatially correlated target distributions. For an uninformed searcher that performs a non-composite random search, a ballistically moving search is optimal for destructible targets, even when the targets are correlated. For an informed searcher that can measure the time elapsed since the last target encounter and performs a composite search consisting of alternating extensive ballistic trajectories and intensive non-Markovian search trajectories, the efficiency can be more than three times higher compared to a ballistic searcher. We optimize the memory function that describes the intensive non-Markovian search motion and find a single-exponential memory function to be optimal. In our extended search model the intensive search mode is activated when the distance between two consecutively found targets in the extensive search mode is smaller than a threshold length called the memory distance d m . We find that a finite value of d m quite generally leads to optimal search efficiency for correlated target distributions.