Rendezvous search on the labeled line
成果类型：
Article
署名作者：
Chester, EJ; Tütüncü, RH
署名单位：
University of California System; University of California Berkeley; Carnegie Mellon University
刊物名称：
OPERATIONS RESEARCH
ISSN/ISSBN：
0030-364X
DOI：
10.1287/opre.1030.0085
发表日期：
2004
页码：
330-334
关键词：
摘要：
The rendezvous search problem is the problem of finding optimal search strategies for two people who are placed randomly on a known search region and want to meet each other in minimal expected time. We focus on initial location distributions that are centrally symmetric and nonincreasing as one moves away from the center, including the discretized and/or truncated Gaussian densities. When the search region is a discrete or a continuous interval, and the interval is labeled so that the searchers know their own location at all times, we prove that the optimal strategy for both searchers is to go directly to the center and wait there. The same result also holds for rendezvous search on the infinite line.