Riemannian Optimization for Active Mapping with Robot Teams
Arash Asgharivaskasi, Fritz Girke, Nikolay Atanasov

TL;DR
This paper introduces ROAM, a distributed Riemannian optimization method enabling multi-robot active mapping and planning with guarantees, demonstrated through simulations and real-world experiments.
Contribution
It presents a novel distributed Riemannian optimization framework for multi-robot active mapping and planning, addressing limitations of prior Euclidean models and centralized solutions.
Findings
ROAM achieves effective multi-robot mapping and planning.
The method guarantees consensus and optimality in distributed settings.
Experimental results validate ROAM's performance in real-world scenarios.
Abstract
Autonomous exploration of unknown environments using a team of mobile robots demands distributed perception and planning strategies to enable efficient and scalable performance. Ideally, each robot should update its map and plan its motion not only relying on its own observations, but also considering the observations of its peers. Centralized solutions to multi-robot coordination are susceptible to central node failure and require a sophisticated communication infrastructure for reliable operation. Current decentralized active mapping methods consider simplistic robot models with linear-Gaussian observations and Euclidean robot states. In this work, we present a distributed multi-robot mapping and planning method, called Riemannian Optimization for Active Mapping (ROAM). We formulate an optimization problem over a graph with node variables belonging to a Riemannian manifold and a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDistributed Control Multi-Agent Systems · Mathematical Biology Tumor Growth
