Abstract
Abstract One target appears in one of regions at a random time and will thereafter remain there. The searcher has the available total search time T. Exponential-type detection functions are assumed. The search is terminated compulsorily at a certain random time. The problem is to maximize a probability of detecting the target. Necessary and sufficient conditions for an optimal policy are derived and a sequential allocation method of search time is proposed. The case of one region is solved explicitly and an example of this case is given.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.