Mutual visibility by luminous robots without collisions
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, without colliding, a configuration where no three of them are collinear. We study this problem in the luminous robots mo...
Saved in:
| Published in: | Information and computation Vol. 254; pp. 392 - 418 |
|---|---|
| Main Authors: | , , , , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Elsevier Inc
01.06.2017
|
| ISSN: | 0890-5401, 1090-2651 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | 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, without colliding, a configuration where no three of them are collinear. We study this problem in the luminous robots model, in which each robot has a visible light that can assume colors from a fixed set.
Among other results, we prove that Mutual Visibility can be solved in SSynch with 2 colors and in ASynch with 3 colors. If an adversary can interrupt and stop a robot moving to its computed destination, Mutual Visibility is still solvable in SSynch with 3 colors and, if the robots agree on the direction of one axis, also in ASynch.
As a byproduct, we provide the first obstructed-visibility solutions to two classical problems for oblivious robots: collision-less convergence to a point (also known as near-gathering) and circle formation. |
|---|---|
| ISSN: | 0890-5401 1090-2651 |
| DOI: | 10.1016/j.ic.2016.09.005 |