Skip to main content

Brief Announcement Forgive & Forget: Self-stabilizing Swarms in Spite of Byzantine Robots

  • Conference paper
  • First Online:
Stabilization, Safety, and Security of Distributed Systems (SSS 2019)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 11914))

  • 460 Accesses

Abstract

In this paper, 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 & Forget (F&F), 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 F&F 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.

This work was supported in part by JSPS KAKENHI No. 17K00019, 18K11167 and 19K11828, Frankel Center for Computer Science, Rita Altura Trust Chair in Computer Science, the Ministry of Science and Technology, Israel & JST SICORP (Grant#JPMJSC1806) and the German Research Funding Organization (DFG, Grant#8767581199).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    Note that, this paper includes only the simplest instance of the ring cleaning game, we considered more games (e.g., fan game) and details can be found in [1].

Reference

  1. Ashkenazi, Y., et al.: Forgive & Forget: self-stabilizing swarms in spite of Byzantine robots. Department of Computer Science BGU, Technical report #04-19 (2019). https://www.cs.bgu.ac.il/frankel/reports.html

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Shlomi Dolev .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Ashkenazi, Y., Dolev, S., Kamei, S., Ooshita, F., Wada, K. (2019). Brief Announcement Forgive & Forget: Self-stabilizing Swarms in Spite of Byzantine Robots. In: Ghaffari, M., Nesterenko, M., Tixeuil, S., Tucci, S., Yamauchi, Y. (eds) Stabilization, Safety, and Security of Distributed Systems. SSS 2019. Lecture Notes in Computer Science(), vol 11914. Springer, Cham. https://doi.org/10.1007/978-3-030-34992-9_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-34992-9_2

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-34991-2

  • Online ISBN: 978-3-030-34992-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics