Asymmetric rendezvous on the plane

Wo consider rendezvous problems in which two players move on Ihe plane and wish to cooperate in order to minimise their firat meeting time. We begin by considering the case when they know that they are a distance d apart, but they do not know the direction in which they should travel. We alao conoider a situation in which player 1 knows the initial position of player 2, while player 2 is only given information on the initial distance of player 1. Finally we give some reaulls for the case where one of the players is placed at an initial position chosen equiprobably from a finite set of pointn,

[1]  B. Gluss.  The minimax path in a search for a circle in a plane , 1961 .

[2]  Steve Alpern,et al.  Rendezvous Search on the Line with More Than Two Players , 1997, Oper. Res..

[3]  Jon M. Kleinberg,et al.  An improved approximation ratio for the minimum latency problem , 1996, SODA '96.

[4]  E. Anderson,et al.  Rendezvous Search on the Line with Indistinguishable Players , 1995 .

[5]  J. Troutman.  Variational Calculus with Elementary Convexity , 1983 .

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

[7]  Steve Alpern,et al.  Rendezvous Search on the Line with Limited Resources: Maximizing the Probability of Meeting , 1999, Oper. Res..

[8]  Steve Alpern,et al.  Alternating Search at Two Locations , 2000 .

[9]  T. Schelling,et al.  The Strategy of Conflict. , 1961 .

[10]  Steve Alpern,et al.  The Symmetric Rendezvous-Evasion Game , 1998 .

[11]  Shmuel Gal.  Rendezvous Search on the Line , 1999, Oper. Res..

[12]  D. Newman,et al.  Yet more on the linear search problem , 1970 .

[13]  S. Alpern.  The Rendezvous Search Problem , 1995 .

[14]  T. Schelling.  The Strategy of Conflict , 1963 .

[15]  Richard Weber,et al.  The rendezvous problem on discrete locations , 1990, Journal of Applied Probability.

[16]  Sanjeev Arora,et al.  Polynomial time approximation schemes for Euclidean TSP and other geometric problems , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

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

[18]  Esther M. Arkin,et al.  The Lawnmower Problem , 1993, Canadian Conference on Computational Geometry.

[19]  Madhu Sudan,et al.  The minimum latency problem , 1994, STOC '94.

[20]  Joseph S. B. Mitchell,et al.  Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems , 1999, SIAM J. Comput..

[21]  S. Gal,et al.  Rendezvous Search on the Line With Distinguishable Players , 1995 .

[22]  Frederick Mosteller,et al.  Fifty Challenging Problems in Probability with Solutions , 1987 .

[23]  J. V. Howard.  Rendezvous Search on the Interval and the Circle , 1999, Oper. Res..

[24]  Esther M. Arkin,et al.  Angewandte Mathematik Und Informatik Universit at Zu K Oln Approximation Algorithms for Lawn Mowing and Milling Ss Andor P.fekete Center for Parallel Computing Universitt at Zu Kk Oln D{50923 Kk Oln Germany Approximation Algorithms for Lawn Mowing and Milling , 2022 .