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 条
[41]   Systematic Correct Construction of Self-stabilizing Systems: A Case Study [J].
Basu, Ananda ;
Bonakdarpour, Borzoo ;
Bozga, Marius ;
Sifakis, Joseph .
STABILIZATION, SAFETY, AND SECURITY OF DISTRIBUTED SYSTEMS, 2010, 6366 :4-+
[42]   SELFSIM: A Discrete-Event Simulator for Distributed Self-Stabilizing Algorithms [J].
Evcimen, Huseyin Tolga ;
Arapoglu, Ozkan ;
Dagdeviren, Orhan .
2018 INTERNATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE AND DATA PROCESSING (IDAP), 2018,
[43]   Silent Self-Stabilizing Scheme for Spanning-Tree-like Constructions [J].
Devismes, Stephane ;
Ilcinkas, David ;
Johnen, Colette .
ICDCN '19: PROCEEDINGS OF THE 2019 INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING AND NETWORKING, 2019, :158-167
[44]   Self-stabilizing algorithms for minimal global powerful alliance sets in graphs [J].
Yahiaoui, Said ;
Belhoul, Yacine ;
Haddad, Mohammed ;
Kheddouci, Hamamache .
INFORMATION PROCESSING LETTERS, 2013, 113 (10-11) :365-370
[45]   Optimized Silent Self-Stabilizing Scheme for Tree-Based Constructions [J].
Stéphane Devismes ;
David Ilcinkas ;
Colette Johnen .
Algorithmica, 2022, 84 :85-123
[47]   Self-stabilizing Algorithms for Connected Vertex Cover and Clique Decomposition Problems [J].
Delbot, Francois ;
Laforest, Christian ;
Rovedakis, Stephane .
PRINCIPLES OF DISTRIBUTED SYSTEMS, OPODIS 2014, 2014, 8878 :307-322
[48]   Optimized Silent Self-Stabilizing Scheme for Tree-Based Constructions [J].
Devismes, Stephane ;
Ilcinkas, David ;
Johnen, Colette .
ALGORITHMICA, 2022, 84 (01) :85-123
[49]   A self-stabilizing algorithm for constructing weakly connected minimal dominating sets [J].
Turau, Volker ;
Hauck, Bernd .
INFORMATION PROCESSING LETTERS, 2009, 109 (14) :763-767
[50]   Self-stabilizing Algorithm for Generic Aggregated Weighted Connected Dominating Set [J].
Bessaoud, Karim .
AD HOC & SENSOR WIRELESS NETWORKS, 2019, 45 (1-2) :117-138