Search on a line with faulty robots
DOI10.1007/S00446-017-0296-0zbMATH Open1440.68321OpenAlexW2592393897MaRDI QIDQ2010608FDOQ2010608
Authors: Evangelos Kranakis, D. Krizanc, Lata Narayanan, Jaroslav Opatrny, 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
Recommendations
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Reliability, testing and fault tolerance of networks and computer systems (68M15) Parallel algorithms in computer science (68W10) Distributed systems (68M14)
Cites Work
- Searching in the plane
- The theory of search games and rendezvous.
- Title not available (Why is that?)
- Convergence of Autonomous Mobile Robots with Inaccurate Sensors and Movements
- Gathering despite mischief
- Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems
- Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots
- Distributed computation in dynamic networks
- How to learn an unknown environment. I
- Title not available (Why is that?)
- The polygon exploration problem
- The Byzantine Generals Problem
- Title not available (Why is that?)
- Search Theory
- Collaborative search on the plane without communication
- Exploring Unknown Environments
- Exploring unknown environments with obstacles
- How many oblivious robots can explore a line
- Optimal Byzantine-resilient convergence in uni-dimensional robot networks
- Fault-Tolerant and Self-stabilizing Mobile Robots Gathering
- Lower bounds in on-line geometric searching
- Online searching with turn cost
- On the linear search problem
- Yet more on the linear search problem
- Title not available (Why is that?)
- The gathering problem for two oblivious robots with unreliable compasses
- Parallel searching in the plane
- Group search on the line
- Pursuit around a hole
- Revisiting the problem of searching on a line
- An alternative solution to the “lost at sea” problem
- When patrolmen become corrupted: monitoring a graph using faulty mobile robots
Cited In (25)
- Group search of the plane with faulty robots
- Finding defectives on a line by random docking and interval group tests
- Fault-tolerant sequential scan
- Overcoming probabilistic faults in disoriented linear search
- Search and rescue on the line
- A symbolic programming approach to the rendezvous search problem
- Search on a line by Byzantine robots
- Linear search by a pair of distinct-speed robots
- Flood search under the California split rule.
- Search on a line with faulty robots
- Optimal circle search despite the presence of faulty robots
- Overcoming probabilistic faults in disoriented linear search
- Lower bounds for shoreline searching with 2 or more robots
- Weighted online search
- Byzantine fault tolerant symmetric-persistent circle evacuation
- Byzantine fault tolerant symmetric-persistent circle evacuation
- Linear search by a pair of distinct-speed robots
- Optimal rendezvous on a line by location-aware robots in the presence of spies*
- Fault-induced dynamics of oblivious robots on a line
- On-line parallel heuristics, processor scheduling and robot searching under the competitive framework
- Search on a Line by Byzantine Robots
- Online Parallel Heuristics and Robot Searching under the Competitive Framework
- Better upper bounds for searching on a line with Byzantine robots
- Lower bounds for searching robots, some faulty
- Lower bounds for searching robots, some faulty
This page was built for publication: Search on a line with faulty robots
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2010608)
