Byzantine fault tolerant symmetric-persistent circle evacuation

DOI10.1007/978-3-030-89240-1_8zbMath1498.68329OpenAlexW3205678351MaRDI QIDQ5918713

Ioannis Papaioannou, Aris Pagourtzis, Nikos Leonardos

Publication date: 24 June 2022

Published in: Algorithms for Sensor Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-89240-1_8

Mathematics Subject Classification ID

Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Artificial intelligence for robotics (68T40) Distributed algorithms (68W15)

Cites Work

• Searching in an unknown environment: An optimal randomized algorithm for the cow-path problem
• Theory of optimal search
• The theory of search games and rendezvous.
• Evacuation from a disc in the presence of a faulty robot
• Search on a line with faulty robots
• Online searching with turn cost
• Search on a Line by Byzantine Robots
• Evacuating Robots via Unknown Exit in a Disk
• Unnamed Item
• Unnamed Item

This page was built for publication: Byzantine fault tolerant symmetric-persistent circle evacuation