Search on a line with faulty robots
From MaRDI portal
Publication:2010608
Recommendations
Cites work
- scientific article; zbMATH DE number 996442 (Why is no real title available?)
- scientific article; zbMATH DE number 1003229 (Why is no real title available?)
- scientific article; zbMATH DE number 819814 (Why is no real title available?)
- scientific article; zbMATH DE number 857072 (Why is no real title available?)
- An alternative solution to the “lost at sea” problem
- Collaborative search on the plane without communication
- Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems
- Convergence of Autonomous Mobile Robots with Inaccurate Sensors and Movements
- Distributed computation in dynamic networks
- Exploring Unknown Environments
- Exploring unknown environments with obstacles
- Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots
- Fault-Tolerant and Self-stabilizing Mobile Robots Gathering
- Gathering despite mischief
- Group search on the line
- How many oblivious robots can explore a line
- How to learn an unknown environment. I
- Lower bounds in on-line geometric searching
- On the linear search problem
- Online searching with turn cost
- Optimal Byzantine-resilient convergence in uni-dimensional robot networks
- Parallel searching in the plane
- Pursuit around a hole
- Revisiting the problem of searching on a line
- Search Theory
- Searching in the plane
- The Byzantine Generals Problem
- The gathering problem for two oblivious robots with unreliable compasses
- The polygon exploration problem
- The theory of search games and rendezvous.
- When patrolmen become corrupted: monitoring a graph using faulty mobile robots
- Yet more on the linear search problem
Cited in
(25)- Overcoming probabilistic faults in disoriented linear search
- Search and rescue on the line
- Search on a Line by Byzantine Robots
- Fault-induced dynamics of oblivious robots on a line
- Search on a line with faulty robots
- Linear search by a pair of distinct-speed robots
- Weighted online search
- Better upper bounds for searching on a line with Byzantine robots
- Overcoming probabilistic faults in disoriented linear search
- Group search of the plane with faulty robots
- A symbolic programming approach to the rendezvous search problem
- Finding defectives on a line by random docking and interval group tests
- Search on a line by Byzantine robots
- Optimal circle search despite the presence of faulty robots
- Online Parallel Heuristics and Robot Searching under the Competitive Framework
- On-line parallel heuristics, processor scheduling and robot searching under the competitive framework
- Optimal rendezvous on a line by location-aware robots in the presence of spies*
- Flood search under the California split rule.
- Lower bounds for searching robots, some faulty
- Lower bounds for shoreline searching with 2 or more robots
- Lower bounds for searching robots, some faulty
- Linear search by a pair of distinct-speed robots
- Byzantine fault tolerant symmetric-persistent circle evacuation
- Byzantine fault tolerant symmetric-persistent circle evacuation
- Fault-tolerant sequential scan
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)
