Uniform dispersal of silent oblivious robots

Consider the Filling problem, in which a set of mobile robots enter an unknown area and have to disperse in that area. The robots are homogeneous, anonymous, autonomous, have limited visibility radius, and do not use explicit communication. Moreover, these robots are oblivious, i.e. they do not have any bits of persistent memory. It is already known that these limitations prevent the creation of a deterministic algorithm to solve the Filling problem. In this paper an algorithm is presented, which is the first to overcome those limitations, to fill the area with oblivious robots. The algorithm is collision-free, has an expected termination time of O(n3) rounds, where n is the number of robots (and the number of cells in the area).

[1]  Nicola Santoro,et al.  Deployment of Asynchronous Robotic Sensors in Unknown Orthogonal Environments , 2008, ALGOSENSORS.

[2]  Nicola Santoro,et al.  Uniform Dispersal of Asynchronous Finite-State Mobile Robots in Presence of Holes , 2013, ALGOSENSORS.

[3]  Pramod K. Varshney,et al.  A distributed self spreading algorithm for mobile wireless sensor networks , 2003, 2003 IEEE Wireless Communications and Networking, 2003. WCNC 2003..

[4]  Esther M. Arkin,et al.  Algorithms for Rapidly Dispersing Robot Swarms in Unknown Environments , 2002, WAFR.

[5]  Attila Hideg,et al.  Area coverage using distributed randomized methods , 2016, 2016 Cybernetics & Informatics (K&I).

[6]  Howie Choset,et al.  Coverage for robotics – A survey of recent results , 2001, Annals of Mathematics and Artificial Intelligence.

[7]  Ivan Stojmenovic,et al.  Focused-coverage by mobile sensor networks , 2009, 2009 IEEE 6th International Conference on Mobile Adhoc and Sensor Systems.

[8]  Attila Hideg,et al.  Uniform dispersal of oblivious mobile robots , 2016, 2016 7th IEEE International Conference on Cognitive Infocommunications (CogInfoCom).

[9]  L. Asz.  Random Walks on Graphs: a Survey , 2022 .

[10]  Gaurav S. Sukhatme,et al.  An Incremental Self-Deployment Algorithm for Mobile Sensor Networks , 2002, Auton. Robots.

[11]  Richard J. Lipton,et al.  Random walks, universal traversal sequences, and the complexity of maze problems , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[12]  Nicola Santoro,et al.  Distributed Computing by Oblivious Mobile Robots , 2012, Synthesis Lectures on Distributed Computing Theory.

[13]  N. Linial,et al.  On the cover time of random walks on graphs , 1989 .