Complete Visibility Algorithms of Luminous Robots With Two‐Color Lights on Grid.
Saved in:
| Title: | Complete Visibility Algorithms of Luminous Robots With Two‐Color Lights on Grid. |
|---|---|
| Authors: | Kim, Yonghwan, Katayama, Yoshiaki, Wada, Koichi |
| Source: | Concurrency & Computation: Practice & Experience; 1/25/2025, Vol. 37 Issue 2, p1-20, 20p |
| Subject Terms: | DETERMINISTIC algorithms, PROBLEM solving, ROBOTS, RECTANGLES, ALGORITHMS, MOBILE robots |
| Abstract: | An autonomous mobile robot system is a distributed system consisting of multiple mobile computational entities, called robots, which autonomously and repeatedly perform three fundamental operations: look, compute, and move. Various challenges in such systems, including gathering, pattern formation, and flocking, have been extensively studied to explore the relationship between the robots' capabilities and the feasibility of solving these problems (i.e., solvability). In this study, we focus on the complete visibility problem, which aims to relocate all robots on an infinite grid plane so that every robot is visible to every other robot (i.e., complete visibility). We assume that each robot is a luminous robot (i.e., has a light with a constant number of colors) and opaque (non‐transparent). This paper primarily examines the number of light colors required for each robot to solve the complete visibility problem. Specifically, we investigate the question: "how many colors can we reduce while still achieving complete visibility?" (even under certain stronger assumptions). As an answer to the above question, we show the existence of a deterministic algorithm to achieve complete visibility (i.e., every robot can observe all the other robots) using only two colors of light, if the robots agree on the directions and orientations of both axes. The proposed algorithm correctly works even if robots operate asynchronously and have no knowledge of the total number of robots. Moreover, its spatial complexity (i.e., the area of the smallest enclosed rectangle that includes all robots in the final configuration) ensures the optimal one, On2$$ \mathcal{O}\left({n}^2\right) $$, where n$$ n $$ is the number of robots. [ABSTRACT FROM AUTHOR] |
| Copyright of Concurrency & Computation: Practice & Experience is the property of Wiley-Blackwell and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Complementary Index |
Full Text Finder 
Nájsť tento článok vo Web of Science Be the first to leave a comment!