Recommendations
- The beachcombers' problem: walking and searching with mobile robots
- The beachcombers' problem: walking and searching with mobile robots
- The beachcombers' problem: walking and searching from an inner point of a line
- Linear search by a pair of distinct-speed robots
- Optimal distributed searching in the plane with and without uncertainty
Cites work
- An annotated bibliography on guaranteed graph searching
- Boundary Patrolling by Mobile Agents with Distinct Maximal Speeds
- Collective tree exploration
- Competitive Online Approximation of the Optimal Search Ratio
- Exploring Unknown Environments
- Fast collaborative graph exploration
- Map construction of unknown graphs by multiple agents
- Network exploration by silent and oblivious robots
- On the linear search problem
- On utilizing speed in networks of mobile agents
- Online algorithms. The state of the art
- Online algorithms: a survey
- Online graph exploration algorithms for cycles and trees by multiple searchers
- Online searching with turn cost
- Searching in the plane
- The beachcombers' problem: walking and searching from an inner point of a line
- The beachcombers' problem: walking and searching with mobile robots
- The theory of search games and rendezvous.
- Worst-case optimal exploration of terrains with obstacles
Cited in
(3)
This page was built for publication: Beachcombing on strips and islands
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2285133)