riMESA: Consensus ADMM for Real-World Collaborative SLAM

summary

The gist

Collaborative Simultaneous Localization and Mapping (C-SLAM) is a fundamental capability for multi-robot teams as it enables downstream tasks like planning and navigation However…

In short

riMESA is a robust, incremental, and distributed C-SLAM back-end designed for multi-robot teams operating under real-world constraints like limited communication and outliers. It solves complex state estimation problems by incrementally applying an edge-based consensus ADMM process, ensuring accurate results in real time across various scales.

Key concepts

Robust Incremental C-SLAM
This is a method for estimating the positions of multiple robots simultaneously while continuously adding new data and handling errors. It solves the problem step-by-step using previous solutions to be faster and more reliable, specifically designed to cope with noisy measurements and outliers.
M-Estimation
M-Estimation is a technique used to make optimization problems resistant to outliers. Instead of treating all data equally, it assigns different weights based on how likely a measurement is. This helps the system ignore or downweight measurements that are clearly incorrect, improving overall accuracy.
Consensus Alternating Direction Method of Multipliers (CADMM)
CADMM is a mathematical framework used for distributed optimization where multiple robots work together to agree on a shared state. Robots locally constrain their estimates using 'biased priors' and then iteratively refine these constraints until the entire team converges on a consistent solution.
Communication Handler
This component manages the asynchronous and unreliable communication between robots. It allows robots to continue performing local calculations even when communication is delayed or fails, caching necessary information to ensure updates happen correctly once communication is restored.

Terminology used across episodes

This episode discusses

The paper

riMESA: Consensus ADMM for Real-World Collaborative SLAM · Read on arXiv

Carnegie Mellon University

DOI: 10.1109/TRO.2026.3706569

Transcript

Introduction to the show: ident: Robotics Radio. Generated commentary on the latest robotics and control papers.

Rosa: I'm Rosa.

Dev: And I'm Dev, here with Taro.

Rosa: We're looking at the paper: "riMESA: Consensus ADMM for Real-World Collaborative SLAM".

Dev: Here's the gist of the paper. Collaborative Simultaneous Localization and Mapping (C-SLAM) is a fundamental capability for multi-robot teams as it enables downstream tasks like planning and navigation However, existing C-SLAM back-end algorithms struggle to address the practical realities of real-world deployments (i.e.

Rosa: communication limitations, outlier measurements, and online operation) In this paper we propose Robust Incremental Manifold Edge-based Separable ADMM (riMESA) – a robust, incremental, and distributed CSLAM back-end that is resilient to outliers, reliable in the face of limited communication, and can compute accurate state estimates for a multi-robot team in real-time Through the development of riMESA, we make an argument for the use of Consensus Alternating Direction Method of Multipliers as a theoretical foundation for distributed optimization tasks in robotics like C-SLAM due to its flexibility, accuracy, and fast convergence.

Dev: Problem Formulation and Challenges The generic C-SLAM problem involves a team of robots estimating state variables using noisy measurements A key challenge is the need to solve the robust incremental C-SLAM problem which requires solving the optimization problem at every timestep with access to the previous solution.

Rosa: This formulation is defined as: 1.

Title and authors: Rosa: So we’re looking at this paper today titled riMESA: Consensus ADMM for Real-World Collaborative SLAM, and the authors are Daniel McGann and Michael Kaess. It sounds a bit technical, but basically, they’re tackling the challenge of making collaborative mapping work when things get messy in the real world.

Dev: Yeah, it's about C-SLAM back-ends that struggle with real deployment stuff like bad communication or bad measurements. So they propose this new approach using Consensus Alternating Direction Method of Multipliers as a theoretical base for distributed optimization tasks in robotics, which is pretty flexible and fast to converge.

Taro: What I find interesting right away is the focus on making it robust and incremental, meaning it can handle things step-by-step without needing the whole picture solved all at once.

