Better Upper Bounds for Searching on a Line with Byzantine Robots

DOI10.1007/978-3-030-41672-0_9zbMath1440.68024OpenAlexW3008945573MaRDI QIDQ3297827

Xiaoming Sun, Yu-An Sun, Jia-Lin Zhang

Publication date: 20 July 2020

Published in: Complexity and Approximation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-41672-0_9

zbMATH Keywords

competitive ratiomobile robotsparallel searchByzantine faultsearching on a line

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (1)

Overcoming probabilistic faults in disoriented linear search

Cites Work

• Unnamed Item
• Unnamed Item
• Searching in an unknown environment: An optimal randomized algorithm for the cow-path problem
• When patrolmen become corrupted: monitoring a graph using faulty mobile robots
• On the linear search problem
• More on the linear search problem
• Yet more on the linear search problem
• The return of the linear search problem
• The Polygon Exploration Problem
• The Byzantine Generals Problem
• Minimax Solutions for Linear Search Problems
• Search on a Line by Byzantine Robots
• Gathering Despite Mischief
• Rendezvous on a Line by Location-Aware Robots Despite the Presence of Byzantine Faults
• Group Search on the Line
• Lower Bounds for Searching Robots, some Faulty
• Search on a Line with Faulty Robots
• Lower bounds in on-line geometric searching
• Exploring unknown environments with obstacles

This page was built for publication: Better Upper Bounds for Searching on a Line with Byzantine Robots