Perpetual Torus Exploration by Myopic Luminous Robots.

We study perpetual torus exploration for swarm of autonomous, anonymous, uniform, luminous robots with a common chirality. We consider robots with only few capabilities. They have a finite limited vision (myopic), they can only see robots at distance one or two. We show that the problem is impossible with only two luminous robots and also with three oblivious robots (without light). We design an optimal algorithm for three luminous robots using two colors and with visibility one. We also propose an optimal algorithm with visibility two with four oblivious robots.