Abstract
The object is to detect a randomly moving target at one of the discrete times 0,1,…,τ. The searcher determines a non- negative effort distribution, ψ(x,t), such that the total effort applied at time t does not exceed m(t). Our purpose here is to establish an upper bound on the detection probability for every effort distribution. This is intended to supplement existing iterative procedures that develop sequences of effort distributions that improve monotonically.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Brown, S. S. [ 1980 ] Optimal Search for a Moving Target in Discrete Time and Space, Oper. Res. (to appear).
Stone, L. D., Brown, S. S., Buemi, R. P. & Hopkins, C. R. [ 1978 ] Numerical Optimization of Search for a Moving Target, Daniel H. Wagner, Associates Report to Office of Naval Research.
Washburn, A.R. [ 1979 ] “On Search for a Moving Target,” (submitted for publication).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1980 Plenum Press, New York
About this chapter
Cite this chapter
Washburn, A.R. (1980). Search for a Moving Target: Upper Bound on Detection Probability. In: Haley, K.B., Stone, L.D. (eds) Search Theory and Applications. NATO Conference Series, vol 8. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-9188-7_22
Download citation
DOI: https://doi.org/10.1007/978-1-4615-9188-7_22
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4615-9190-0
Online ISBN: 978-1-4615-9188-7
eBook Packages: Springer Book Archive