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.
Mutual visibility by luminous robots without collisions
01.01.2017
Aufsatz (Zeitschrift)
Elektronische Ressource
Englisch
DDC: | 629 |
Maximum visibility for motorists with luminous bridge railing
Engineering Index Backfile | 1963
|Engineering Index Backfile | 1930
Maintaining strong mutual visibility of an evader moving over the reduced visibility graph
British Library Online Contents | 2016
|Flight without exterior visibility
Engineering Index Backfile | 1928
|