Operating multiple robots in an unstructured environment is challenging due to its high complexity and uncertainty. In such applications, the integration of individual maps generated by heterogeneous sensors is a… Click to show full abstract
Operating multiple robots in an unstructured environment is challenging due to its high complexity and uncertainty. In such applications, the integration of individual maps generated by heterogeneous sensors is a critical problem, especially the fusion of sparse and dense maps. This paper proposes a general multi-level probabilistic framework to address the integrated map fusion problem, which is independent of sensor type and SLAM algorithm employed. The key novelty of this paper is the mathematical formulation of the overall map fusion problem and the derivation of its probabilistic decomposition. The framework provides a theoretical basis for computing the relative transformations amongst robots and merging probabilistic map information. Since the maps generated by heterogeneous sensors have different physical properties, an expectation-maximization-based map-matching algorithm is proposed which automatically determines the number of voxels to be associated. Then, a time-sequential map merging strategy is developed to generate a globally consistent map. The proposed approach is evaluated in various environments with heterogeneous sensors, which demonstrates its accuracy and versatility in 3-D multirobot map fusion missions.
               
Click one of the above tabs to view related content.