Mutual Visibility for Asynchronous Robots
This paper presents a study of the mutual visibility problem for a set of opaque asynchronous robots in the Euclidean plane. Due to opacity, if three robots lie on a line, the middle robot obstructs the visions of the two other robots. The mutual visibility problem requires the robots to coordinate their movements to form a configuration in which no three robots are collinear. This work presents a distributed algorithm which solves the mutual visibility problem for a set of \(n\ge 2\) asynchronous robots under the FState computational model. The proposed algorithm assumes 1 bit of persistent memory and the knowledge of n. The proposed solution works under the non-rigid movements of the robots and also provides collision free movements for the robots.
- 2.Di Luna, G.A., Flocchini, P., Poloni, F., Santoro, N., Viglietta, G.: The mutual visibility problem for oblivious robots. In: Proceedings of 26th Canadian Conference on Computational Geometry (CCCG) (2014)Google Scholar
- 3.Bhagat, S., Chaudhuri, S.G., Mukhopadhyaya, K.: Formation of general position by asynchronous mobile robots under one-axis agreement. In: Kaykobad, M., Petreschi, R. (eds.) WALCOM 2016. LNCS, vol. 9627, pp. 80–91. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-30139-6_7CrossRefGoogle Scholar
- 4.Agathangelou, C., Georgiou, C., Mavronicolas, M.: A distributed algorithm for gathering many fat mobile robots in the plane. In: Proceedings of the 32nd ACM Symposium on Principles of Distributed Computing (PODC), pp. 250–259 (2013)Google Scholar