A large body of work in distributed computing has focused on the computational and complexity issues that arise in systems of mobile computational entities, called robots. The robots operate in Euclidean spaces (typically the plane) in Look-Compute-Move (LCM) cycles of activities: in each cycle, a robot perceives the positions of the other robots within its local coordinate system (Look), executes a set of deterministic rules common to all robots to compute a destination (Compute), and then moves toward that destination, not necessarily reaching it (Move).