{'fraction_non_alphanumeric': 0.016538037486218304, 'fraction_numerical': 0.0, 'mean_word_length': 4.858064516129033, '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}}
Best-first branch and bound search method for map based localization

To know the pose of the robot is one of the central requirements in many applications. A localization algorithm should be robust, it should give the estimate of unreliability and it should be able to recover from errors. The above requirements are often trade offs with the computational complexity. This paper presents a global localization algorithm that matches a local point map (acquired e.g. with a laser range finder) to a global map. The algorithm makes a discrete search using a best-first branch and bound method to efficiently compute the globally optimal pose estimate. Moreover, the degree of ambiguity of the pose estimate can be determined as the algorithm yields all potential pose solution candidates within the search space. Experimental results are given to show the behavior and performance analysis of the algorithm.