Search and rescue in the face of uncertain threats
Search and rescue in the face of uncertain threats
复制标题
面对不确定威胁的搜救
DOI：
10.1016/j.ejor.2020.02.029
复制
发表时间：
2020
影响因子：
6.4
通讯作者：
Lidbetter, Thomas
中科院分区：
文献类型：
--
作者：
Lidbetter, Thomas
我们考虑一个搜索问题，其中一个或多个目标必须由搜索方或搜索者营救。目标可能是一些自然灾害的幸存者，或被敌人关押的囚犯。目标隐藏在一组有限的位置中，但当搜索一个位置时，搜索有可能结束，可能是因为搜索者自己陷入困境，或者被对手捕获。如果这发生在所有目标都被恢复之前，那么救援尝试被认为是失败的。目标是找到最大化恢复所有目标的概率的搜索。我们提出并解决了这个问题的博弈论模型，将其放置在一个更一般的框架，包括另一个游戏之前介绍了作者。我们还考虑了一个扩展的游戏中的目标是隐藏在一个图的顶点。在只有一个目标的情况下，我们给出了一个在树上的对策解。
We consider a search problem in which one or more targets must be rescued by a search party, orSearcher. The targets may be survivors of some natural disaster, or prisoners held by an adversary. The targets are hidden among a finite set of locations, but when a location is searched, there is a known probability that the search will come to an end, perhaps because the Searcher becomes trapped herself, or is captured by the adversary. If this happens before all the targets have been recovered, then the rescue attempt is deemed a failure. The objective is to find the search that maximizes the probability of recovering all the targets. We present and solve a game theoretic model for this problem, by placing it in a more general framework that encompasses another game previously introduced by the author. We also consider an extension to the game in which the targets are hidden on the vertices of a graph. In the case that there is only one target, we give a solution of the game played on a tree.