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.


    Zugriff

    Download


    Exportieren, teilen und zitieren



    Titel :

    Mutual visibility by luminous robots without collisions



    Erscheinungsdatum :

    01.01.2017



    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch



    Klassifikation :

    DDC:    629



    Maximum visibility for motorists with luminous bridge railing

    McPartland, J.F. | Engineering Index Backfile | 1963


    Flights without visibility

    Engineering Index Backfile | 1930




    Flight without exterior visibility

    de Marolles, R.J. | Engineering Index Backfile | 1928