R. Adhikary, K. Bose, M. K. Kundu, and B. Sau, Mutual visibility by asynchronous robots on infinite grid, ALGOSENSORS. pp, pp.83-101, 2018.

R. Baldoni, F. Bonnet, A. Milani, and M. Raynal, Anonymous graph exploration without collision by mobile robots, Inf. Process. Letters, vol.109, issue.2, pp.98-103, 2008.
URL : https://hal.archives-ouvertes.fr/inria-00250153

F. Bonnet, A. Milani, M. Potop-butucaru, and S. Tixeuil, Asynchronous exclusive perpetual grid exploration without sense of direction, OPODIS, pp.251-265, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00626155

K. Bose, R. Adhikary, M. K. Kundu, and B. Sau, Arbitrary pattern formation on infinite grid by asynchronous oblivious robots, WALCOM. pp, pp.354-366, 2019.

Q. Bramas, S. Devismes, and P. Lafourcade, Infinite grid exploration by disoriented robots, SIROCCO. pp, pp.340-344, 2019.
URL : https://hal.archives-ouvertes.fr/hal-02559612

Q. Bramas, S. Devismes, and P. Lafourcade, Infinite Grid Exploration by Disoriented Robots : Animations, 2019.

S. Brandt, J. Uitto, and R. Wattenhofer, A Tight Bound for Semi-Synchronous Collaborative Grid Exploration, 2018.

S. Das, P. Flocchini, G. Prencipe, N. Santoro, and M. Yamashita, Autonomous mobile robots with lights, Theoretical Computer Science, vol.609, issue.P1, pp.171-184, 2016.
URL : https://hal.archives-ouvertes.fr/hal-02082178

S. Devismes, A. Lamani, F. Petit, P. Raymond, and S. Tixeuil, Optimal grid exploration by asynchronous oblivious robots, SSS. pp, pp.64-76, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00934161

D. Stefano, G. Navarra, and A. , Gathering of oblivious robots on infinite grids with minimum traveled distance, Information and Computation, vol.254, 2016.

Y. Dieudonné and F. Petit, Circle formation of weak robots and lyndon words, Inf. Process. Letters, vol.101, issue.4, pp.156-162, 2007.

D. Dutta, T. Dey, and S. G. Chaudhuri, Gathering multiple robots in a ring and an infinite grid, ICDCIT. pp, pp.15-26, 2017.

Y. Emek, T. Langner, D. Stolz, J. Uitto, and R. Wattenhofer, How many ants does it take to find the food?, Theoretical Computer Science, vol.608, issue.P3, pp.255-267, 2015.

P. Flocchini, G. Prencipe, N. Santoro, and P. Widmayer, Gathering of asynchronous robots with limited visibility, Theoretical Computer Science, vol.337, issue.1, pp.147-168, 2005.

G. A. Luna, P. Flocchini, S. G. Chaudhuri, F. Poloni, N. Santoro et al., Mutual visibility by luminous robots without collisions, Inf. and Comp, vol.254, pp.392-418, 2017.

F. Ooshita and A. K. Datta, Brief announcement: Feasibility of weak gathering in connectedover-time dynamic rings, SSS. pp, pp.393-397, 2018.

D. Peleg, Distributed coordination algorithms for mobile robot swarms: New directions and challenges, IWDC. pp, pp.1-12, 2005.

Y. Yang, S. Souissi, X. Défago, and M. Takizawa, Fault-tolerant flocking for a group of autonomous mobile robots, Journal of Systems and Software, vol.84, issue.1, pp.29-36, 2011.