The Library
Optimal trade-off between speed and acuity when searching for a small object
Tools
Tools
Tools
Alpern, Steve and Lidbetter, Thomas (2015) Optimal trade-off between speed and acuity when searching for a small object. Operations Research, 63 (1). pp. 122-133. doi:10.1287/opre.2014.1331
Research output not available from this repository.
Request-a-Copy directly from author or use local Library Get it For Me service.
Official URL: http://dx.doi.org/10.1287/opre.2014.1331
Abstract
A Searcher seeks to find a stationary Hider located at some point H (not necessarily a node) on a given network Q. The Searcher can move along the network from a given starting point at unit speed, but to actually find the Hider she must pass it while moving at a fixed slower speed (which may depend on the arc). In this “bimodal search game,” the payoff is the first time the Searcher passes the Hider while moving at her slow speed. This game models the search for a small or well hidden object (e.g., a contact lens, improvised explosive device, predator search for camouflaged prey). We define a bimodal Chinese postman tour as a tour of minimum time δ which traverses every point of every arc at least once in the slow mode. For trees and weakly Eulerian networks (networks containing a number of disjoint Eulerian cycles connected in a tree-like fashion) the value of the bimodal search game is δ/2. For trees, the optimal Hider strategy has full support on the network. This differs from traditional search games, where it is optimal for him to hide only at leaf nodes. We then consider the notion of a lucky Searcher who can also detect the Hider with a positive probability q even when passing him at her fast speed. This paper has particular importance for demining problems.
| Item Type: | Journal Article | ||||||||
|---|---|---|---|---|---|---|---|---|---|
| Divisions: | Faculty of Social Sciences > Warwick Business School > Operational Research & Management Sciences Faculty of Social Sciences > Warwick Business School |
||||||||
| Journal or Publication Title: | Operations Research | ||||||||
| Publisher: | Institute for Operations Research and the Management Sciences (I N F O R M S) | ||||||||
| ISSN: | 0030-364X | ||||||||
| Official Date: | 19 January 2015 | ||||||||
| Dates: |
|
||||||||
| Volume: | 63 | ||||||||
| Number: | 1 | ||||||||
| Page Range: | pp. 122-133 | ||||||||
| DOI: | 10.1287/opre.2014.1331 | ||||||||
| Status: | Peer Reviewed | ||||||||
| Publication Status: | Published | ||||||||
| Access rights to Published version: | Restricted or Subscription Access |
Request changes or add full text files to a record
Repository staff actions (login required)
 |
View Item |
