@inproceedings{8f011ca0b2214f1aae5dee7828cf061e,

title = "Complete visibility for oblivious robots in O(N) Time",

abstract = " We consider the distributed setting of N autonomous mobile robots that operate in Look-Compute-Move cycles following the 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 Ω(N 2 ) in the fully synchronous setting. The proposed algorithm is collision-free – robots do not share positions and their paths do not cross. ",

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

year = "2019",

doi = "10.1007/978-3-030-05529-5_5",

language = "English (US)",

isbn = "9783030055288",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "67--84",

editor = "Andreas Podelski and Fran{\c c}ois Ta{\"i}ani",

booktitle = "Networked Systems - 6th International Conference, NETYS 2018, Revised Selected Papers",

note = "6th International Conference on Networked Systems, NETYS 2018 ; Conference date: 09-05-2018 Through 11-05-2018",

}