{'fraction_non_alphanumeric': 0.019464720194647202, 'fraction_numerical': 0.0, 'mean_word_length': 5.242424242424242, '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}}
Computational complexities of honey-pot searching with local sensory information

We investigate the problem of searching for a hidden target in a bounded region of the plane, by an autonomous robot, which is only able to use limited local sensory information. We formalize a discrete version of the problem as a "reward-collecting" path problem and provide efficient approximation algorithms for various cases.