The amoebot model abstracts active programmable matter as a collection of simple
computational elements called amoebots that interact locally to collectively achieve tasks of …

Creating a swarm of mobile computing entities, frequently called robots, agents, or sensor
nodes, with self-organization ability is a contemporary challenge in distributed computing …

Given a set R of robots, each one located at a different vertex of an infinite regular
tessellation graph, we aim to explore the Arbitrary Pattern Formation (APF) problem. Given a …

The dispersion problem on graphs asks k≤ n robots placed initially arbitrarily on the nodes
of an n-node anonymous graph to reposition autonomously to reach a configuration in which …

Fault-Tolerant Mobile Robots | SpringerLink Skip to main content Advertisement SpringerLink
Account Menu Find a journal Publish with us Track your research Search Cart Book cover …

The dispersion problem on graphs asks k ≤ n robots placed initially arbitrarily on the nodes
of an n-node anonymous graph to reposition autonomously to reach a configuration in which …

We consider the problem of repositioning N autonomous robots on a plane so that each
robot is visible to all others (the Complete Visibility problem); a robot cannot see another …

We study the impact that persistent memory has on the classical rendezvous problem of two
mobile computational entities, called robots, in the plane. It is well known that, without …

We consider the distributed setting of N autonomous mobile robots that operate in Look-
Compute-Move (LCM) cycles and communicate with other robots using colored lights …

We present a self-stabilizing algorithm that ensures in finite time the gathering of two robots
in the non-rigid ASYNC model. To circumvent established impossibility results, we assume …