Search on a line with faulty robots

DOI10.1007/s00446-017-0296-0zbMath1440.68321OpenAlexW2592393897MaRDI QIDQ2010608

Danny Krizanc, Evangelos Kranakis, Jaroslav Opatrny, Lata Narayanan, Jurek Czyzowicz

Publication date: 27 November 2019

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00446-017-0296-0

zbMATH Keywords

competitive ratiofaulty robotscow-path problemsearch on a line

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (7)

A symbolic programming approach to the rendezvous search problem ⋮ Weighted online search ⋮ Search and rescue on the line ⋮ Overcoming probabilistic faults in disoriented linear search ⋮ Optimal circle search despite the presence of faulty robots ⋮ Byzantine fault tolerant symmetric-persistent circle evacuation ⋮ Byzantine fault tolerant symmetric-persistent circle evacuation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Searching in the plane
• Optimal Byzantine-resilient convergence in uni-dimensional robot networks
• The theory of search games and rendezvous.
• Parallel searching in the plane
• How many oblivious robots can explore a line
• Online searching with turn cost
• On the linear search problem
• Yet more on the linear search problem
• The Polygon Exploration Problem
• Revisiting the Problem of Searching on a Line
• Distributed computation in dynamic networks
• The Gathering Problem for Two Oblivious Robots with Unreliable Compasses
• Collaborative search on the plane without communication
• An alternative solution to the “lost at sea” problem
• When Patrolmen Become Corrupted: Monitoring a Graph Using Faulty Mobile Robots
• Fault-Tolerant and Self-stabilizing Mobile Robots Gathering
• Convergence of Autonomous Mobile Robots with Inaccurate Sensors and Movements
• How to learn an unknown environment. I
• The Byzantine Generals Problem
• Search Theory
• Exploring Unknown Environments
• Gathering Despite Mischief
• Group Search on the Line
• Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems
• Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots
• Pursuit around a hole
• Lower bounds in on-line geometric searching
• Exploring unknown environments with obstacles

This page was built for publication: Search on a line with faulty robots