The paper studies the gathering problem on grid and tree networks. A team of robots placed
at different nodes of the input graph, has to meet at some node and remain there. Robots …

Consider a set of mobile robots placed on distinct nodes of a discrete, anonymous, and
bidirectional ring. Asynchronously, each robot takes a snapshot of the ring, determining the …

We consider deterministic terminating exploration of a grid by a team of asynchronous
oblivious robots. We first consider the semi-synchronous atomic model ATOM. In this model …

We study the infinite grid exploration (IGE) problem by a swarm of autonomous mobile
robots. Those robots are opaque, have limited visibility capabilities, and run using …

We consider swarms of asynchronous oblivious robots evolving into an anonymous grid-
shaped network. In this context, we investigate optimal (wrt the number of robots) …

We investigate exploration algorithms for autonomous mobile robots evolving in uniform ring-
shaped networks. Unlike previous works, we consider myopia (each robot can only observe …

A set of autonomous robots have to collaborate in order to accomplish a common task in a
ring-topology where neither nodes nor edges are labeled (that is, the ring is anonymous) …

The model of autonomous oblivious and anonymous mobile robots recently emerged as an
attractive distributed computing abstraction that permits to assess the intrinsic difficulties of …

We deal with a team of autonomous robots that are endowed with motion actuators and
visibility sensors. Those robots are weak and evolve in a discrete environment. By weak, we …

We consider the problem of constructing a maximum independent set with mobile myopic
luminous robots on a grid network whose size is finite but unknown to the robots. In this …