Forgive and forget: Self-stabilizing swarms in spite of Byzantine robots

被引:2
作者
Ashkenazi, Yotam [1 ]
Dolev, Shlomi [1 ]
Kamei, Sayaka [2 ]
Ooshita, Fukuhito [3 ]
Wada, Koichi [4 ]
机构
[1] Ben Gurion Univ Negev, Dept Comp Sci, Beer Sheva, Israel
[2] Hiroshima Univ, Grad Sch Adv Sci & Engn, Hiroshima, Japan
[3] Nara Inst Sci & Technol, Grad Sch Sci & Technol, Nara, Japan
[4] Hosei Univ, Fac Sci & Engn, Dept Appl Informat, Tokyo, Japan
基金
日本学术振兴会;
关键词
Byzantine robots; distributed algorithms; self‐ stabilizing algorithms;
D O I
10.1002/cpe.6123
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
In this article, we consider the case in which a swarm of robots collaborates in a mission, where a few of the robots behave maliciously. These malicious Byzantine robots may be temporally or constantly controlled by an adversary. The scope is synchronized full information robot operations, where a robot that does not follow the program/policy of the swarm is immediately identified and can be remembered as Byzantine. As robots may be suspected of being Byzantine due to benign temporal malfunctions, it is imperative to forgive and forget, otherwise, a robot cannot assume collaborative actions with any other robot in the swarm. Still, remembering for a while may facilitate a policy of surrounding, isolating and freezing the movement of the misbehaving robots, by several robots, allowing the rest to perform the swarm task with no intervention. We demonstrate the need to periodically forgive and forget to realize swarm several tasks including patrolling/cleaning in the presence of possible Byzantine robots. The policy for achieving the task consists of blocking the movement of the Byzantine robot(s) by some of the robots, while the rest patrol/clean the plane.
引用
收藏
页数:15
相关论文
共 50 条
  • [21] Self-Stabilizing Robot Formations over Unreliable Networks
    Gilbert, Seth
    Lynch, Nancy
    Mitra, Sayan
    Nolte, Tina
    ACM TRANSACTIONS ON AUTONOMOUS AND ADAPTIVE SYSTEMS, 2009, 4 (03)
  • [22] Selfish Self-Stabilizing Approach to Maximal Independent Sets
    Yen, Li-Hsing
    Huang, Jean-Yao
    2015 IEEE TRUSTCOM/BIGDATASE/ISPA, VOL 3, 2015, : 9 - 16
  • [23] Optimal Memory Requirement for Self-stabilizing Token Circulation
    Min, Lelia
    Le Bouder, Gabriel
    Petit, Franck
    STRUCTURAL INFORMATION AND COMMUNICATION COMPLEXITY, SIROCCO 2024, 2024, 14662 : 101 - 118
  • [24] Self-Stabilizing Prefix Tree Based Overlay Networks
    Caron, Eddy
    Datta, Ajoy K.
    Petit, Franck
    Tedeschi, Cedric
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2016, 27 (05) : 607 - 630
  • [25] Towards automatic convergence verification of self-stabilizing algorithms
    Oehlerking, J
    Dhama, A
    Theel, O
    SELF-STABILIZING SYSTEMS, PROCEEDINGS, 2005, 3764 : 198 - 213
  • [26] A Note on the Parallel Runtime of Self-Stabilizing Graph Linearization
    Dominik Gall
    Riko Jacob
    Andrea Richa
    Christian Scheideler
    Stefan Schmid
    Hanjo Täubig
    Theory of Computing Systems, 2014, 55 : 110 - 135
  • [27] Fault-containing self-stabilizing distributed protocols
    Ghosh, Sukumar
    Gupta, Arobinda
    Herman, Ted
    Pemmaraju, Sriram V.
    DISTRIBUTED COMPUTING, 2007, 20 (01) : 53 - 73
  • [28] Designing Self-Stabilizing Systems Using Game Theory
    Yen, Li-Hsing
    Huang, Jean-Yao
    Turau, Volker
    ACM TRANSACTIONS ON AUTONOMOUS AND ADAPTIVE SYSTEMS, 2016, 11 (03)
  • [29] SMT-Based Synthesis of Distributed Self-Stabilizing Systems
    Faghih, Fathiyeh
    Bonakdarpour, Borzoo
    ACM TRANSACTIONS ON AUTONOMOUS AND ADAPTIVE SYSTEMS, 2015, 10 (03)
  • [30] Uniform and self-stabilizing token rings allowing unfair daemon
    Kakugawa, H
    Yamashita, M
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 1997, 8 (02) : 154 - 163