环上的搜索与救援博弈
The Search and Rescue Game on a Cycle
AI总结:
本文研究环图上的搜索与救援博弈,针对单目标与多目标、等与不等成功概率及连续模型,分别给出了自适应搜索者的完整解或近似最优解。
摘要:
我们考虑由第一作者最近提出的一种搜索与救援博弈。一个或多个静止的目标(例如受伤的徒步旅行者)隐藏在图上。由于假设地形危险,当搜索图的任意给定顶点时,搜索以一定概率结束;否则,以互补的成功概率继续搜索。搜索者的目标是找到所有目标,并使概率最大化。在此,我们专注于图为环的情况。在只有一个目标的情况下,我们求解了等成功概率的博弈,以及一类不等成功概率的博弈。对于多目标和等成功概率的情况,我们给出了自适应搜索者的解,以及非自适应搜索者在特殊情况下的解。我们还考虑了模型的连续版本,为自适应搜索者提供了完整解,并在非自适应情况下给出了近似最优解。
英文摘要:
We consider a search and rescue game introduced recently by the first author. An immobile target or targets (for example, injured hikers) are hidden on a graph. The terrain is assumed to dangerous, so that when any given vertex of the graph is searched, there is a certain probability that the search will come to an end, otherwise with the complementary {\em success probability} the search can continue. A Searcher searches the graph with the aim of finding all the targets with maximum probability. Here, we focus on the game in the case that the graph is a cycle. In the case that there is only one target, we solve the game for equal success probabilities, and for a class of games with unequal success probabilities. For multiple targets and equal success probabilities, we give a solution for an adaptive Searcher and a solution in a special case for a non-adaptive Searcher. We also consider a continuous version of the model, giving a full solution for an adaptive Searcher and approximately optimal solutions in the non-adaptive case.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。