Home /Research /Fully distributed scalable smoothing and mapping with robust multi-robot data association
SWARM

Fully distributed scalable smoothing and mapping with robust multi-robot data association

Alexander Cunningham, Kai M. Wurm, Wolfram Burgard, Frank Dellaert

Year
2012
Citations
94

Abstract

In this paper we focus on the multi-robot perception problem, and present an experimentally validated end-to-end multi-robot mapping framework, enabling individual robots in a team to see beyond their individual sensor horizons. The inference part of our system is the DDF-SAM algorithm [1], which provides a decentralized communication and inference scheme, but did not address the crucial issue of data association. One key contribution is a novel, RANSAC-based, approach for performing the between-robot data associations and initialization of relative frames of reference. We demonstrate this system with both data collected from real robot experiments, as well as in a large scale simulated experiment demonstrating the scalability of the proposed approach.

Keywords

Computer scienceRobotInitializationScalabilitySmoothingInferenceData associationArtificial intelligenceRANSACFocus (optics)

Related papers

Browse all SWARM papers