Ellipsoid SLAM: a novel set membership method for simultaneous localization and mapping

The extended Kalman filter (EKF) simultaneous localization and mapping (SLAM) requires the uncertainty to be Gaussian noise. This assumption can be relaxed to bounded noise by the set membership SLAM. However, the published set membership SLAMs are not suitable for large-scale and online problems. In this paper, we use ellipsoid algorithm for solving SLAM problem. The proposed ellipsoid SLAM has advantages over EKF SLAM and the other set membership SLAMs, in noise condition, online realization, and large-scale problem. By bounded ellipsoid technique, we analyze the convergence and stability of the ellipsoid SLAM. Simulation and experimental results show that the proposed ellipsoid SLAM is effective for online and large-scale problems such as Victoria Park dataset.