Linear Search by a Pair of Distinct-Speed Robots
Résumé
Two mobile robots are initially placed at the same point on an infinite line. Each robot may move on the line in either direction not exceeding its maximal speed. The robots need to find a stationary target placed at an unknown location on the line. The search is completed when both robots arrive at the target point. The target is discovered at the moment when either robot arrives at its position. The robot knowing the placement of the target may communicate it to the other robot. We look for the algorithm with the shortest possible search time (i.e.~the worst-case time at which both robots meet at the target) measured as a function of the target distance from the origin (i.e.~the time required to travel directly from the starting point to the target at unit velocity).
We consider two standard models of communication between the robots, namely {\em wireless communication} and {\em communication by meeting}. In the case of communication by meeting, a robot learns about the target while sharing the same location with a robot possessing this knowledge. We propose here an optimal search strategy for two robots including the respective lower bound argument, for the full spectrum of their maximal speeds. This extends the main result of Chrobak et al. (SOFSEM 2015) referring to the exact complexity of the problem for the case when the speed of the slower robot is at least one third of the faster one. In the wireless communication model, a message sent by one robot is
instantly received by the other robot, regardless of their current positions on the line. For this model, we design a strategy which is optimal whenever the faster robot is at most $\sqrt{17}+4\approx 8.123$ times faster than the slower one. We also prove that otherwise the wireless communication offers no advantage over communication by meeting.
Fichier principal
Bampas2019_Article_LinearSearchByAPairOfDistinct-.pdf (781.82 Ko)
Télécharger le fichier
Origine : Accord explicite pour ce dépôt