Constant-Time Complete Visibility for Robots with Lights: The Asynchronous Case

Constant-Time Complete Visibility for Robots with Lights: The Asynchronous Case

We consider the distributed setting of <i>N</i> autonomous mobile robots that operate in <i>Look-Compute-Move</i> (LCM) cycles and use colored lights (the <i>robots with lights</i> model). We assume <i>obstructed visibility</i> where a robot cannot see...

Full description

Bibliographic Details
Main Authors: Gokarna Sharma, Ramachandran Vaidyanathan, Jerry L. Trahan
Format: Article
Language:English
Published: MDPI AG 2021-02-01
Series:Algorithms
Subjects:
distributed algorithms
autonomous mobile robots
robots with lights
complete visibility
collisions
convex hull
Online Access:https://www.mdpi.com/1999-4893/14/2/56

Internet

https://www.mdpi.com/1999-4893/14/2/56

Similar Items