Finding a hider by an unknown deadline
Lin, Kyle Y.
Singham, Dashi I.
MetadataShow full item record
An object is hidden among several locations. Each search at the object's location independently finds the object with some location-dependent probability. The goal is to find the object by a deadline, but the deadline is unknown. Assuming the worst case scenario, where Nature knows the deadline and uses this knowledge to hide the object to hinder the search, this paper show that there is a randomized search strategy that simultaneously maximizes the probability of finding the object by any deadline.
Refereed Conference PaperThe article of record may be found at http://dx.doi.org/10.1016/j.orl.2015.11.003
Showing items related by title, author, creator and subject.
Lin, Kyle Y.; Singham, Dashi I. (Monterey, California. Naval Postgraduate School, 2015-11); NPS-OR-15-009In a classical search model, an object is hidden in one of many cells. Knowing the probability that the object is in each cell, a searcher wishes to find it. Each search in a cell incurs a cost and will discover the object ...
Pelkola, Ryan James (Monterey, California. Naval Postgraduate School, 2002-09);In December 1998, French and British leaders declared that the European Union (EU) must develop the capacity for autonomous military action to respond to international crises. In December 1999, EU leaders meeting in Helsinki ...
Gaver, Donald Paul (Monterey, California. Naval Postgraduate School, 2005-08-01); NPS-OR-05-007A time-critical military mission must be completed before a random deadline to be successful. The mission requires a number of Blue assets; the more assets that can be assembled before the deadline, the greater the possibility ...