Uniform Circle Formation by Swarm Robots Under Limited Visibility

被引：2
|
作者：
Mondal, Moumita [1 ]
Chaudhuri, Sruti Gan [2 ]
机构：
[1] Techno Main Saltlake, Kolkata, India
[2] Jadavpur Univ, Kolkata, India
来源：
DISTRIBUTED COMPUTING AND INTERNET TECHNOLOGY (ICDCIT 2020) | 2020年 / 11969卷
关键词：
Uniform circle formation; Autonomous; Oblivious; Swarm robots; Limited visibility;
D O I：
10.1007/978-3-030-36987-3_28
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
This paper proposes a distributed algorithm for uniform circle formation by multiple autonomous, asynchronous, oblivious mobile swarm robots. Each robot executes cycle of look-compute-move repeatedly. All robots agree upon a common origin and axes. Eventually an uniform circle of a given radius and center is formed without any collision or deadlock.
引用
收藏
页码：420 / 428
页数：9
相关论文
共 50 条
  • [41] Biangular circle formation by asynchronous mobile robots
    Katreniak, B
    [J]. STRUCTURAL INFORMATION AND COMMUNICATION COMPLEXITY, PROCEEDINGS, 2005, 3499 : 185 - 199
  • [42] Circle formation of weak robots and Lyndon words
    Dieudonne, Yoann
    Petit, Franck
    [J]. INFORMATION PROCESSING LETTERS, 2007, 101 (04) : 156 - 162
  • [43] Distributed circle formation for anonymous oblivious robots
    Chatzigiannakis, I
    Markou, M
    Nikoletseas, S
    [J]. EXPERIMENTAL AND EFFICIENT ALGORITHMS, 2004, 3059 : 159 - 174
  • [44] AN OPTIMAL ALGORITHM FOR FINDING THE EDGE VISIBILITY POLYGON UNDER LIMITED VISIBILITY
    KIM, SH
    PARK, JH
    CHOI, SH
    SHIN, SY
    CHWA, KY
    [J]. INFORMATION PROCESSING LETTERS, 1995, 53 (06) : 359 - 365
  • [45] Optimal algorithm for finding the edge visibility polygon under limited visibility
    Kim, S.-H.
    Park, J.H.
    Choi, S.-H.
    Shin, S.Y.
    Ghwa, K.-Y.
    [J]. Information Processing Letters, 1995, 53 (06):
  • [46] Distributed memoryless point convergence algorithm for mobile robots with limited visibility
    Ando, H
    Oasa, Y
    Suzuki, I
    Yamashita, M
    [J]. IEEE TRANSACTIONS ON ROBOTICS AND AUTOMATION, 1999, 15 (05): : 818 - 828
  • [47] Universally Optimal Gathering Under Limited Visibility
    Poudel, Pavan
    Sharma, Gokarna
    [J]. STABILIZATION, SAFETY, AND SECURITY OF DISTRIBUTED SYSTEMS, SSS 2017, 2018, 10616 : 323 - 340
  • [48] A Tight Runtime Bound for Synchronous Gathering of Autonomous Robots with Limited Visibility
    Degener, Bastian
    Kempkes, Barbara
    Langner, Tobias
    Heide, Friedhelm Meyer Auf Der
    Pietrzyk, Peter
    Wattenhofer, Roger
    [J]. SPAA 11: PROCEEDINGS OF THE TWENTY-THIRD ANNUAL SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURES, 2011, : 139 - 147
  • [49] Stability Analysis for Heterogeneous Swarm Robots with Limited Field of View
    Endo, Takahiro
    Maeda, Ryuma
    Matsuno, Fumitoshi
    [J]. 12TH INTERNATIONAL CONFERENCE ON THE DEVELOPMENTS IN ESYSTEMS ENGINEERING (DESE 2019), 2019, : 27 - 32
  • [50] Distribution of Roles in a Dynamic Swarm of Robots in Conditions of Limited Communications
    Ivanov, Donat
    Kapustyan, Sergey
    Petruchuk, Evgeny
    [J]. INTERACTIVE COLLABORATIVE ROBOTICS (ICR 2019), 2019, 11659 : 99 - 108
12345