Abstract—In this paper we study the power of us-ing lights, i.e. visible external memory, for distributed computation by autonomous robots moving in Look-Compute-Move (LCM) cycles. With respect to the LCM cycles, the most common models studied in the lit-erature are the fully-synchronous (FSYNC), the semi-synchronous (SSYNC), and the asynchronous (ASYNC). In this paper we introduce in the ASYNC model, the weakest of the three, the availability of visible external memory: each robot is equipped with a light bulb that is visible to all other robots, and that can display a constant numbers of different colors; the colors are persistent, that is they are not automatically reset at the end of each cycle. We first study the relationship between A...
International audienceThe paper details the first successful attempt at using model checking techniq...
Abstract We study the impact that persistent memory has on the classical rendezvous problem of two m...
The Uniform Circle Formation problem requires a swarm of mobile agents, arbitrarily positioned onto ...
We consider the well known distributed setting of computational mobile entities, called robots, oper...
The classic Look-Compute-Move model of oblivious Robots has many strengths: algorithms designed for ...
AbstractIn this paper, we consider the distributed setting of computational mobile entities, called ...
Robots with lights is a model of autonomous mobile computational entties operating in the plane in L...
Abstract. Robots with lights is a model of autonomous mobile computational entties operating in the ...
We investigate the computational power of distributed systems whose autonomous computational entitie...
We investigate gathering algorithms for asynchronous autonomous mobile robots moving in uniform ring...
International audienceWe investigate exploration algorithms for autonomous mobile robots evolving in...
International audienceWe investigate gathering algorithms for asynchronous autonomous mobile robots ...
The extensive studies on computing by a team of identical mobile robots operating in the plane in Lo...
We consider the Mutual Visibility problem for anonymous dimensionless robots with obstructed visibil...
We study the rendezvous problem for two robots moving in the plane (or on a line). Robots are autono...
International audienceThe paper details the first successful attempt at using model checking techniq...
Abstract We study the impact that persistent memory has on the classical rendezvous problem of two m...
The Uniform Circle Formation problem requires a swarm of mobile agents, arbitrarily positioned onto ...
We consider the well known distributed setting of computational mobile entities, called robots, oper...
The classic Look-Compute-Move model of oblivious Robots has many strengths: algorithms designed for ...
AbstractIn this paper, we consider the distributed setting of computational mobile entities, called ...
Robots with lights is a model of autonomous mobile computational entties operating in the plane in L...
Abstract. Robots with lights is a model of autonomous mobile computational entties operating in the ...
We investigate the computational power of distributed systems whose autonomous computational entitie...
We investigate gathering algorithms for asynchronous autonomous mobile robots moving in uniform ring...
International audienceWe investigate exploration algorithms for autonomous mobile robots evolving in...
International audienceWe investigate gathering algorithms for asynchronous autonomous mobile robots ...
The extensive studies on computing by a team of identical mobile robots operating in the plane in Lo...
We consider the Mutual Visibility problem for anonymous dimensionless robots with obstructed visibil...
We study the rendezvous problem for two robots moving in the plane (or on a line). Robots are autono...
International audienceThe paper details the first successful attempt at using model checking techniq...
Abstract We study the impact that persistent memory has on the classical rendezvous problem of two m...
The Uniform Circle Formation problem requires a swarm of mobile agents, arbitrarily positioned onto ...