The Beachcombers' Problem: Walking and searching with mobile robots
- Czyzowicz, J. (Jurek)
- Gasieniec, L. (Leszek)
- Georgiou, K. (Konstantinos)
- Kranakis, E. (Evangelos)
- MacQuarrie, F. (Fraser)
DOIAbstract
We introduce and study a new problem concerning the exploration of a geometric domain by mobile robots. Consider a line segment [0,I] and a set of n mobile robots r1,r2,. .,rn placed at one of its endpoints. Each robot has a searching speed si and a walking speed wi, where si<wi. We assume that every robot is aware of the number of robots of the collection and their corresponding speeds.At each time moment a robot ri either walks along a portion of the segment not exceeding its walking speed wi, or it searches a portion of the segment with speed not exceeding si. A search of segment [0,I] is completed at the time when each of its points have been searched by at least one of the n robots. We want to develop efficient mobility schedules (algo...
Add to ORKG