Distributed computing with mobile robots: an introductory survey

M Potop-Butucaru, M Raynal… - 2011 14th International …, 2011 - ieeexplore.ieee.org
Distributed Computing with Mobile Robots: An Introductory Survey Page 1 Distributed Computing
with Mobile Robots: an Introductory Survey Maria Potop-Butucaru* Michel Raynal†,‡ Sébastien …

Asynchronous mobile robot gathering from symmetric configurations without global multiplicity detection

S Kamei, A Lamani, F Ooshita, S Tixeuil - Structural Information and …, 2011 - Springer
We consider a set of k autonomous robots that are endowed with visibility sensors (but that
are otherwise unable to communicate) and motion actuators. Those robots must collaborate …

Uniform multi-agent deployment on a ring

Y Elor, AM Bruckstein - Theoretical Computer Science, 2011 - Elsevier
We consider two variants of the task of spreading a swarm of agents uniformly on a ring
graph. Ant-like oblivious agents having limited capabilities are considered. The agents are …

Rendezvous of mobile agents in unknown graphs with faulty links

J Chalopin, S Das, N Santoro - International Symposium on Distributed …, 2007 - Springer
A group of identical mobile agents moving asynchronously among the nodes of an
anonymous network have to gather together in a single node of the graph. This problem …

Computability of perpetual exploration in highly dynamic rings

M Bournat, S Dubois, F Petit - 2017 IEEE 37th International …, 2017 - ieeexplore.ieee.org
We consider systems made of autonomous mobile robots evolving in highly dynamic
discrete environment ie, graphs where edges may appear and disappear unpredictably …

Computing without communicating: Ring exploration by asynchronous oblivious robots

P Flocchini, D Ilcinkas, A Pelc, N Santoro - Principles of Distributed …, 2007 - Springer
We consider the problem of exploring an anonymous unoriented ring by a team of k
identical, oblivious, asynchronous mobile robots that can view the environment but cannot …

Self-stabilizing robots in highly dynamic environments

M Bournat, AK Datta, S Dubois - … , and Security of Distributed Systems: 18th …, 2016 - Springer
This paper deals with the classical problem of exploring a ring by a cohort of synchronous
robots. We focus on the perpetual version of this problem in which it is required that each …

Gracefully degrading gathering in dynamic rings

M Bournat, S Dubois, F Petit - … , Safety, and Security of Distributed Systems …, 2018 - Springer
Gracefully degrading algorithms [Biely et al., TCS 2018] are designed to circumvent
impossibility results in dynamic systems by adapting themselves to the dynamics. Indeed …

Energy-efficient strategies for building short chains of mobile robots locally

P Brandes, B Degener, B Kempkes… - Theoretical Computer …, 2013 - Elsevier
We are given a winding chain of n mobile robots between two stations in the plane, each of
them having a limited viewing range. It is only guaranteed that each robot can see its two …

Self-stabilizing robots in highly dynamic environments

M Bournat, AK Datta, S Dubois - Theoretical Computer Science, 2019 - Elsevier
This paper deals with the classical problem of exploring a ring by a cohort of synchronous
robots. We focus on the perpetual version of this problem in which it is required that each …