English
Related papers

Related papers: Fault and Byzantine Tolerant Self-stabilizing Mobi…

200 papers

In the general pattern formation (GPF) problem, a swarm of simple autonomous, disoriented robots must form a given pattern. The robots' simplicity imply a strong limitation: When the initial configuration is rotationally symmetric, only…

Robotics · Computer Science 2024-10-01 Raphael Gerlach , Sören von der Gracht , Christopher Hahn , Jonas Harbig , Peter Kling

This work focuses on the following question related to the Gathering problem of $n$ autonomous, mobile robots in the Euclidean plane: Is it possible to solve Gathering of robots that do not agree on any axis of their coordinate systems…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-08-24 Jannik Castenow , Jonas Harbig , Daniel Jung , Till Knollmann , Friedhelm Meyer auf der Heide

In this paper, we consider the problem of scattering a swarm of mobile oblivious robots in a continuous space. We consider the fully asynchronous setting where robots may base their computation on past observations, or may be observed by…

Multiagent Systems · Computer Science 2019-05-23 Ulysse Léchine , Sébastien Tixeuil

We study the problem \emph{Gathering} for $n$ autonomous mobile robots in synchronous settings with a persistent memory called \emph{light}. It is well known that Gathering is impossible in the basic model ($OBLOT$) where robots have no…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-08-20 Kohei Otaka , Fabian Frei , Koichi Wada

An active approach to fault tolerance is essential for robot swarms to achieve long-term autonomy. Previous efforts have focused on responding to spontaneous electro-mechanical faults and failures. However, many faults occur gradually over…

Robotics · Computer Science 2025-10-10 James O'Keeffe

This work deals with the problem of gathering $n$ oblivious mobile entities, called robots, at a point (not known beforehand) placed on an infinite triangular grid. The robots are considered to be myopic, i.e., robots have limited…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-09-29 Pritam Goswami , Avisek Sharma , Satakshi Ghosh , Buddhadeb Sau

In comparison with existing approaches, which struggle with scalability, communication dependency, and robustness against dynamic failures, cooperative aerial transportation via robot swarms holds transformative potential for logistics and…

Robotics · Computer Science 2025-09-05 Quan Quan , Jiwen Xu , Runxiao Liu , Yi Ding , Jiaxing Che , Kai-Yuan Cai

In this work, we investigate swarm self-clustering, where robots autonomously organize into spatially coherent groups using only local sensing and decision-making, without external commands, global positioning, or inter-robot communication.…

Robotics · Computer Science 2026-03-19 Sweksha Jain , Rugved Katole , Leena Vachhani

The cooperative bandit problem is a multi-agent decision problem involving a group of agents that interact simultaneously with a multi-armed bandit, while communicating over a network with delays. The central idea in this problem is to…

Machine Learning · Statistics 2022-05-31 Abhimanyu Dubey , Alex Pentland

Robotic grasping is facing a variety of real-world uncertainties caused by non-static object states, unknown object properties, and cluttered object arrangements. The difficulty of grasping increases with the presence of more uncertainties,…

Robotics · Computer Science 2025-09-10 Hao Chen , Takuya Kiyokawa , Weiwei Wan , Kensuke Harada

This paper considers the problem of Byzantine dispersion and extends previous work along several parameters. The problem of Byzantine dispersion asks: given $n$ robots, up to $f$ of which are Byzantine, initially placed arbitrarily on an…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-09-28 Anisur Rahaman Molla , Kaushik Mondal , William K. Moses

This report surveys results on distributed systems comprising mobile agents that are identical and anonymous, oblivious and interact solely by adjusting their motion according to the relative location of their neighbours. The agents are…

Multiagent Systems · Computer Science 2019-02-06 Ariel Barel , Rotem Manor , Alfred M. Bruckstein

Mutual localization provides a consensus of reference frame as an essential basis for cooperation in multirobot systems. Previous works have developed certifiable and robust solvers for relative transformation estimation between each pair…

Robotics · Computer Science 2022-10-18 Yingjian Wang , Xiangyong Wen , Yanjun Cao , Chao Xu , Fei Gao

We consider a team of heterogeneous robots which are deployed within a common workspace to gather different types of data. The robots have different roles due to different capabilities: some gather data from the workspace (source robots)…

Multiagent Systems · Computer Science 2017-10-31 Meng Guo , Michael M. Zavlanos

In collective robotic systems, the automatic generation of controllers for complex tasks is still a challenging problem. Open-ended evolution of complex robot behaviors can be a possible solution whereby an intrinsic driver for pattern…

Neural and Evolutionary Computing · Computer Science 2019-10-14 Tanja Katharina Kaiser , Heiko Hamann

The deployment of simple emergent behaviors in swarm robotics has been well-rehearsed in the literature. A recent study has shown how self-aggregation is possible in a multitask approach -- where multiple self-aggregation task instances…

In extending fast digital clock synchronization to the bounded-delay model, the expected constant time Byzantine pulse resynchronization problem is investigated. In this problem, the synchronized state of the system should not only be…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-03-29 Shaolin Yu , Jihong Zhu , Jiali Yang , Wei Lu

Fault tolerance is increasingly important for unmanned autonomous vehicles. For example, in a multi robot system the agents need the ability to effectively detect and tolerate internal failures in order to continue performing their tasks…

Combinatorics · Mathematics 2016-05-02 S. Bereg , L. E. Caraballo , J. M. Díaz-Báñez , M. A. Lopez

We study a well-known communication abstraction called Byzantine Reliable Broadcast (BRB). This abstraction is central in the design and implementation of fault-tolerant distributed systems, as many fault-tolerant distributed applications…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-10-04 Romaric Duvignau , Michel Raynal , Elad Michael Schiller

This report contains two related sets of results with different assumptions on synchrony. The first part is about iterative algorithms in synchronous systems. Following our previous work on synchronous iterative approximate Byzantine…

Distributed, Parallel, and Cluster Computing · Computer Science 2012-03-19 Nitin Vaidya , Lewis Tseng , Guanfeng Liang