ClusterSLAM: A SLAM Backend for Simultaneous Rigid Body Clustering and Motion Estimation
Authors:
- 1 October 2019
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 5874-5883
Abstract
We present a practical backend for stereo visual SLAM which can simultaneously discover individual rigid bodies and compute their motions in dynamic environments. While recent factor graph based state optimization algorithms have shown their ability to robustly solve SLAM problems by treating dynamic objects as outliers, the dynamic motions are rarely considered. In this paper, we exploit the consensus of 3D motions among the landmarks extracted from the same rigid body for clustering and estimating static and dynamic objects in a unified manner. Specifically, our algorithm builds a noise-aware motion affinity matrix upon landmarks, and uses agglomerative clustering for distinguishing those rigid bodies. Accompanied by a decoupled factor graph optimization for revising their shape and trajectory, we obtain an iterative scheme to update both cluster assignments and motion estimation reciprocally. Evaluations on both synthetic scenes and KITTI demonstrate the capability of our approach, and further experiments considering online efficiency also show the effectiveness of our method for simultaneous tracking of ego-motion and multiple objects.Keywords
This publication has 38 references indexed in Scilit:
- Communication-constrained multi-AUV cooperative SLAM2015
- Vision meets robotics: The KITTI datasetThe International Journal of Robotics Research, 2013
- Energy-Based Geometric Multi-model FittingInternational Journal of Computer Vision, 2011
- G2o: A general framework for graph optimization2011
- Projective Factorization of Multiple Rigid-Body Motions2007
- Two-View Multibody Structure from MotionInternational Journal of Computer Vision, 2006
- Comparing Clusterings by the Variation of Information2003
- CUREACM SIGMOD Record, 1998
- Random sample consensusCommunications of the ACM, 1981
- An efficient algorithm for a complete link methodThe Computer Journal, 1977