{'fraction_non_alphanumeric': 0.01929824561403509, 'fraction_numerical': 0.0, 'mean_word_length': 5.206521739130435, '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}}
Visual Landmark Selection for Mobile Robot Navigation

A large number of landmarks selection techniques has been proposed. However, finding optimal solutions requires to solve some hard problems. In this paper, we consider the ρminimum overlapping region decomposition problem that was proposed for landmarks selection. This problem is NP-complete. We describe an approach to solve the problem optimally. This approach is based on an explicit reduction from the problem to the satisfiability problem. Also, we consider some greedy algorithms for solution of the problem.