Technical Report No.107 - Abstract

Mikael Hammar, Bengt J. Nilsson, Sven Schuierer
Parallel Searching on $m$ Rays

In this paper we investigate parallel searching on m concurrent rays. We assume that a target t is located somewhere on one of the rays and that a group of m point robots has to reach t. Furthermore, we assume that the robots have no way of communicating over distance. Given a strategy S we are interested in the competitive ratio which is defined as the ratio of the time needed by the robots using S and the time needed if the location of t is known in advance.