{'fraction_non_alphanumeric': 0.02490421455938697, 'fraction_numerical': 0.0, 'mean_word_length': 5.111111111111111, '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}}
Symmetrical model based SLAM [M-SLAM] for a quick map-search

The mobile robot which accomplishes a work in explored region does not know location information of surroundings. Traditionally, simultaneous localization and mapping(SLAM) algorithms solve the localization and mapping problem in explored regions. Among the several SLAM algorithms, the EKF (Extended Kalman Filter) based SLAM is the scheme most widely used. The EKF is the optimal sensor fusion method which has been used for a long time. The odometric error caused by an encoder can be compensated by an EKF, which fuses different types of sensor data with weights proportional to the uncertainty of each sensor. In many cases the EKF based SLAM requires artificially installed features, which causes difficulty in actual implementation. Moreover, the computational complexity involved in an EKF increases as the number of features increases. And SLAM is a weak point of long operation time. Therefore, this paper presents a symmetrical model based SLAM algorithm (called M-SLAM).