Multi-Robot 2.5D Localization and Mapping Using a Monte Carlo Algorithm on a Multi-Level Surface

Most indoor environments have wheelchair adaptations or ramps, providing an opportunity for mobile robots to navigate sloped areas avoiding steps. These indoor environments with integrated sloped areas are divided into different levels. The multi-level areas represent a challenge for mobile robot navigation due to the sudden change in reference sensors as visual, inertial, or laser scan instruments. Using multiple cooperative robots is advantageous for mapping and localization since they permit rapid exploration of the environment and provide higher redundancy than using a single robot. This study proposes a multi-robot localization using two robots (leader and follower) to perform a fast and robust environment exploration on multi-level areas. The leader robot is equipped with a 3D LIDAR for 2.5D mapping and a Kinect camera for RGB image acquisition. Using 3D LIDAR, the leader robot obtains information for particle localization, with particles sampled from the walls and obstacle tangents. We employ a convolutional neural network on the RGB images for multi-level area detection. Once the leader robot detects a multi-level area, it generates a path and sends a notification to the follower robot to go into the detected location. The follower robot utilizes a 2D LIDAR to explore the boundaries of the even areas and generate a 2D map using an extension of the iterative closest point. The 2D map is utilized as a re-localization resource in case of failure of the leader robot.

A Review on Map-Merging Methods for Typical Map Types in Multiple-Ground-Robot SLAM Solutions

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.

Merging of appearance-based place knowledge among multiple robots

If robots can merge the appearance-based place knowledge of other robots with their own, they can relate to these places even if they have not previously visited them. We have investigated this problem using robots with compatible visual sensing capabilities and with each robot having its individual long-term place memory. Here, each place refers to a spatial region as defined by a collection of appearances and in the place memory, the knowledge is organized in a tree hierarchy. In the proposed merging approach, the hierarchical organization plays a key role—as it corresponds to a nested sequence of hyperspheres in the appearance space. The merging proceeds by considering the extent of overlap of the respective nested hyperspheres—starting with the largest covering hypersphere. Thus, differing from related work, knowledge is merged in as large chunks as possible while the hierarchical structure is preserved accordingly. As such, the merging scales better as the extent of knowledge to be merged increases. This is demonstrated in an extensive set of multirobot experiments where robots share their knowledge and then use their merged knowledge when visiting these places.

Heterogeneous Map Merging: State of the Art

Multi-robot mapping and environment modeling have several advantages that makeit an attractive alternative to the mapping with a single robot: faster exploration, higherfault tolerance, richer data due to different sensors being used by different systems. However,the environment modeling with several robotic systems operating in the same area causes problemsof higher-order—acquired knowledge fusion and synchronization over time, revealing the sameenvironment properties using different sensors with different technical specifications. While theexisting robot map and environment model merging techniques allow merging certain homogeneousmaps, the possibility to use sensors of different physical nature and different mapping algorithms islimited. The resulting maps from robots with different specifications are heterogeneous, and eventhough some research on how to merge fundamentally different maps exists, it is limited to specificapplications. This research reviews the state of the art in homogeneous and heterogeneous mapmerging and illustrates the main research challenges in the area. Six factors are identified thatinfluence the outcome of map merging: (1) robotic platform hardware configurations, (2) maprepresentation types, (3) mapping algorithms, (4) shared information between robots, (5) relativepositioning information, (6) resulting global maps.

Merging grid maps of different resolutions by scaling registration

This paper considers the problem of merging grid maps that have different resolutions. Because the goal of map merging is to find the optimal transformation between two partially overlapping grid maps, it can be viewed as a special image registration issue. To address this special issue, the solution considers the non-common areas and designs an objective function based on the trimmed mean-square error (MSE). The trimmed and scaling iterative closest point (TsICP) algorithm is then proposed to solve this well-designed objective function. As the TsICP algorithm can be proven to be locally convergent in theory, a good initial transformation should be provided. Accordingly, scale-invariant feature transform (SIFT) features are extracted for the maps to be potentially merged, and the random sample consensus (RANSAC) algorithm is employed to find the geometrically consistent feature matches that are used to estimate the initial transformation for the TsICP algorithm. In addition, this paper presents the rules for the fusion of the grid maps based on the estimated transformation. Experimental results carried out with publicly available datasets illustrate the superior performance of this approach at merging grid maps with respect to robustness and accuracy.

A fast map merging algorithm in the field of multirobot SLAM

In recent years, the research on single-robot simultaneous localization and mapping (SLAM) has made a great success. However, multirobot SLAM faces many challenging problems, including unknown robot poses, unshared map, and unstable communication. In this paper, a map merging algorithm based on virtual robot motion is proposed for multi-robot SLAM. The thinning algorithm is used to construct the skeleton of the grid map's empty area, and a mobile robot is simulated in one map. The simulated data is used as information sources in the other map to do partial map Monte Carlo localization; if localization succeeds, the relative pose hypotheses between the two maps can be computed easily. We verify these hypotheses using the rendezvous technique and use them as initial values to optimize the estimation by a heuristic random search algorithm.