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 S = inf I L ? S ( I L ) 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.

[1]  Xiaotie Deng,et al.  How to learn an unknown environment , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[2]  Mary Jane Irwin,et al.  Optimizing sensor movement planning for energy efficiency , 2011, ISLPED '05. Proceedings of the 2005 International Symposium on Low Power Electronics and Design, 2005..

[3]  Bernard Mans,et al.  Network Exploration by Silent and Oblivious Robots , 2010, WG.

[4]  R. Bellman.  An Optimal Search , 1963 .

[5]  Adrian Kosowski,et al.  Fast Collaborative Graph Exploration , 2013, ICALP.

[6]  Jean-Sébastien Sereni,et al.  Collaborative search on the plane without communication , 2012, PODC '12.

[7]  Shay Kutten,et al.  On utilizing speed in networks of mobile agents , 2010, PODC '10.

[8]  Konstantinos Georgiou,et al.  The Beachcombers' Problem: Walking and Searching with Mobile Robots , 2013, SIROCCO.

[9]  A. Beck.  On the linear search problem , 1964 .

[10]  Adrian Kosowski,et al.  Fast Collaborative Graph Exploration , 2013, ICALP.

[11]  Piotr Berman,et al.  On-line Searching and Navigation , 1996, Online Algorithms.

[12]  Mary Jane Irwin,et al.  Optimizing sensor movement planning for energy efficiency , 2005, ISLPED '05.

[13]  Alejandro López-Ortiz,et al.  Multi-target ray searching problems , 2011, Theor. Comput. Sci..

[14]  Dimitrios M. Thilikos,et al.  An annotated bibliography on guaranteed graph searching , 2008, Theor. Comput. Sci..

[15]  Konstantinos Georgiou,et al.  The Multi-source Beachcombers' Problem , 2014, ALGOSENSORS.

[16]  Ming-Yang Kao,et al.  Searching in an unknown environment: an optimal randomized algorithm for the cow-path problem , 1996, SODA '93.

[17]  Susanne Albers,et al.  Online algorithms: a survey , 2003, Math. Program..

[18]  Rudolf Fleischer,et al.  Competitive Online Approximation of the Optimal Search Ratio , 2008, SIAM J. Comput..

[19]  Ming-Yang Kao,et al.  Algorithms for Informed Cows , 1997 .

[20]  Sundar Vishwanathan,et al.  Competitive Algorithms for Layered Graph Traversal , 1998, SIAM J. Comput..

[21]  Mihalis Yannakakis,et al.  Shortest Paths Without a Map , 1989, Theor. Comput. Sci..

[22]  Shmuel Gal,et al.  The theory of search games and rendezvous , 2002, International series in operations research and management science.

[23]  Xiaotie Deng,et al.  How to learn an unknown environment. I: the rectilinear case , 1998, JACM.

[24]  Nicola Santoro,et al.  Map construction of unknown graphs by multiple agents , 2007, Theor. Comput. Sci..

[25]  Susanne Albers,et al.  Exploring Unknown Environments , 2000, SIAM J. Comput..

[26]  Erik D. Demaine,et al.  Online searching with turn cost , 2004, Theor. Comput. Sci..

[27]  C. Papadimitriou,et al.  Exploring an unknown graph , 1999 .

[28]  Akitoshi Kawamura,et al.  Fence patrolling by mobile agents with distinct speeds , 2014, Distributed Computing.

[29]  Wallace Franck,et al.  On the optimal search problem , 1965 .

[30]  Susanne Albers,et al.  Online Algorithms - What Is It Worth to Know the Future? , 2011, Algorithms Unplugged.

[31]  Andrzej Pelc,et al.  Worst-case optimal exploration of terrains with obstacles , 2013, Inf. Comput..

[32]  Ricardo A. Baeza-Yates,et al.  Searching in the Plane , 1993, Inf. Comput..

[33]  Stefan Langerman,et al.  Online graph exploration algorithms for cycles and trees by multiple searchers , 2012, Journal of Combinatorial Optimization.

[34]  Jurek Czyzowicz,et al.  Boundary Patrolling by Mobile Agents with Distinct Maximal Speeds , 2011, ESA.

[35]  L. Stone.  Theory of Optimal Search , 1975 .