Rosa: Exactly. They’re proposing a system that can give you accurate state estimates for a multi-robot team in real time, even when communication is limited or measurements are potentially incorrect. It's designed to be resilient under those kinds of conditions.

Dev: The big implication here is moving away from batch solutions where you solve the whole optimization problem once, toward something that updates incrementally and consistently as new information comes in.

The paper's summary: Rosa: So, what exactly is riMESA? It’s described as a robust incremental and distributed CSLAM back-end that handles outliers well by reformulating the problem through M-Estimation. They use an incremental edge-based CADMM process to let robots work incrementally and asynchronously.

Dev: That means when new measurements come in, they run this robust local solver called riSAM to compute updates in real time, which helps manage those outlier measurements effectively. And they also have a communication handler that manages the asynchronous pairwise communications between robots, dealing with latency and failures.

Taro: I see how that handles the communication issue—by having a way to manage what happens when connections drop out or if there's a delay between robots talking to each other. That’s crucial for any field deployment scenario we deal with.

Rosa: Right, so it’s not just solving the problem once; it’s designed to solve the robust incremental C-SLAM problem which requires solving the optimization problem at every time step with access to the previous solution.

Dev: The math they use involves a SIG Kernel update sequence of zero point zero five nine point nine point five one, and they introduce dual variable decay with a decay rate of zero point nine to make sure recent information dominates the dual estimates.

Taro: That sounds like a solid way to manage the trade-off between old and new data influencing the solution. What I wonder about that communication handler—how does it actually manage those failures you mentioned earlier?

Rosa: It involves two stages of communication, first updating each other on shared variables, and then sharing local estimates for the jointly known set of shared variables. They’ve shown that on COSMO-Bench datasets, riMESA is most frequently the best performing method.

The paper's improvements: Dev: The authors put a lot of effort into making it robust by using M-Estimation to downweight the effects of outliers in the state variable update within riSAM. They also introduce an incremental version of Graduated Non-Convexity which efficiently updates only the relevant subproblem at each time step.

Taro: So, when things go wrong with a measurement, it doesn't just blow up the whole calculation; it’s downweighted by this M-Estimation approach. That’s a practical improvement for real-world noise.

Rosa: And they also introduce dual variable decay to downweight old dual estimates so that recent information has more influence on the solution, which is another key piece of their incrementalization strategy.

Dev: The communication handling is also designed to be flexible, allowing asynchronous pairwise communications and managing latency and failures through a Communication Handler that maintains a cached copy of the algorithm’s state, letting robots continue local updates while waiting for inter-robot information.

Taro: That sounds like it builds in some graceful recovery mechanisms rather than just failing when the network hiccups. How does this compare to what we see in other distributed optimization literature?

Rosa: The paper makes a strong argument for using the Consensus Alternating Direction Method of Multipliers as a theoretical foundation because it offers flexibility, accuracy, and fast convergence for these kinds of distributed optimization tasks.

Conclusion: Dev: So to wrap up on riMESA: it’s a robust, incremental, and distributed CSLAM back-end that can compute accurate state estimates in real time under limited communication conditions. It seems they've managed to bridge the gap between theoretical distributed optimization and practical multi-robot deployment needs.

Taro: I think what stands out is how it scales; they show it can handle both large teams and long term operation, which is important because prior works often saw performance degrade at larger scales, so consistency across different sizes is a big deal.

Rosa: Ultimately, riMESA seems to be the only method that performs consistently across all the datasets they tested. It gives you high-quality results whether you’re dealing with a small team or a big one operating over a long time.

Dev: It’s moving us toward solutions for C-SLAM that are not just mathematically sound in isolation, but ones that actually work reliably when deployed on ad hoc, sparse, and unreliable communication networks. That’s the main contribution of riMESA.

Taro: Yeah, it gives us a concrete framework to think about how to make these systems more resilient when the world misbehaves unexpectedly during deployment.

Rosa: We’ve talked about riMESA: Consensus ADMM for Real-World Collaborative SLAM today and that’s all we have for this paper.

More episodes

← Home