TY - GEN
T1 - Separation of Unconscious Colored Robots
AU - Seike, Hirokazu
AU - Yamauchi, Yukiko
N1 - Publisher Copyright:
© 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.
PY - 2023
Y1 - 2023
N2 - We introduce a new mobile robot model, called unconscious colored robots, where each robot is given a color and can observe the colors of robots except itself. We consider the separation problem that requires the robots to be separated according to their colors. We consider two variants; the separation-into-points problem requires the robots with the same color gather at one point and the separation-into-circles problem requires the robots with the same color form a circle concentric with the smallest enclosing circle of the entire robots. We first show that the separation-into-points problem is not always solvable due to symmetry of an initial configuration. We then present a distributed algorithm for the separation-into-circles problem by oblivious semi-synchronous unconscious colored robots with two colors. The proposed algorithm requires that there are at least three robots of the same color and the total number of robots is larger than five.
AB - We introduce a new mobile robot model, called unconscious colored robots, where each robot is given a color and can observe the colors of robots except itself. We consider the separation problem that requires the robots to be separated according to their colors. We consider two variants; the separation-into-points problem requires the robots with the same color gather at one point and the separation-into-circles problem requires the robots with the same color form a circle concentric with the smallest enclosing circle of the entire robots. We first show that the separation-into-points problem is not always solvable due to symmetry of an initial configuration. We then present a distributed algorithm for the separation-into-circles problem by oblivious semi-synchronous unconscious colored robots with two colors. The proposed algorithm requires that there are at least three robots of the same color and the total number of robots is larger than five.
UR - http://www.scopus.com/inward/record.url?scp=85174486239&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85174486239&partnerID=8YFLogxK
U2 - 10.1007/978-3-031-44274-2_24
DO - 10.1007/978-3-031-44274-2_24
M3 - Conference contribution
AN - SCOPUS:85174486239
SN - 9783031442735
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 328
EP - 343
BT - Stabilization, Safety, and Security of Distributed Systems - 25th International Symposium, SSS 2023, Proceedings
A2 - Dolev, Shlomi
A2 - Schieber, Baruch
PB - Springer Science and Business Media Deutschland GmbH
T2 - 25th International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2023
Y2 - 2 October 2023 through 4 October 2023
ER -