Rendezvous search: A personal perspective

被引：50
作者：
Alpern, S [1 ]
机构：
[1] London Sch Econ, Dept Math, London WC2A 2AE, England
来源：
OPERATIONS RESEARCH | 2002年 / 50卷 / 05期
关键词：
D O I：
10.1287/opre.50.5.772.363
中图分类号：
C93 [管理学];
学科分类号：
12 ; 1201 ; 1202 ; 120202 ;
摘要：
The rendezvous search problem was posed by the author 25 years 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.
引用
收藏
页码：772 / 795
页数：24
相关论文
共 59 条
[1]  
ALENIUNAS R, 1979, 20 ANN S FDN COMP SC, P218
[2]   Asymmetric rendezvous search on the circle [J].
Alpern, S .
DYNAMICS AND CONTROL, 2000, 10 (01) :33-45
[3]   Asymmetric rendezvous on the line is a double linear search problem [J].
Alpern, S ;
Beck, A .
MATHEMATICS OF OPERATIONS RESEARCH, 1999, 24 (03) :604-618
[4]   Pure strategy asymmetric rendezvous on the line with an unknown initial distance [J].
Alpern, S ;
Beck, A .
OPERATIONS RESEARCH, 2000, 48 (03) :498-501
[5]   The symmetric rendezvous-evasion game [J].
Alpern, S ;
Lim, WS .
SIAM JOURNAL ON CONTROL AND OPTIMIZATION, 1998, 36 (03) :948-959
[6]   Rendezvous search on the line with bounded resources: expected time minimization [J].
Alpern, S ;
Beck, A .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1997, 101 (03) :588-597
[7]   THE RENDEZVOUS SEARCH PROBLEM [J].
ALPERN, S .
SIAM JOURNAL ON CONTROL AND OPTIMIZATION, 1995, 33 (03) :673-683
[8]   RENDEZVOUS SEARCH ON THE LINE WITH DISTINGUISHABLE PLAYERS [J].
ALPERN, S ;
GAL, S .
SIAM JOURNAL ON CONTROL AND OPTIMIZATION, 1995, 33 (04) :1270-1276
[9]   Rendezvous search on the line with limited resources: Maximizing the probability of meeting [J].
Alpern, S ;
Beck, A .
OPERATIONS RESEARCH, 1999, 47 (06) :849-861
[10]  
Alpern S, 2000, GAME THEORY AND APPLICATIONS V, P1
123456