{'fraction_non_alphanumeric': 0.014925373134328358, 'fraction_numerical': 0.0, 'mean_word_length': 5.648648648648648, '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}}
FastSLAM and Its Data Association Approaches for Mobile Robots

This paper discusses the data association issues of the FastSLAM (factored solution to SLAM) algorithm that recursively estimates the full posterior distribution of both robot pose and landmark locations. In traditional FastSLAM, it always hypothesizes that the data association is certain. But in real world, the data association is uncertain. In this paper, we present an extension to FastSLAM that handle the uncertainty in the data association using an approach that unites per-particle maximum likelihood data association and negative information technology. Experimental results show that the improved FastSLAM has advantages over the traditional FastSLAM approaches.