Improved protocols for luminous asynchronous robots

The distributed setting of computational mobile entities, called robots, that have to perform tasks without global coordination has been extensively studied in the literature. A well-known scenario is that in which robots operate in Look-Compute-Move (LCM) cycles. LCM cycles might be subject to different temporal constraints dictated by the considered schedule. The classic models for the activation and synchronization of mobile robots are the well-known fully-synchronous, semi-synchronous, and asynchronous models. In this paper, we concentrate on the weakest asynchronous model, and propose improved and general protocols to solve tasks when the robots are endowed with lights, i.e. they are luminous.