  Arbitrary pattern formation ($\mathcal{APF}$) by mobile robots is studied by
many in literature under different conditions and environment. Recently it has
been studied on an infinite grid network but with full visibility. In opaque
robot model, circle formation on infinite grid has also been studied. In this
paper, we are solving $\mathcal{APF}$ on infinite grid with asynchronous opaque
robots with lights. The robots do not share any global co-ordinate system. The
main challenge in this problem is to elect a leader to agree upon a global
co-ordinate where the vision of the robots are obstructed by other robots.
Since the robots are on a grid, their movements are also restricted to avoid
collisions. In this paper, the aforementioned hardness are overcome to produce
an algorithm that solves the problem.
