Abstract
We consider a distributed system of \(n\ge 3\) opaque robots deployed in the Euclidean plane. 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 form a configuration in which no three robots are collinear i.e., all the robots in the system are mutually visible. Robots work without any centralized control. We considers the FSTATE computational model in which each robot is endowed with an additional constant amount of persistent memory to retain some information of their previous states [3]. This information is not available to the other robots in the system. Except from this persistent memory, the robots are oblivious i.e., they do not carry forward any other information from their previous computational cycles. The robots do not have any explicit message passing capabilities. Under these weak settings, we present a deterministic distributed algorithm to solve the mutual visibility problem for a set of synchronous robots using only 1 bit of persistent memory. The proposed algorithm solves the mutual visibility problem in 2 rounds and guarantees collision-free movements for the robots. The algorithm is optimum in terms of round complexity, the amount of memory for the FSTATE computational model and number of movements for the robots.
Research supported in part by DST INSPIRE Faculty research grant DST/INSPIRE/04/2015/002801 from Department of Science & Technology, India.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Di Luna, G.A., Flocchini, P., Poloni, F., Santoro, N., Viglietta, G.: The mutual visibility problem for oblivious robots. In: Proceedings 26th Canadian Conference on Computational Geometry (CCCG 2014) (2014)
Vaidyanathan, R., Busch, C., Trahan, J.L., Sharma, G., Rai, S.: Logarithmic-time complete visibility for robots with lights. In: Proceedings Parallel and Distributed Processing Symposium (IPDPS), pp. 375–384 (2015)
Flocchini, P., Santoro, N., Viglietta, G., Yamashita, M.: Rendezvous of two robots with constant memory. In: Moscibroda, T., Rescigno, A.A. (eds.) SIROCCO 2013. LNCS, vol. 8179, pp. 189–200. Springer, Cham (2013). https://doi.org/10.1007/978-3-319-03578-9_16
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_7
Aljohani, A., Sharma, G.: Complete visibility for mobile robots with lights tolerating faults. Int. J. Netw. Comput. 8(1), 32–52 (2018)
Sharma, G., Vaidyanathan, R., Trahan, J.L.: Constant-time complete visibility for asynchronous robots with lights. In: Spirakis, P., Tsigas, P. (eds.) SSS 2017. LNCS, vol. 10616, pp. 265–281. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-69084-1_18
Bhagat, S., Mukhopadhyaya, K.: Optimum algorithm for mutual visibility among asynchronous robots with lights. In: Spirakis, P., Tsigas, P. (eds.) SSS 2017. LNCS, vol. 10616, pp. 341–355. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-69084-1_24
Sharma, G., Busch, C., Mukhopadhyay, S.: Complete visibility for oblivious robots in \(\cal{O}(N)\) time. In: Podelski, A., Taïani, F. (eds.) NETYS 2018. LNCS, vol. 11028, pp. 67–84. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-05529-5_5
Aljohani, A., Poudel, P., Sharma, G.: Fault-tolerant complete visibility for asynchronous robots with lights under one-axis agreement. In: Rahman, M.S., Sung, W.-K., Uehara, R. (eds.) WALCOM 2018. LNCS, vol. 10755, pp. 169–182. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-75172-6_15
Sharma, G.: Mutual visibility for robots with lights tolerating light faults. In: Proceedings IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW), pp. 829–836 (2018)
Sharma, G., Vaidyanathan, R., Trahan, J.L., Busch, C., Rai, S.: O(log N)-time complete visibility for asynchronous robots with lights. In: Proceedings Parallel and Distributed Processing Symposium (IPDPS), pp. 513–522 (2017)
Sharma, G., Vaidyanathan, R., Trahan, J.L., Busch, C., Rai, S.: Complete visibility for robots with lights in O(1) Time. In: Bonakdarpour, B., Petit, F. (eds.) SSS 2016. LNCS, vol. 10083, pp. 327–345. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-49259-9_26
Sharma, G., Busch, C., Mukhopadhyay, S.: Mutual visibility with an optimal number of colors. In: Bose, P., Gąsieniec, L.A., Römer, K., Wattenhofer, R. (eds.) ALGOSENSORS 2015. LNCS, vol. 9536, pp. 196–210. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-28472-9_15
Sharma, G., Busch, C., Mukhopadhyay, S.: Bounds on mutual visibility algorithms. In: Proceedings 27th Canadian Conference on Computational Geometry (CCCG 2015) (2015)
Di Luna, G.A., Flocchini, P., Gan Chaudhuri, S., Poloni, F., Santoro, N., Viglietta, G.: Mutual visibility by luminous robots without collisions. Inf. Comput. 254, 392–418 (2017)
Bhagat, S., Mukhopadhyaya, K.: Mutual visibility by robots with persistent memory. In: Chen, Y., Deng, X., Lu, M. (eds.) FAW 2019. LNCS, vol. 11458, pp. 144–155. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-18126-0_13
Bhagat, S., Gan Chaudhuri, S., Mukhopadhyaya, K.: Mutual visibility for asynchronous robots. In: Censor-Hillel, K., Flammini, M. (eds.) SIROCCO 2019. LNCS, vol. 11639, pp. 336–339. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-24922-9_24
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Bhagat, S. (2020). Optimum Algorithm for the Mutual Visibility Problem. In: Rahman, M., Sadakane, K., Sung, WK. (eds) WALCOM: Algorithms and Computation. WALCOM 2020. Lecture Notes in Computer Science(), vol 12049. Springer, Cham. https://doi.org/10.1007/978-3-030-39881-1_4
Download citation
DOI: https://doi.org/10.1007/978-3-030-39881-1_4
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-39880-4
Online ISBN: 978-3-030-39881-1
eBook Packages: Computer ScienceComputer Science (R0)