Rendezvous search when marks are left at the starting points
Rendezvous search when marks are left at the starting points
复制标题
在起点留下标记时的集合点搜索
DOI：
10.1002/nav.1044
复制
发表时间：
2001
期刊：
影响因子：
--
通讯作者：
S. Gal
中科院分区：
文献类型：
--
作者：
V. Baston;S. Gal
在集合搜索问题中留下的标记可能会为玩家提供重要的信息。从问题到问题的两种情况都不同当玩家的初始距离通过未知的概率分布给出时，也可以在完整的图表上获得Markstart Rendezvous。
Leaving marks at the starting points in a rendezvous search problem may provide the players with important information. Many of the standard rendezvous search problems are investigated under this new framework which we call markstart rendezvous search. Somewhat surprisingly, the relative difficulties of analysing problems in the two scenarios differ from problem to problem. Symmetric rendezvous on the line seems to be more tractable in the new setting whereas asymmetric rendezvous on the line when the initial distance is chosen by means of a convex distribution appears easier to analyse in the original setting. Results are also obtained for markstart rendezvous on complete graphs and on the line when the players' initial distance is given by an unknown probability distribution. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 722–731, 2001