An Infrastructure-less, Control-Independent Solution to Relative Localisation of a Team of Mobile Robots using Ranging Measurements
- URL: http://arxiv.org/abs/2606.20365v1
- Date: Thu, 18 Jun 2026 15:27:43 GMT
- Title: An Infrastructure-less, Control-Independent Solution to Relative Localisation of a Team of Mobile Robots using Ranging Measurements
- Abstract summary: Decentralised cooperative localisation algorithm is based on odometry, sparse inter-agent ranging measurements, and short-range communication.<n>The method is anchor-less, fully decentralised, and does not require controlling the robots motion to ensure team observability.
- Score: 1.6549673766945538
- License: http://creativecommons.org/licenses/by-nc-nd/4.0/
- Abstract: The ability to localise teams of robots is essential for applications ranging from robotic fleets in unstructured environments to cooperative control and navigation tasks. In such contexts, fixed infrastructure is often unavailable, deployments must be fast and flexible, and system requirements must be minimal. We present a decentralised cooperative localisation algorithm that addresses all these challenges at once. The method is anchor-less, fully decentralised, and, unlike most existing approaches, does not require controlling the robots motion to ensure team observability. It relies only on local odometry, sparse inter-agent ranging measurements, and short-range communication, all of which are widely available in practice. The algorithm adopts a multi-hypothesis Bayesian framework that maintains the entire set of feasible solutions, ensuring robustness under transient unobservable conditions. Moreover, through information sharing, each agent benefits from the estimates of the entire group, even in partially connected conditions.
Related papers
- Anytime Plug-and-Play Control with Contract-Based Distributed MPC [3.477704547618128]
This work introduces a distributed multi-agent control algorithm based on local communication that supports anytime agent joining and leaving the communication network without centralized coordination.<n>We validate the proposed method in an autonomous multi-agent driving scenario, demonstrating effective collision avoidance in high-speed, dynamic environments with agents moving in opposite directions.
arXiv Detail & Related papers (2026-07-05T10:06:49Z) - Advancing Omnimodal Embodied Agents from Isolated Skills to Everyday Physical Autonomy [79.09714980186278]
Building persistent embodied agents in unstructured environments requires unified orchestration of heterogeneous tools.<n>We present OmniAct, a framework integrating a multimodal semantic planner for skill routing across unified action spaces.<n>It achieves consistent improvements in end-to-end success across all complexity levels.
arXiv Detail & Related papers (2026-06-25T16:36:35Z) - CHORUS: Decentralized Multi-Embodiment Collaboration with One VLA Policy [67.76658561040625]
CHORUS is a framework that adapts a single vision-language-action (VLA) backbone to control diverse, multi-robot teams.<n>In experiments, CHORUS achieves a 64% point improvement over decentralized, from-scratch models.<n>Results show that a shared VLA backbone is capable of achieving decentralized multi-robot collaboration.
arXiv Detail & Related papers (2026-06-10T17:26:08Z) - Distributed Multi-Coverage for Robot Swarms [6.759291241573661]
Autonomous drone swarms deployed for surveillance, environmental monitoring, and infrastructure inspection must maintain reliable coverage despite robot failures.<n>This requires multicoverage: each asset must be observed by multiple robots for redundancy, with coverage requirements varying by asset importance.<n>We present a distributed multicoverage algorithm for robot swarms operating with local sensing, local communication, and no global coordination.
arXiv Detail & Related papers (2026-05-20T19:43:41Z) - Decentralized and Fully Onboard: Range-Aided Cooperative Localization and Navigation on Micro Aerial Vehicles [7.827829335706731]
In this work, we consider the problem of range-aided decentralized localization and formation control.<n>Each robot estimates its relative pose by combining data only from onboard odometry sensors and distance measurements to other robots in the team.<n>We present a block coordinate descent approach to localization that does not require strict coordination between the robots.
arXiv Detail & Related papers (2026-02-18T16:46:15Z) - Generalizability of Graph Neural Networks for Decentralized Unlabeled Motion Planning [72.86540018081531]
Unlabeled motion planning involves assigning a set of robots to target locations while ensuring collision avoidance.
This problem forms an essential building block for multi-robot systems in applications such as exploration, surveillance, and transportation.
We address this problem in a decentralized setting where each robot knows only the positions of its $k$-nearest robots and $k$-nearest targets.
arXiv Detail & Related papers (2024-09-29T23:57:25Z) - A Scalable Multi-Robot Framework for Decentralized and Asynchronous Perception-Action-Communication Loops [72.1902268440158]
Collaboration in large robot swarms to achieve a common global objective is a challenging problem in large environments.<n>The robots must execute a Perception-Action-Communication loop -- they perceive their local environment, communicate with other robots, and take actions in real time.<n>Recently, this has been addressed using Graph Neural Networks (GNNs) for applications such as flocking and coverage control.<n>This paper proposes a framework for asynchronous PAC in robot swarms, where decentralized GNNs are used to compute navigation actions and generate messages for communication.
arXiv Detail & Related papers (2023-09-18T21:20:50Z) - Distributed Online Rollout for Multivehicle Routing in Unmapped
Environments [0.8437187555622164]
We present a fully distributed, online, and scalable reinforcement learning algorithm for the well-known multivehicle routing problem.
Agents self-organize into local clusters and independently apply a multiagent rollout scheme locally to each cluster.
Our algorithm achieves approximately a factor of two cost improvement over the base policy for a range of radii bounded from below and above by two and three times the critical sensing radius, respectively.
arXiv Detail & Related papers (2023-05-24T22:06:44Z) - AdverSAR: Adversarial Search and Rescue via Multi-Agent Reinforcement
Learning [4.843554492319537]
We propose an algorithm that allows robots to efficiently coordinate their strategies in the presence of adversarial inter-agent communications.
It is assumed that the robots have no prior knowledge of the target locations, and they can interact with only a subset of neighboring robots at any time.
The effectiveness of our approach is demonstrated on a collection of prototype grid-world environments.
arXiv Detail & Related papers (2022-12-20T08:13:29Z) - Learning Connectivity for Data Distribution in Robot Teams [96.39864514115136]
We propose a task-agnostic, decentralized, low-latency method for data distribution in ad-hoc networks using Graph Neural Networks (GNN)
Our approach enables multi-agent algorithms based on global state information to function by ensuring it is available at each robot.
We train the distributed GNN communication policies via reinforcement learning using the average Age of Information as the reward function and show that it improves training stability compared to task-specific reward functions.
arXiv Detail & Related papers (2021-03-08T21:48:55Z) - F2A2: Flexible Fully-decentralized Approximate Actor-critic for
Cooperative Multi-agent Reinforcement Learning [110.35516334788687]
Decentralized multi-agent reinforcement learning algorithms are sometimes unpractical in complicated applications.
We propose a flexible fully decentralized actor-critic MARL framework, which can handle large-scale general cooperative multi-agent setting.
Our framework can achieve scalability and stability for large-scale environment and reduce information transmission.
arXiv Detail & Related papers (2020-04-17T14:56:29Z)
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.