Optimal circle search despite the presence of faulty robots

DOI10.1016/j.ipl.2023.106391OpenAlexW4323659995MaRDI QIDQ6161451

Ioannis Papaioannou, Nikos Leonardos, Evangelos Kranakis, Konstantinos Georgiou, Aris Pagourtzis

Publication date: 5 June 2023

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2023.106391

zbMATH Keywords

fault tolerancewireless communicationcrash failuresByzantine adversaryrobot search

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

Algorithms for \(p\)-Faulty Search on a half-line

Cites Work

• Unnamed Item
• Searching in an unknown environment: An optimal randomized algorithm for the cow-path problem
• Searching in the plane
• 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
• On the linear search problem
• Evacuating Robots from a Disk Using Face-to-Face Communication (Extended Abstract)
• Search on a Line by Byzantine Robots
• Evacuating Robots via Unknown Exit in a Disk

This page was built for publication: Optimal circle search despite the presence of faulty robots