Two point one sided rendezvous

In a rendezvous search two or more teams called seekers try to minimize the time needed to find each other. In this paper, we consider two seekers in the plane. This is a one sided problem since Seeker 1 begins at a predetermined point O. Seeker 2 begins at one of a finite set of points xi with probability pi. We first discuss the general situation and then consider the specific case when Seeker 2 can begin from one of two points.

[1]  Sándor P. Fekete,et al.  Two Dimensional Rendezvous Search , 2001, Oper. Res..

[2]  Steve Alpern,et al.  Rendezvous on a Planar Lattice , 2005, Oper. Res..

[3]  V. J. Baston.  Note : Two rendezvous search problems on the line , 1999 .

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

[5]  Steve Alpern,et al.  A common notion of clockwise can help in planar rendezvous , 2006, Eur. J. Oper. Res..