Arbitrary Pattern Formation by Asynchronous Opaque Robots with Lights

The Arbitrary Pattern Formation problem asks for a distributed algorithm that moves a set of autonomous mobile robots to form any arbitrary pattern given as input. The robots are assumed to be autonomous, anonymous and identical. They operate in Look-Compute-Move cycles under an asynchronous scheduler. The robots do not have access to any global coordinate system. The movement of the robots is assumed to be rigid, which means that each robot is able to reach its desired destination without interruption. The existing literature that investigates this problem, considers robots with unobstructed visibility. This work considers the problem in the more realistic obstructed visibility model, where the view of a robot can be obstructed by the presence of other robots. The robots are assumed to be punctiform and equipped with visible lights that can assume a constant number of predefined colors. We have studied the problem in two settings based on the level of consistency among the local coordinate systems of the robots: two axis agreement (they agree on the direction and orientation of both coordinate axes) and one axis agreement (they agree on the direction and orientation of only one coordinate axis). In both settings, we have provided a full characterization of initial configurations from where any arbitrary pattern can be formed.

💡 Research Summary

The paper addresses the Arbitrary Pattern Formation (APF) problem for a swarm of autonomous, anonymous, identical robots operating under an asynchronous (ASYNC) scheduler, but with a realistic obstructed‑visibility (opaque) model. In this model a robot can see another only if the line segment joining them contains no third robot, which reflects the line‑of‑sight blocking that occurs with camera‑equipped robots in practice. The robots are point‑shaped, have no global coordinate system, and each possesses a visible light (LED) that can assume a constant, predefined set of colors. The light serves both as a weak explicit communication channel and as a form of persistent internal memory.

Two levels of agreement on local coordinate axes are considered:

1. Two‑axis agreement – all robots share the direction and orientation of both the X‑ and Y‑axes (common notions of up, down, left, right).
2. One‑axis agreement – robots only agree on the X‑axis (left/right); the Y‑axis may be flipped independently for each robot.

The authors first prove impossibility results. With only one‑axis agreement, if the initial configuration is symmetric with respect to a line K parallel to the X‑axis and no robot lies on K, then no deterministic algorithm can elect a unique leader, and consequently APF is unsolvable. This establishes a precise boundary between solvable and unsolvable initial configurations. In the two‑axis setting, such symmetry does not block determinism.

The main contribution is a deterministic algorithm that solves APF from every solvable initial configuration, using a minimal number of light colors: three colors for the two‑axis case and six colors for the one‑axis case. The algorithm proceeds in two stages:

Stage 1 – Leader Election.
In the two‑axis model the leader is simply the leftmost robot; if several share the minimum X‑coordinate, the lowest among them becomes the leader. This can be decided locally using the shared axes. In the one‑axis model, the algorithm first identifies the leftmost robots (candidates) and then uses a carefully designed sequence of color changes and limited movements to break any remaining Y‑axis symmetry, eventually isolating a unique robot that is both leftmost and lowest among the candidates. The colors encode states such as “candidate”, “moving”, “leader”, etc., allowing robots that have only partial views to coordinate without collisions.

Stage 2 – Pattern Construction.
Once a leader is elected, it fixes a global coordinate system (by declaring its own position as the origin and aligning axes according to the agreed directions). The input pattern, given as a set of points, is mapped onto the robots. Each robot computes the vector from its current position to its assigned target point (expressed in its local coordinates) and moves rigidly to that point. During movement the robot’s light is set to a “moving” color; upon arrival it switches to a “done” color. Because movements are rigid, a robot never stops midway, which simplifies reasoning about asynchrony. The light colors also allow other robots to detect whether a neighbor is still in transit, preventing deadlocks and ensuring progress.

The paper provides rigorous proofs of safety (no two robots occupy the same point, no collisions) and liveness (every robot eventually reaches its target). It also shows that the algorithm terminates under any fair asynchronous schedule. The use of only three or six colors demonstrates that very limited communication suffices even when visibility is obstructed.

In addition to solving APF, the algorithm implicitly solves the Leader Election problem in the obstructed‑visibility model, which had previously been addressed only by randomized methods. The deterministic solution for one‑axis agreement is, to the authors’ knowledge, the first of its kind.

The work significantly extends the theory of distributed robot coordination by moving from the idealized unobstructed‑visibility setting to a more realistic opaque setting, while still achieving full pattern formation with minimal resources. The results are directly applicable to real robot platforms equipped with LEDs and cameras, where line‑of‑sight occlusions are common, making the contribution both theoretically deep and practically relevant.