Talk Resource-Efficiently to Me: Optimal Communication Planning for Distributed Loop Closure Detection

TL;DR

This paper introduces a resource-efficient communication planning framework for distributed loop closure detection in CSLAM, significantly reducing data exchange while maintaining detection accuracy through optimal policy algorithms.

Contribution

It presents a novel framework and algorithms for optimal communication planning in CSLAM, balancing data exchange and workload distribution, with theoretical analysis and extensive empirical evaluation.

Findings

Reduces data exchange while verifying the same loop closures

Develops a fast algorithm for optimal communication policies

Theoretically characterizes conditions for simpler strategies

Abstract

Due to the distributed nature of cooperative simultaneous localization and mapping (CSLAM), detecting inter-robot loop closures necessitates sharing sensory data with other robots. A na\"{\i}ve approach to data sharing can easily lead to a waste of mission-critical resources. This paper investigates the logistical aspects of CSLAM. Particularly, we present a general resource-efficient communication planning framework that takes into account both the total amount of exchanged data and the induced division of labor between the participating robots. Compared to other state-of-the-art approaches, our framework is able to verify the same set of potential inter-robot loop closures while exchanging considerably less data and influencing the induced workloads. We develop a fast algorithm for finding globally optimal communication policies, and present theoretical analysis to characterize the necessary and sufficient conditions under which simpler strategies are optimal. The proposed framework is extensively evaluated with data from the KITTI odometry benchmark datasets.