The beachcombers' problem: Walking and searching with mobile robots
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 r 1,r 2,⋯, r n placed at one of its endpoints. Each robot has a searching speed s i and a walking speed w i, where s i <w i . 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 r i either walks along a portion of the segment not exceeding its walking speed w i, or it searches a portion of the segment with speed not exceeding s i . 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 (algorithms) for the robots which complete the search of the segment as fast as possible. More exactly we want to maximize the speed of the mobility schedule (equal to the ratio of the segment length versus the time of the completion of the schedule). We analyze first the offline scenario when the robots know the length of the segment that is to be searched. We give an algorithm producing a mobility schedule for arbitrary walking and searching speeds and prove its optimality. Then we propose an online algorithm, when the robots do not know in advance the actual length of the segment to be searched. The speed S of such algorithm is defined as where S(I L ) denotes the speed of searching of segment I L =[0,L]. We prove that the proposed online algorithm is 2-competitive. The competitive ratio is shown to be better in the case when the robots' walking speeds are all the same, approaching 1.29843 as n goes to infinity.
|Keywords||Algorithm, Mobile Robots, On-line, Schedule, Searching, Segment, Speed, Walking|
Czyzowicz, J. (Jurek), Ga̧sieniec, L. (Leszek), Georgiou, K. (Konstantinos), Kranakis, E, & MacQuarrie, F. (Fraser). (2014). The beachcombers' problem: Walking and searching with mobile robots. doi:10.1007/978-3-319-09620-9_4