Overlapping Domain Decomposition for Distributed Pose Graph Optimization

• URL: http://arxiv.org/abs/2603.03499v1
• Date: Tue, 03 Mar 2026 20:12:56 GMT
• Title: Overlapping Domain Decomposition for Distributed Pose Graph Optimization
• Abstract summary: ROBO is a distributed and parallel approach to pose graph optimization (PGO)<n>Sharing additional pose information between neighboring robots effectively creates overlapping optimization blocks in the underlying pose graph.<n>We show that overlaps with an average inter-robot data cost of only 36 Kb per iteration can converge 3.1$times$ faster in terms of iterations than state-of-the-art distributed PGO approaches.
• Score: 16.747729727115786
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We present ROBO (Riemannian Overlapping Block Optimization), a distributed and parallel approach to multi-robot pose graph optimization (PGO) based on the idea of overlapping domain decomposition. ROBO offers a middle ground between centralized and fully distributed solvers, where the amount of pose information shared between robots at each optimization iteration can be set according to the available communication resources. Sharing additional pose information between neighboring robots effectively creates overlapping optimization blocks in the underlying pose graph, which substantially reduces the number of iterations required to converge. Through extensive experiments on benchmark PGO datasets, we demonstrate the applicability and feasibility of ROBO in different initialization scenarios, using various cost functions, and under different communication regimes. We also analyze the tradeoff between the increased communication and local computation required by ROBO's overlapping blocks and the resulting faster convergence. We show that overlaps with an average inter-robot data cost of only 36 Kb per iteration can converge 3.1$\times$ faster in terms of iterations than state-of-the-art distributed PGO approaches. Furthermore, we develop an asynchronous variant of ROBO that is robust to network delays and suitable for real-world robotic applications.

Related papers

• Distributed Model-Based Diffusion For Scalable Multi-Robot Trajectory Optimization [14.429253416107167]
  We propose a distributed server-robot framework that decomposes the reverse diffusion process into local conditional reverse diffusion processes.<n>This decomposition enables each robot to iteratively perform denoising independently within its own control subspace conditioning on the current trajectory estimates the other robots that are aggregated by the goal.
  arXiv  Detail & Related papers  (2026-07-23T07:16:59Z)
• Decentralized Pose Graph Riemannian Optimization for Object-based Multi-Robot SLAM [14.190643126006819]
  In object-based multi-robot SLAM, the problem becomes more tightly coupled because robots must jointly estimate both their trajectories and the poses of persistent objects observed by multiple agents.<n>Existing decentralized solutions often assume that the communication graph closely matches the physical interaction topology, which is restrictive in realistic deployments where communication is sparse, intermittent, or time-varying.<n>This paper presents a fully decentralized Riemannian optimization framework for object-based multi-robot PGO that decouples the coupled estimation problem via a consensus mechanism, enabling flexible communication topologies.
  arXiv  Detail & Related papers  (2026-06-23T12:21:34Z)
• Policies over Poses: Reinforcement Learning based Distributed Pose-Graph Optimization for Multi-Robot SLAM [1.3750624267664158]
  We consider the sequential distributed pose-graph optimization (PGO) in multi-robot localization.<n>We cast PGO as a partially observable game defined on a Markov Neural Network (GNN), where each action refines a single edge's pose estimate.<n>We show that our learned actors reduce the global trajectory by an average of 37.5%, while enhancing efficiency by at least 6X.
  arXiv  Detail & Related papers  (2025-10-26T16:21:24Z)
• Accelerating Vehicle Routing via AI-Initialized Genetic Algorithms [53.75036695728983]
  Vehicle Routing Problems (VRP) are a fundamental NP-hard challenge in Evolutionary optimization.<n>We introduce an optimization framework where a reinforcement learning agent is trained on prior instances and quickly generates initial solutions.<n>This framework consistently outperforms current state-of-the-art solvers across various time budgets.
  arXiv  Detail & Related papers  (2025-04-08T15:21:01Z)
• Communication-Efficient Federated Group Distributionally Robust Optimization [49.14751984342068]
  Federated learning faces challenges due to the heterogeneity in data volumes and distributions at different clients. Existing approaches to address this issue based on group distributionally robust optimization (GDRO) often lead to high communication and sample complexity. This work introduces algorithms tailored for communication-efficient Federated Group Distributionally Robust Optimization.
  arXiv  Detail & Related papers  (2024-10-08T21:07:53Z)
• Communication- and Computation-Efficient Distributed Submodular Optimization in Robot Mesh Networks [2.8936428431504164]
  We provide a communication- and computation-efficient method for distributed submodular optimization in robot mesh networks.<n>Our method, Resource-Aware distributed Greedy (RAG), introduces a new distributed optimization paradigm.<n>RAG's decision-time scales linearly with the network size, while state-of-the-art near-optimal submodular optimization algorithms scale cubically.
  arXiv  Detail & Related papers  (2024-07-15T01:25:39Z)
• Factorization of Multi-Agent Sampling-Based Motion Planning [72.42734061131569]
  Modern robotics often involves multiple embodied agents operating within a shared environment. Standard sampling-based algorithms can be used to search for solutions in the robots' joint space. We integrate the concept of factorization into sampling-based algorithms, which requires only minimal modifications to existing methods. We present a general implementation of a factorized SBA, derive an analytical gain in terms of sample complexity for PRM*, and showcase empirical results for RRG.
  arXiv  Detail & Related papers  (2023-04-01T15:50:18Z)
• Intelligent Trajectory Design for RIS-NOMA aided Multi-robot Communications [59.34642007625687]
  The goal is to maximize the sum-rate of whole trajectories for multi-robot system by jointly optimizing trajectories and NOMA decoding orders of robots. An integrated machine learning (ML) scheme is proposed, which combines long short-term memory (LSTM)-autoregressive integrated moving average (ARIMA) model and dueling double deep Q-network (D$3$QN) algorithm.
  arXiv  Detail & Related papers  (2022-05-03T17:14:47Z)
• Relative Localization of Mobile Robots with Multiple Ultra-WideBand Ranging Measurements [15.209043435869189]
  We propose an approach to estimate the relative pose between a group of robots by equipping each robot with multiple UWB ranging nodes. To improve the localization accuracy, we propose to utilize the odometry constraints through a sliding window-based optimization.
  arXiv  Detail & Related papers  (2021-07-19T12:57:02Z)
• Graph Neural Networks for Decentralized Multi-Robot Submodular Action Selection [101.38634057635373]
  We focus on applications where robots are required to jointly select actions to maximize team submodular objectives. We propose a general-purpose learning architecture towards submodular at scale, with decentralized communications. We demonstrate the performance of our GNN-based learning approach in a scenario of active target coverage with large networks of robots.
  arXiv  Detail & Related papers  (2021-05-18T15:32:07Z)
• BayGo: Joint Bayesian Learning and Information-Aware Graph Optimization [48.30183416069897]
  BayGo is a novel fully decentralized joint Bayesian learning and graph optimization framework. We show that our framework achieves faster convergence and higher accuracy compared to fully-connected and star topology graphs.
  arXiv  Detail & Related papers  (2020-11-09T11:16:55Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.