Rendezvous search on the line

Rendezvous search on the line

0.00 Avg rating0 Votes
Article ID: iaor20011330
Country: United States
Volume: 47
Issue: 6
Start Page Number: 974
End Page Number: 976
Publication Date: Nov 1999
Journal: Operations Research
Authors:
Keywords: military & defence
Abstract:

We present two new results for the asymmetric rendezvous problem on the line. We first show that it is never optimal for one player to be stationary during the entire search period in the two-player rendezvous. Then we consider the meeting time of n-players in the worst case and show that it has an asymptotic behavior of n/2 + O(log n).

Reviews

Required fields are marked *. Your email address will not be published.