The Complete Visibility Problem for Fat Robots with Lights

We consider the distributed setting of N autonomous mobile robots that operate in Look-Compute-Move cycles and communicate with other robots using colored lights (the robots with lights model). We study the fundamental problem of repositioning N autonomous robots on a plane so that each robot is visible to all others (the Complete Visibility problem) on this model. We consider obstructed visibility under which a robot cannot see another robot if a third robot is positioned between then on the straight line connecting them. The literature solves this problem on the robots with lights model for point robots. In this paper, we study this problem, for the very first time, on the robots with lights model for fat robots, i.e., the robots which have physical extents. In particular, we present and analyze an algorithm for the fat robots of unit disc size extents that solves Complete Visibility in O(N) time using 9 colors in the fully synchronous setting avoiding robot collisions.

[1]  Gokarna Sharma,et al.  Complete Visibility for Robots with Lights in O(1) Time , 2016, SSS.

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

[3]  Nicola Santoro,et al.  The Mutual Visibility Problem for Oblivious Robots , 2014, CCCG.

[4]  Sruti Gan Chaudhuri,et al.  Leader election and gathering for asynchronous fat robots without common chirality , 2015, J. Discrete Algorithms.

[5]  Gokarna Sharma,et al.  Brief Announcement: Complete Visibility for Oblivious Robots in Linear Time , 2017, SPAA.

[6]  Gokarna Sharma,et al.  O(log N)-Time Complete Visibility for Asynchronous Robots with Lights , 2017, 2017 IEEE International Parallel and Distributed Processing Symposium (IPDPS).

[7]  Gokarna Sharma,et al.  Constant-Time Complete Visibility for Asynchronous Robots with Lights , 2017, SSS.

[8]  Reuven Cohen,et al.  Local spreading algorithms for autonomous robot systems , 2008, Theor. Comput. Sci..

[9]  Gokarna Sharma,et al.  Mutual Visibility with an Optimal Number of Colors , 2015, ALGOSENSORS.

[10]  Chryssis Georgiou,et al.  A distributed algorithm for gathering many fat mobile robots in the plane , 2013, PODC '13.

[11]  Gokarna Sharma,et al.  Tight analysis of a collisionless robot gathering algorithm , 2015, 2015 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS).

[12]  Andrzej Pelc,et al.  Gathering few fat mobile robots in the plane , 2006, Theor. Comput. Sci..

[13]  Gokarna Sharma,et al.  Logarithmic-Time Complete Visibility for Robots with Lights , 2015, 2015 IEEE International Parallel and Distributed Processing Symposium.

[14]  Nicola Santoro,et al.  Autonomous mobile robots with lights , 2016, Theor. Comput. Sci..

[15]  Nicola Santoro,et al.  Mutual visibility by luminous robots without collisions , 2015, Inf. Comput..