@inproceedings{58b0de7ad247476da1d14e79e3e81836,

title = "Brief announcement: Complete visibility for oblivious robots in linear time",

abstract = "We consider the distributed setting of N autonomous mobile robots that operate in Look-Compute-Move cycles following the well celebrated classic oblivious robots model. We study the fundamental problem where starting from an arbitrary initial configuration, N autonomous robots reposition themselves to a convex hull formation on the plane where each robot is visible to all others (the Complete Visibility problem). We assume obstructed visibility, where a robot cannot see another robot if a third robot is positioned between them on the straight line connecting them. We provide the first O(N) time algorithm for this problem in the fully synchronous setting. Our contribution is a significant improvement over the runtime of the only previously known algorithm for this problem which has a lower bound of Ω(N2). Our proposed algorithm is collision-free - robots do not share positions and their paths do not cross.",

keywords = "Autonomous mobile robots, Collisions, Complete visibility, Convex hull, Oblivious Robots, Obstruction, Runtime",

author = "Gokarna Sharma and Costas Busch and Supratik Mukhopadhyay",

year = "2017",

month = jul,

day = "24",

doi = "10.1145/3087556.3087591",

language = "English (US)",

series = "Annual ACM Symposium on Parallelism in Algorithms and Architectures",

publisher = "Association for Computing Machinery",

pages = "325--327",

booktitle = "SPAA 2017 - Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures",

note = "29th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2017 ; Conference date: 24-07-2017 Through 26-07-2017",

}