Abstract
We consider \(K=(k+1)\times (k+1)\) autonomous mobile robots operating on an anonymous \(N=(n+1)\times (n+1)\)-node grid, \(n=k\cdot d, d\ge 2\), \(k\ge 2,\) following Look-Compute-Move cycles under the classic oblivious robots model. Starting from any initial configuration of robots positioned on distinct grid nodes, we consider the uniform scattering problem of repositioning them on the grid nodes so that each robot reaches to a static configuration in which they cover uniformly the grid. In this paper, we provide the first O(n) time, collision-free algorithm for this problem in the asynchronous setting, given that the robots have common orientation, knowledge of n and k, O(1)-bits of memory, and visibility range of \(2 \cdot \max \{n/k,k\}\). The best previously known algorithm for this problem on a grid has runtime \(O(n^2/d)\) (or O(nk)) with the same robot capabilities in the asynchronous setting except the visibility range \(2 \cdot n/k\). The proposed algorithm is asymptotically time-optimal since there is a time lower bound of \(\varOmega (n)\).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Barrameda, E.M., Das, S., Santoro, N.: Uniform dispersal of asynchronous finite-state mobile robots in presence of holes. In: ALGOSENSORS, pp. 228–243 (2013)
Barriere, L., Flocchini, P., Mesa-Barrameda, E., Santoro, N.: Uniform scattering of autonomous mobile robots in a grid. In: IPDPS, pp. 1–8 (2009)
Cohen, R., Peleg, D.: Local spreading algorithms for autonomous robot systems. Theor. Comput. Sci. 399(1–2), 71–82 (2008)
Das, S., Flocchini, P., Prencipe, G., Santoro, N., Yamashita, M.: Autonomous mobile robots with lights. Theor. Comput. Sci. 609, 171–184 (2016)
Défago, X., Souissi, S.: Non-uniform circle formation algorithm for oblivious mobile robots with convergence toward uniformity. Theor. Comput. Sci. 396(1–3), 97–112 (2008)
Elor, Y., Bruckstein, A.M.: Uniform multi-agent deployment on a ring. Theor. Comput. Sci. 412(8–10), 783–795 (2011)
Flocchini, P., Prencipe, G., Santoro, N.: Self-deployment of mobile sensors on a ring. Theor. Comput. Sci. 402(1), 67–80 (2008)
Flocchini, P., Prencipe, G., Santoro, N.: Distributed Computing by Oblivious Mobile Robots. Synthesis Lectures on Distributed Computing Theory, vol. 3, no. 2, pp. 1–185 (2012)
Flocchini, P., Prencipe, G., Santoro, N., Viglietta, G.: Distributed computing by mobile robots: uniform circle formation. Distrib. Comput. 30(6), 413–457 (2016). https://doi.org/10.1007/s00446-016-0291-x
Flocchini, P., Prencipe, G., Santoro, N., Widmayer, P.: Arbitrary pattern formation by asynchronous, anonymous, oblivious robots. Theor. Comput. Sci. 407(1–3), 412–447 (2008)
Heo, N., Varshney, P.K.: Energy-efficient deployment of intelligent mobile sensor networks. Trans. Sys. Man Cyber. Part A 35(1), 78–92 (2005)
Howard, A., Matarić, M.J., Sukhatme, G.S.: An incremental self-deployment algorithm for mobile sensor networks. Auton. Rob. 13(2), 113–126 (2002)
Hsiang, T.-R., Arkin, E.M., Bender, M.A., Fekete, S.P., Mitchell, J.S.B.: Algorithms for rapidly dispersing robot swarms in unknown environments. In: Boissonnat, J.-D., Burdick, J., Goldberg, K., Hutchinson, S. (eds.) Algorithmic Foundations of Robotics V. STAR, vol. 7, pp. 77–93. Springer, Heidelberg (2004). https://doi.org/10.1007/978-3-540-45058-0_6
Izumi, T., Kaino, D., Potop-Butucaru, M.G., Tixeuil, S.: On time complexity for connectivity-preserving scattering of mobile robots. Theor. Comput. Sci. 738, 42–52 (2018)
Katreniak, B.: Biangular circle formation by asynchronous mobile robots. In: Pelc, A., Raynal, M. (eds.) SIROCCO 2005. LNCS, vol. 3499, pp. 185–199. Springer, Heidelberg (2005). https://doi.org/10.1007/11429647_16
Lin, Z., Zhang, S., Yan, G.: An incremental deployment algorithm for wireless sensor networks using one or multiple autonomous agents. Ad Hoc Netw. 11(1), 355–367 (2013)
Poduri, S., Sukhatme, G.S.: Constrained coverage for mobile sensor networks. In: ICRA, pp. 165–171 (2004)
Poudel, P., Sharma, G.: Time-optimal uniform scattering in a grid. In: ICDCN, pp. 228–237 (2019)
Sharma, G., Krishnan, H.: Tight bounds on localized sensor self-deployment for focused coverage. In: ICCCN, pp. 1–7. IEEE (2015)
Shibata, M., Mega, T., Ooshita, F., Kakugawa, H., Masuzawa, T.: Uniform deployment of mobile agents in asynchronous rings. In: PODC, pp. 415–424 (2016)
Sinan Hanay, Y., Gazi, V.: Distributed sensor deployment using potential fields. Ad Hoc Netw. 67(C), 77–86 (2017)
Suzuki, I., Yamashita, M.: Distributed anonymous mobile robots: formation of geometric patterns. SIAM J. Comput. 28(4), 1347–1363 (1999)
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
Poudel, P., Sharma, G. (2020). Fast Uniform Scattering on a Grid for Asynchronous Oblivious Robots. In: Devismes, S., Mittal, N. (eds) Stabilization, Safety, and Security of Distributed Systems. SSS 2020. Lecture Notes in Computer Science(), vol 12514. Springer, Cham. https://doi.org/10.1007/978-3-030-64348-5_17
Download citation
DOI: https://doi.org/10.1007/978-3-030-64348-5_17
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-64347-8
Online ISBN: 978-3-030-64348-5
eBook Packages: Computer ScienceComputer Science (R0)