### Abstract

We investigate the problem in which an agent has to find an object that moves between two locations according to a discrete markov process (pollock, operat res 18 (1970) 883–903). At every period, the agent has three options: searching left, searching right, and waiting. We assume that waiting is costless whereas searching is costly. Moreover, when the agent searches the location that contains the object, he finds it with probability 1 (i.e. There is no overlooking). Waiting can be useful because it could induce a more favorable probability distribution over the two locations next period. We find an essentially unique (nearly) optimal strategy, and prove that it is characterized by two thresholds (as conjectured by weber, j appl probab 23 (1986) 708–717). We show, moreover, that it can never be optimal to search the location with the lower probability of containing the object. The latter result is far from obvious and is in clear contrast with the example in ross (1983) for the model without waiting.

Original language | English |
---|---|

Pages (from-to) | 526-539 |

Number of pages | 14 |

Journal | Naval Research Logistics |

Volume | 56 |

DOIs | |

Publication status | Published - 1 Jan 2009 |

## Cite this

Flesch, J., Perea ý Monsuwé, A., & Karagozoglu, E. (2009). Optimal search for a moving target with the option to wait.

*Naval Research Logistics*,*56*, 526-539. https://doi.org/10.1002/nav.20359