Recommendations
Cited in
(44)- Evacuating two robots from multiple unknown exits in a circle
- Linear search by a pair of distinct-speed robots
- Search on a line with faulty robots
- Weighted group search on a line (extended abstract)
- Weighted group search on a line \& implications to the priority evacuation problem
- A symbolic programming approach to the rendezvous search problem
- Further connections between contract-scheduling and ray-searching problems
- Evacuating from \(\ell_p\) unit disks in the wireless model (extended abstract)
- Evacuating equilateral triangles and squares in the face-to-face model
- Priority evacuation from a disk: the case of \(n \geq 4\)
- A tight lower bound for semi-synchronous collaborative grid exploration
- Treasure evacuation with one robot on a disk
- Search-and-rescue rendezvous
- Group search of the plane with faulty robots
- Evacuating from \(\ell_p\) unit disks in the wireless model
- The beachcombers' problem: walking and searching from an inner point of a line
- Linear search by a pair of distinct-speed robots
- Distributed Evacuation in Graphs with Multiple Exits
- Better upper bounds for searching on a line with Byzantine robots
- Evacuating an equilateral triangle in the face-to-face model
- Rendezvous Search on the Line
- scientific article; zbMATH DE number 808814 (Why is no real title available?)
- Querying with Uncertainty
- A tight lower bound for semi-synchronous collaborative grid exploration
- Linear rendezvous with asymmetric clocks
- Energy consumption of group search on a line
- Exploration of High-Dimensional Grids by Finite Automata
- Collaboration without communication: evacuating two robots from a disk
- Linear Search with Terrain-Dependent Speeds
- Wireless evacuation on \(m\) rays with \(k\) searchers
- Search on a Line by Byzantine Robots
- Search and rescue on the line
- Overcoming probabilistic faults in disoriented linear search
- Exploration of High-Dimensional Grids by Finite State Machines
- Evacuation of equilateral triangles by mobile agents of limited communication range
- Overcoming probabilistic faults in disoriented linear search
- Capturing a moving target by two robots in the F2F model
- The power of knowledge in linear search for an escaping target
- Bike-assisted evacuation of robots on a line with asymmetric S/R communication
- Weighted group search on the disk \& improved lower bounds for priority evacuation
- Discrete evacuation in graphs with multiple exits
- Linear search for an escaping target with unknown speed
- Weighted group search on the disk and improved LP-based lower bounds for priority evacuation
- Bike assisted evacuation on a line
This page was built for publication: Group search on the line
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5175102)
