Similarity measurement’s comparison with mapping and localization in large-scale

摘要

Simultaneous Localization and Mapping (SLAM) is a mission or task that involves estimating a robot's location and reconstructing its surroundings based on sensor data. For autonomous mobile robots, the capacity to learn a regular model of its environment is a prerequisite. The fact that loops in the environment generate stimulating data association challenges is a particularly difficult problem in obtaining surroundings maps of closing loops. One of the most difficult aspects of SLAM research is loop closing. The increasing uncertainty in local mapping and the productivity of the local map representation contribute to a given environment's difficulties in loop closures. The most difficult aspect of SLAM is management uncertainty. False matches caused by a lack of clarity in the environment are one of the most significant obstacles to properly closing huge loops. When evaluating whether or not to accept a map-match, there are a variety of methodologies or similarity metrics to consider. In order to determine the least map-match error, this study examined different similarity metrics such as ((Jaccard, Euclidean, Cityblock, Chebyshev, Cosine, Spearman, Variable, Correlation). When comparing the various similarity metrics, the Cosine technique had the lowest inaccuracy of all the methods, while the Correlation method had the fastest execution time.