This Article Full Text (PDF) References Alert me when this article is cited Alert me if a correction is posted Services Email this article to a friend Similar articles in this journal Alert me to new issues of the journal Download to citation manager Citing Articles Citing Articles via HighWire Citing Articles via Google Scholar Google Scholar Articles by Alpern, S. Search for Related Content

Rendezvous Search: A Personal Perspective

Department of Mathematics, The London School of Economics, Houghton Street, London WC2A 2AE, United Kingdom
alpern{at}lse.ac.uk

The rendezvous-search problem was posed by the author 25years ago. In its basic form, it asks how two unit speed players can find each other in least expected time, when randomly placed in a known dark region. The problem received little attention until about 10 years ago. This article surveys the rapid progress that has been made since then, and also presents some new results.

Subject classifications: Search and surveillance: rendezvous search; Games/group decisions: teams.
History: Received September 2000; accepted April 2001.

This article has been cited by other articles:

				Q. Han, D. Du, J. Vera, and L. F. Zuluaga Improved Bounds for the Symmetric Rendezvous Value on the Line Operations Research, May 1, 2008; 56(3): 772 - 782. [Abstract] [PDF]

				S. Alpern and V. Baston Rendezvous on a Planar Lattice Operations Research, November 1, 2005; 53(6): 996 - 1006. [Abstract] [PDF]

				E. J. Chester and R. H. Tutuncu Rendezvous Search on the Labeled Line Operations Research, March 1, 2004; 52(2): 330 - 334. [Abstract] [PDF]