Talk Resource-Efficiently to Me: Optimal Communication Planning for Distributed Loop Closure Detection
This addresses resource waste in distributed robotics missions, offering an incremental improvement over existing communication strategies.
The paper tackles the problem of resource-efficient communication planning for distributed loop closure detection in cooperative SLAM, presenting a framework that verifies the same potential loop closures as state-of-the-art methods while exchanging considerably less data and influencing workloads.
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ï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.