{'fraction_non_alphanumeric': 0.014989293361884369, 'fraction_numerical': 0.0, 'mean_word_length': 5.404109589041096, '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}}
Near-optimal landmark selection for mobile robot navigation

The ability to accurately localize themselves is a fundamental pre-condition for service robots designed to carry out navigation and transportation tasks. Because of the high degree of dynamics in populated and real-world environments, often artificial landmarks are used to achieve the desired accuracy in localization. In this paper we consider the problem of optimally placing landmarks for robots navigating frequently on similar trajectories. Our method maximizes conditional mutual information of the states of the robot given the landmark observations. It uses a greedy algorithm which approximates the solution of the NP-hard maximization problem. For this algorithm, we derive a tight constant-factor bound on the approximation error. We furthermore evaluate the selected landmark sets in extensive experiments carried out both in simulation and with a real robot.