MSGD: Scalable back-end for indoor magnetic field-based GraphSLAM

摘要

Simultaneous Localisation and Mapping (SLAM) systems that recover the trajectory of a robot or mobile device are characterised by a front-end and back-end. The front-end uses sensor observations to identify loop closures; the back-end optimises the estimated trajectory to be consistent with these closures. The GraphSLAM framework formulates the back-end problem as a graph-based optimisation on a pose graph. This paper describes a back-end system optimised for very dense sequence-based loop closures. This arises when the frontend generates magnetic loop closures, among other things. Magnetic measurements are fast varying, which is good for localisation, but the requirement for high sampling rates (50 Hz+) produces many more loop closures than conventional systems. To date, however, there is no study optimising GraphSLAM back-end for sequence-based magnetic loop closures. Hence we introduce a novel variant of the Stochastic Gradient Descent-based SLAM algorithm called MSGD (Magnetic-SGD). We use high-accuracy groundtruth system and extensive real datasets to evaluate MSGD against state-of-the-art back-end algorithms. We demonstrate MSGD is at least as good as the best competitor algorithm in terms of quality, while being faster and more scalable.