Loading...
Please wait, while we are loading the content...
Constant-Time Complete Visibility for Robots with Lights: The Asynchronous Case
Content Provider | MDPI |
---|---|
Author | Sharma, Gokarna Vaidyanathan, Ramachandran Trahan, Jerry |
Copyright Year | 2021 |
Abstract | We consider the distributed setting of N autonomous mobile robots that operate in Look-Compute-Move (LCM) cycles and use colored lights (the robots with lights model). We assume obstructed visibility where a robot cannot see another robot if a third robot is positioned between them on the straight line segment connecting them. In this paper, we consider the problem of positioning N autonomous robots on a plane so that every robot is visible to all others (this is called the Complete Visibility problem). This problem is fundamental, as it provides a basis to solve many other problems under obstructed visibility. In this paper, we provide the first, asymptotically optimal, |
Starting Page | 56 |
e-ISSN | 19994893 |
DOI | 10.3390/a14020056 |
Journal | Algorithms |
Issue Number | 2 |
Volume Number | 14 |
Language | English |
Publisher | MDPI |
Publisher Date | 2021-02-09 |
Access Restriction | Open |
Subject Keyword | Algorithms Automotive Engineering Robotics Distributed Algorithms Autonomous Mobile Robots Robots with Lights Complete Visibility Collisions Convex Hull Obstruction Runtime |
Content Type | Text |
Resource Type | Article |