Gathering on a circle with limited visibility by anonymous oblivious robots

被引：0
|
作者：
Di Luna, Giuseppe Antonio [1 ]
Uehara, Ryuhei [2 ]
Viglietta, Giovanni [3 ]
Yamauchi, Yukiko [4 ]
机构：
[1] DIAG, Sapienza University of Rome, Italy
[2] School of Information Science, JAIST, Japan
[3] Department of Computer Science and Engineering, University of Aizu, Japan
[4] Department of Informatics, Graduate School of ISEE, Kyushu University, Japan
来源：
Theoretical Computer Science | 2025年 / 1025卷
关键词：
Mobile robots;
D O I：
10.1016/j.tcs.2024.114974
中图分类号：
TP24 [机器人技术];
学科分类号：
080202 ; 1405 ;
摘要：
A swarm of anonymous oblivious mobile robots, operating in deterministic Look-Compute-Move cycles, is confined within a circular track. All robots agree on the clockwise direction (chirality), they are activated by an adversarial semi-synchronous scheduler (SSYNCH), and an active robot always reaches the destination point it computes (rigidity). Robots have limited visibility: each robot can see only the points on the circle that have an angular distance strictly smaller than a constant ϑ from the robot's current location, where 0 © 2024 Elsevier B.V.
引用
收藏
相关论文
共 50 条
  • [1] Gathering Anonymous, Oblivious Robots on a Grid
    Castenow, Jannik
    Fischer, Matthias
    Harbig, Jonas
    Jung, Daniel
    der Heide, Friedhelm Meyer Auf
    [J]. THEORETICAL COMPUTER SCIENCE, 2020, 815 : 289 - 309
  • [2] Distributed circle formation for anonymous oblivious robots
    Chatzigiannakis, I
    Markou, M
    Nikoletseas, S
    [J]. EXPERIMENTAL AND EFFICIENT ALGORITHMS, 2004, 3059 : 159 - 174
  • [3] Gathering six oblivious robots on anonymous symmetric rings
    D'Angelo, Gianlorenzo
    Di Stefano, Gabriele
    Navarra, Alfredo
    [J]. JOURNAL OF DISCRETE ALGORITHMS, 2014, 26 : 16 - 27
  • [4] Gathering of asynchronous robots with limited visibility
    Flocchini, P
    Prencipe, G
    Santoro, N
    Widmayer, P
    [J]. THEORETICAL COMPUTER SCIENCE, 2005, 337 (1-3) : 147 - 168
  • [5] Optimal gathering of oblivious robots in anonymous graphs and its application on trees and rings
    Di Stefano, Gabriele
    Navarra, Alfredo
    [J]. DISTRIBUTED COMPUTING, 2017, 30 (02) : 75 - 86
  • [6] Optimal gathering of oblivious robots in anonymous graphs and its application on trees and rings
    Gabriele Di Stefano
    Alfredo Navarra
    [J]. Distributed Computing, 2017, 30 : 75 - 86
  • [7] Circle Formation by Asynchronous Fat Robots with Limited Visibility
    Dutta, Ayan
    Chaudhuri, Sruti Gan
    Datta, Suparno
    Mukhopadhyaya, Krishnendu
    [J]. DISTRIBUTED COMPUTING AND INTERNET TECHNOLOGY, 2012, 7154 : 83 - +
  • [8] Gathering Asynchronous Swarm Robots under Nonuniform Limited Visibility
    Chatterjee, Avik
    Chaudhuri, Sruti Gan
    Mukhopadhyaya, Krishnendu
    [J]. DISTRIBUTED COMPUTING AND INTERNET TECHNOLOGY, ICDCIT 2015, 2015, 8956 : 174 - 180
  • [9] Gathering of Fat Robots with Limited Visibility and without Global Navigation
    Bolla, Kalman
    Kovacs, Tamas
    Fazekas, Gabor
    [J]. SWARM AND EVOLUTIONARY COMPUTATION, 2012, 7269 : 30 - 38
  • [10] Uniform Circle Formation by Swarm Robots Under Limited Visibility
    Mondal, Moumita
    Chaudhuri, Sruti Gan
    [J]. DISTRIBUTED COMPUTING AND INTERNET TECHNOLOGY (ICDCIT 2020), 2020, 11969 : 420 - 428
12345