@inproceedings{bf197dcc10294dd18c263647315be7e3,
title = "O(log N)-Time Complete Visibility for Asynchronous Robots with Lights",
abstract = "We consider the distributed setting of N autonomous mobile robots that operate in Look-Compute-Move (LCM) 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 sothat each robot is visible to all others (the Complete Visibility problem) on this model; a robot cannot see another robot if a third robot is positioned between them on the straight line connecting them. There exists an O(1) time, O(1) color algorithm for this problem in the semi-synchronous setting. In this paper, we provide the first O(log N) time, O(1) color algorithm for this problem in the asynchronous setting. This is a significant improvement over an O(N)-time translation of the semi-synchronous algorithm to the asynchronous setting. The proposed algorithm is collision-free-robots do not share positions and their paths do not cross.",
keywords = "collisions, convex hull, Distributed algorithms, mobile robots, obstruction, robots with lights, visibility",
author = "Gokarna Sharma and Ramachandran Vaidyanathan and Trahan, {Jerry L.} and Costas Busch and Suresh Rai",
year = "2017",
month = jun,
day = "30",
doi = "10.1109/IPDPS.2017.51",
language = "English (US)",
series = "Proceedings - 2017 IEEE 31st International Parallel and Distributed Processing Symposium, IPDPS 2017",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "513--522",
booktitle = "Proceedings - 2017 IEEE 31st International Parallel and Distributed Processing Symposium, IPDPS 2017",
note = "31st IEEE International Parallel and Distributed Processing Symposium, IPDPS 2017 ; Conference date: 29-05-2017 Through 02-06-2017",
}