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

被引:1
|
作者
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 条
  • [1] FORGIVE & FORGET Self-Stabilizing Swarms in Spite of Byzantine Robots
    Ashkenazi, Yotam
    Dolev, Shlomi
    Kamei, Sayaka
    Ooshita, Fukuhito
    Wada, Koichi
    2019 SEVENTH INTERNATIONAL SYMPOSIUM ON COMPUTING AND NETWORKING WORKSHOPS (CANDARW 2019), 2019, : 188 - 194
  • [2] Brief Announcement Forgive & Forget: Self-stabilizing Swarms in Spite of Byzantine Robots
    Ashkenazi, Yotam
    Dolev, Shlomi
    Kamei, Sayaka
    Ooshita, Fukuhito
    Wada, Koichi
    STABILIZATION, SAFETY, AND SECURITY OF DISTRIBUTED SYSTEMS, SSS 2019, 2019, 11914 : 16 - 21
  • [3] Self-stabilizing efficient hosts in spite of Byzantine guests
    Dolev S.
    Yagel R.
    Operating Systems Review (ACM), 2010, 44 (03): : 65 - 74
  • [4] Location functions for self-stabilizing byzantine tolerant swarms
    Ashkenazi, Yotam
    Dolev, Shlomi
    Kamei, Sayaka
    Katayama, Yoshiaki
    Ooshita, Fukuhito
    Wada, Koichi
    THEORETICAL COMPUTER SCIENCE, 2023, 954
  • [5] Stabilizing trust and reputation for self-stabilizing efficient hosts in spite of Byzantine guests
    Dolev, Shlomi
    Yagel, Reuven
    STABILIZATION, SAFETY, AND SECURITY OF DISTRIBUTED SYSTEMS, PROCEEDINGS, 2007, 4838 : 266 - +
  • [6] Self-Stabilizing Byzantine Broadcast
    Maurer, Alexandre
    Tixeuil, Sebastien
    2014 IEEE 33RD INTERNATIONAL SYMPOSIUM ON RELIABLE DISTRIBUTED SYSTEMS (SRDS), 2014, : 152 - 160
  • [7] Self-stabilizing gathering of mobile robots under crash or Byzantine faults
    Defago, Xavier
    Potop-Butucaru, Maria
    Raipin-Parvedy, Philippe
    DISTRIBUTED COMPUTING, 2020, 33 (05) : 393 - 421
  • [8] Self-stabilizing gathering of mobile robots under crash or Byzantine faults
    Xavier Défago
    Maria Potop-Butucaru
    Philippe Raipin-Parvédy
    Distributed Computing, 2020, 33 : 393 - 421
  • [9] SELF-STABILIZING SYSTEMS IN SPITE OF DISTRIBUTED CONTROL
    DIJKSTRA, EW
    COMMUNICATIONS OF THE ACM, 1974, 17 (11) : 643 - 644
  • [10] Self-Stabilizing Task Allocation In Spite of Noise
    Dornhaus, Anna
    Lynch, Nancy
    Mallmann-Trenn, Frederik
    Pajak, Dominik
    Radeva, Tsvetomira
    PROCEEDINGS OF THE 32ND ACM SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURES (SPAA '20), 2020, : 201 - 211