A Novel RGB-D SLAM Algorithm Based on Cloud Robotics

In this paper, we present a novel red-green-blue-depth simultaneous localization and mapping (RGB-D SLAM) algorithm based on cloud robotics, which combines RGB-D SLAM with the cloud robot and offloads the back-end process of the RGB-D SLAM algorithm to the cloud. This paper analyzes the front and back parts of the original RGB-D SLAM algorithm and improves the algorithm from three aspects: feature extraction, point cloud registration, and pose optimization. Experiments show the superiority of the improved algorithm. In addition, taking advantage of the cloud robotics, the RGB-D SLAM algorithm is combined with the cloud robot and the back-end part of the computationally intensive algorithm is offloaded to the cloud. Experimental validation is provided, which compares the cloud robotic-based RGB-D SLAM algorithm with the local RGB-D SLAM algorithm. The results of the experiments demonstrate the superiority of our framework. The combination of cloud robotics and RGB-D SLAM can not only improve the efficiency of SLAM but also reduce the robot’s price and size.

Cooperative environment scans based on a multi-robot system

This paper proposes a cooperative environment scan system (CESS) using multiple robots, where each robot has low-cost range finders and low processing power. To organize and maintain the CESS, a base robot monitors the positions of the child robots, controls them, and builds a map of the unknown environment, while the child robots with low performance range finders provide obstacle information. Even though each child robot provides approximated and limited information of the obstacles, CESS replaces the single LRF, which has a high cost, because much of the information is acquired and accumulated by a number of the child robots. Moreover, the proposed CESS extends the measurement boundaries and detects obstacles hidden behind others. To show the performance of the proposed system and compare this with the numerical models of the commercialized 2D and 3D laser scanners, simulation results are included.

Probabilistic map merging for multi-robot RBPF-SLAM with unknown initial poses

This paper addresses the map merging problem, which is the most important issue in multi-robot simultaneous localization and mapping (SLAM) using the Rao–Blackwellized particle filter (RBPF-SLAM) with unknown initial poses. The map merging is performed using the map transformation matrix and the pair of map merging bases (MMBs) of the robots. However, it is difficult to find appropriate MMBs because each robot pose is estimated under multi-hypothesis in the RBPF-SLAM. In this paper, probabilistic map merging (PMM) using the Gaussian process is proposed to solve the problem. The performance of PMM was verified by reducing errors in the merged map with computer simulations and real experiments.