Spectral Sparsification for Communication-Efficient Collaborative Rotation and Translation Estimation

10/10/2022
by   Yulun Tian, et al.
0

We propose fast and communication-efficient distributed algorithms for rotation averaging and translation recovery problems that arise from multi-robot simultaneous localization and mapping (SLAM) and distributed camera network localization applications. Our methods are based on theoretical relations between the Hessians of the underlying Riemannian optimization problems and the Laplacians of suitably weighted graphs. We leverage these results to design a distributed solver that performs approximate second-order optimization by solving a Laplacian system at each iteration. Crucially, our algorithms permit robots to employ spectral sparsification to sparsify intermediate dense matrices before communication, and hence provide a mechanism to trade off accuracy with communication efficiency with provable guarantees. We perform rigorous theoretical analysis of our methods and prove that they enjoy (local) linear rate of convergence on the problems of interest. Numerical experiments show that the proposed methods converge to high-precision solutions in a few iterations and that they are significantly more communication-efficient compared to baseline second-order solvers.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/02/2022

Distributed Riemannian Optimization with Lazy Communication for Collaborative Geometric Estimation

We present the first distributed optimization algorithm with lazy commun...
research
11/09/2019

Block-Coordinate Descent on the Riemannian Staircase for Certifiably Correct Distributed Rotation and Pose Synchronization

This paper presents the first certifiably correct solver for distributed...
research
03/11/2020

Majorization Minimization Methods to Distributed Pose Graph Optimization with Convergence Guarantees

In this paper, we consider the problem of distributed pose graph optimiz...
research
07/29/2021

DCG: Distributed Conjugate Gradient for Efficient Linear Equations Solving

Distributed algorithms to solve linear equations in multi-agent networks...
research
12/04/2020

Generalized Proximal Methods for Pose Graph Optimization

In this paper, we generalize proximal methods that were originally desig...
research
09/05/2020

Communication-efficient distributed eigenspace estimation

Distributed computing is a standard way to scale up machine learning and...
research
07/30/2021

Majorization Minimization Methods for Distributed Pose Graph Optimization

We consider the problem of distributed pose graph optimization (PGO) tha...

Please sign up or login with your details

Forgot password? Click here to reset