Author:
Assaf David,Sharlin-Bilitzky Ariela
Abstract
An object is hidden in one of two boxes and occasionally moves between the boxes in accordance with some specified continuous-time Markov process. The objective is to find the object with a minimal expected cost. In this paper it is assumed that search efforts are unlimited. In addition to the search costs, the ‘real time' until the object is found is also taken into account in the cost structure. Our main results are that the optimal policy may consist of five regions and that the controls applied should be of the extreme 0 or ∞ type. The resulting expected cost compares favorably with that of the expected cost with bounded controls studied previously in the search literature.
Publisher
Cambridge University Press (CUP)
Subject
Statistics, Probability and Uncertainty,General Mathematics,Statistics and Probability
Reference23 articles.
1. Sharlin-Bilitzky A. (1990) Optimal Search for Static and Moving Targets. Doctoral Thesis, The Hebrew University, Jerusalem.
2. The Optimal Search for a Moving Target When the Search Path Is Constrained
3. Deterministic and Stochastic Optimal Control
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Search for a moving target in a competitive environment;International Journal of Game Theory;2021-02-17
2. On Maximum Discounted Effort Reward Search Problem;Asia-Pacific Journal of Operational Research;2016-06
3. Three problems in searching for a moving target between two sites;Acta Mathematica Scientia;2015-03
4. Obstacle Avoidance: Static Obstacles;Encyclopedia of Aerospace Engineering;2010-12-15
5. Collision Avoidance;Cooperative Path Planning of Unmanned Aerial Vehicles;2010-11-08