Rendezvous on a Planar Lattice

References

• Alpern S. The rendezvous search problem. SIAM J. Control Optim. (1995) 33:673–683Crossref, Google Scholar
• Alpern S. Rendezvous search: A personal perspective. Oper. Res. (2002a) 50(5):772–795Link, Google Scholar
• Alpern S. Rendezvous search on labelled graphs. Naval Res. Logist. (2002b) 49:256–274Crossref, Google Scholar
• Alpern S., Baston V. A common notion of clockwise can help in planar rendezvous. Eur. J. Oper. Res. (2005) . Forthcoming. Published online August 2005Google Scholar
• Alpern S., Baston V. Rendezvous in higher dimensions. SIAM J. Control Optim. (2006) . ForthcomingCrossref, Google Scholar
• Alpern S., Gal S. Rendezvous search on the line with distinguishable players. SIAM J. Control Optim. (1995) 33:1270–1276Crossref, Google Scholar
• Alpern S., Gal S.The Theory of Search Games and Rendezvous (2003) 55(Kluwer Academic Publishers, Boston, MA) . International Series in Operations Research and Management ScienceGoogle Scholar
• Anderson E. J., Fekete S. Two-dimensional rendezvous search. Oper. Res. (2001) 49:107–118Link, Google Scholar
• Baston V. J. Two rendezvous search problems on the line. Naval Res. Logist. (1999) 46:335–340Crossref, Google Scholar
• Baston V. J., Gal S. Rendezvous on the line when the players’ initial distance is given by an unknown probability distribution. SIAM J. Control Optim. (1998) 36(6):1880–1889Crossref, Google Scholar
• Gal S. Rendezvous search on the line. Oper. Res. (1999) 47:974–976Link, Google Scholar
• Howard J. V. Rendezvous search on the interval and circle. Oper. Res. (1999) 47(4):550–558Link, Google Scholar
• Thomas L. C., Hulme P. B. Searching for targets who want to be found. J. Oper. Res. Soc. (1997) 48(1):44–50Crossref, Google Scholar