[HTML][HTML] Autonomous mobile robots with lights
We consider the well known distributed setting of computational mobile entities, called
robots, operating in the Euclidean plane in Look-Compute-Move (LCM) cycles. We …
robots, operating in the Euclidean plane in Look-Compute-Move (LCM) cycles. We …
Pattern formation by oblivious asynchronous mobile robots
We investigate pattern formation, ie, self-organization, by a swarm of mobile robots, which is
closely related with the agreement problem in distributed computing. Consider a system of …
closely related with the agreement problem in distributed computing. Consider a system of …
[HTML][HTML] Mutual visibility by luminous robots without collisions
Abstract We consider the Mutual Visibility problem for anonymous dimensionless robots with
obstructed visibility moving in a plane: starting from distinct locations, the robots must reach …
obstructed visibility moving in a plane: starting from distinct locations, the robots must reach …
The canonical amoebot model: Algorithms and concurrency control
The amoebot model abstracts active programmable matter as a collection of simple
computational elements called amoebots that interact locally to collectively achieve tasks of …
computational elements called amoebots that interact locally to collectively achieve tasks of …
Twenty dirty tricks to train software engineers
R Dawson - Proceedings of the 22nd international conference on …, 2000 - dl.acm.org
Many employers find that graduates and sandwich students come to them poorly prepared
for the every day problems encountered at the workplace. Although many university students …
for the every day problems encountered at the workplace. Although many university students …
[HTML][HTML] Rendezvous with constant memory
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 …
mobile computational entities, called robots, in the plane. It is well known that, without …
Mutual visibility with an optimal number of colors
We consider the following fundamental Mutual Visibility problem: Given a set of n identical
autonomous point robots in arbitrary distinct positions in the Euclidean plane, find a …
autonomous point robots in arbitrary distinct positions in the Euclidean plane, find a …
Rendezvous of two robots with visible bits
G Viglietta - Algorithms for Sensor Systems: 9th International …, 2014 - Springer
We study the rendezvous problem for two robots moving in the plane (or on a line). Robots
are autonomous, anonymous, oblivious, and carry colored lights that are visible to both. We …
are autonomous, anonymous, oblivious, and carry colored lights that are visible to both. We …
Moving and computing models: Robots
P Flocchini, G Prencipe, N Santoro - Distributed Computing by Mobile …, 2019 - Springer
Moving and Computing Models: Robots | SpringerLink Skip to main content Advertisement
SpringerLink Account Menu Find a journal Publish with us Track your research Search Cart …
SpringerLink Account Menu Find a journal Publish with us Track your research Search Cart …
Robots with lights: Overcoming obstructed visibility without colliding
Robots with lights is a model of autonomous mobile computational entties operating in the
plane in Look-Compute-Move cycles: each agent has an externally visible light which can …
plane in Look-Compute-Move cycles: each agent has an externally visible light which can …