论文标题
分布式的Riemannian优化和懒惰的通信进行协作几何估计
Distributed Riemannian Optimization with Lazy Communication for Collaborative Geometric Estimation
论文作者
论文摘要
我们介绍了第一个分布式优化算法,该算法具有懒惰的通信,以进行协作几何估计,这是现代协作同时本地化和映射(SLAM)的骨干(SLAM)和结构 - 触发器(SFM)应用程序。我们的方法允许代理通过融合单个观察结果在中央服务器上合作重建共享的几何模型,但无需传输有关代理本身(例如其位置)的潜在敏感信息。此外,为了减轻迭代优化期间的通信负担,我们设计了一组通信触发条件,使代理能够选择性地上传针对性的本地信息的目标子集,该信息可用于全球优化。因此,我们的方法可实现大量的沟通减少,对优化性能的影响最小。作为我们的主要理论贡献,我们证明我们的方法以全球sublinear收敛速率收敛到一阶关键点。关于协作SLAM和SFM数据集的捆绑调整问题的数值评估表明,我们的方法在现有的分布式技术方面有竞争力,同时达到了多达78%的总沟通减少。
We present the first distributed optimization algorithm with lazy communication for collaborative geometric estimation, the backbone of modern collaborative simultaneous localization and mapping (SLAM) and structure-from-motion (SfM) applications. Our method allows agents to cooperatively reconstruct a shared geometric model on a central server by fusing individual observations, but without the need to transmit potentially sensitive information about the agents themselves (such as their locations). Furthermore, to alleviate the burden of communication during iterative optimization, we design a set of communication triggering conditions that enable agents to selectively upload a targeted subset of local information that is useful to global optimization. Our approach thus achieves significant communication reduction with minimal impact on optimization performance. As our main theoretical contribution, we prove that our method converges to first-order critical points with a global sublinear convergence rate. Numerical evaluations on bundle adjustment problems from collaborative SLAM and SfM datasets show that our method performs competitively against existing distributed techniques, while achieving up to 78% total communication reduction.