map merging
Recently Published Documents


TOTAL DOCUMENTS

82
(FIVE YEARS 23)

H-INDEX

14
(FIVE YEARS 2)

2021 ◽  
Vol 21 (4) ◽  
pp. 1-21
Author(s):  
Zhiyang Lin ◽  
Jihua Zhu ◽  
Zutao Jiang ◽  
Yujie Li ◽  
Yaochen Li ◽  
...  

Building an accurate map is essential for autonomous robot navigation in the environment without GPS. Compared with single-robot, the multiple-robot system has much better performance in terms of accuracy, efficiency and robustness for the simultaneous localization and mapping (SLAM). As a critical component of multiple-robot SLAM, the problem of map merging still remains a challenge. To this end, this article casts it into point set registration problem and proposes an effective map merging method based on the context-based descriptors and correspondence expansion. It first extracts interest points from grid maps by the Harris corner detector. By exploiting neighborhood information of interest points, it automatically calculates the maximum response radius as scale information to compute the context-based descriptor, which includes eigenvalues and normals computed from local structures of each interest point. Then, it effectively establishes origin matches with low precision by applying the nearest neighbor search on the context-based descriptor. Further, it designs a scale-based corresponding expansion strategy to expand each origin match into a set of feature matches, where one similarity transformation between two grid maps can be estimated by the Random Sample Consensus algorithm. Subsequently, a measure function formulated from the trimmed mean square error is utilized to confirm the best similarity transformation and accomplish the coarse map merging. Finally, it utilizes the scaling trimmed iterative closest point algorithm to refine initial similarity transformation so as to achieve accurate merging. As the proposed method considers scale information in the context-based descriptor, it is able to merge grid maps in diverse resolutions. Experimental results on real robot datasets demonstrate its superior performance over other related methods on accuracy and robustness.


2021 ◽  
Author(s):  
Heoncheol Lee

Multi-robot systems have recently been in the spotlight in terms of efficiency in performing tasks. However, if there is no map in the working environment, each robot must perform SLAM which simultaneously performs localization and mapping the surrounding environments. To operate the multi-robot systems efficiently, the individual maps should be accurately merged into a collective map. If the initial correspondences among the robots are unknown or uncertain, the map merging task becomes challenging. This chapter presents a new approach to accurately conducting grid map merging with the Ant Colony Optimization (ACO) which is one of the well-known sampling-based optimization algorithms. The presented method was tested with one of the existing grid map merging algorithms and showed that the accuracy of grid map merging was improved by the ACO.


Electronics ◽  
2021 ◽  
Vol 10 (7) ◽  
pp. 815
Author(s):  
Baifan Chen ◽  
Siyu Li ◽  
Haowu Zhao ◽  
Limei Liu

For the map building of unknown indoor environment, compared with single robot, multi-robot collaborative mapping has higher efficiency. Map merging is one of the fundamental problems in multi-robot collaborative mapping. However, in the process of grid map merging, image processing methods such as feature matching, as a basic method, are challenged by low feature matching rate. Driven by this challenge, a novel map merging method based on suppositional box that is constructed by right-angled points and vertical lines is proposed. The paper firstly extracts right-angled points of suppositional box selected from the vertical point which is the intersection of the vertical line. Secondly, based on the common edge characteristics between the right-angled points, suppositional box in the map is constructed. Then the transformation matrix is obtained according to the matching pair of suppositional boxes. Finally, for matching errors based on the length of pairs, Kalman filter is used to optimize the transformation matrix. Experimental results show that this method can effectively merge map in different scenes and the successful matching rate is greater than that of other features.


Sensors ◽  
2020 ◽  
Vol 20 (23) ◽  
pp. 6988
Author(s):  
Shuien Yu ◽  
Chunyun Fu ◽  
Amirali K. Gostar ◽  
Minghui Hu

When multiple robots are involved in the process of simultaneous localization and mapping (SLAM), a global map should be constructed by merging the local maps built by individual robots, so as to provide a better representation of the environment. Hence, the map-merging methods play a crucial rule in multi-robot systems and determine the performance of multi-robot SLAM. This paper looks into the key problem of map merging for multiple-ground-robot SLAM and reviews the typical map-merging methods for several important types of maps in SLAM applications: occupancy grid maps, feature-based maps, and topological maps. These map-merging approaches are classified based on their working mechanism or the type of features they deal with. The concepts and characteristics of these map-merging methods are elaborated in this review. The contents summarized in this paper provide insights and guidance for future multiple-ground-robot SLAM solutions.


2020 ◽  
Vol 134 ◽  
pp. 103649
Author(s):  
Yangmin Xie ◽  
Yujie Tang ◽  
Rui Zhou ◽  
Yukun Guo ◽  
Hang Shi
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document