4.5 Article

Fast or Slow: Search in Discrete Locations with Two Search Modes

期刊

OPERATIONS RESEARCH
卷 68, 期 2, 页码 552-571

出版社

INFORMS
DOI: 10.1287/opre.2019.1870

关键词

Bayesian updating; Gittins index; optimal search; speed-accuracy trade-off; stochastic coupling; threshold-type policy

资金

  1. Engineering and Physical Sciences Research Council STOR-i Centre for Doctoral Training [EP/L015692/1]

向作者/读者索取更多资源

An object is hidden in one of several discrete locations according to some known probability distribution, and the goal is to discover the object in the minimum expected time by successive searches of individual locations. If there is only one way to search each location, this search problem is solved using Gittins indices. Motivated by modern search technology, we extend earlier work to allow two modes-fast and slow-to search each location. The fast mode takes less time, but the slow mode is more likely to find the object. An optimal policy is difficult to obtain in general, because it requires an optimal sequence of search modes for each location in addition to a set of sequence-dependent Gittins indices for choosing between locations. Our analysis begins by-for each mode-identifying a sufficient condition for a location to use only that search mode in an optimal policy. For locations meeting neither sufficient condition, an optimal choice of search mode is extremely complicated, depending on both the probability distribution of the object's hiding location and the search parameters of the other locations. We propose several heuristic policies motivated by our analysis and demonstrate their near-optimal performance in an extensive numerical study.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.5
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据