On optimal search plans to detect a target moving randomly on the real line
A target, whose initial position is unknown, is performing a random walk on the integers. A searcher, starting at the origin, wants to follow a search plan for which E[[tau]k] is finite, where k >= 1 and [tau] is the time to capture. The searcher, who has a prior distribution over the target's initial position, can move only to adjacent positions, and cannot travel faster than the target. Necessary and sufficient conditions are given for the existence of search plans for which E[[tau]k] is finite and a minimum.
Year of publication: |
1985
|
---|---|
Authors: | Wilson, John G. |
Published in: |
Stochastic Processes and their Applications. - Elsevier, ISSN 0304-4149. - Vol. 20.1985, 2, p. 315-321
|
Publisher: |
Elsevier |
Subject: | search theory random walk |
Saved in:
Online Resource
Saved in favorites
Similar items by person
-
Optimal design of a name-your-own price channel
Wilson, John G., (2008)
-
Optimal scheduling of jobs on a transmission network
Jones, Graham A., (1979)
-
Name-your-own price auction mechanisms - modeling and future implications
Anderson, Chris K., (2011)
- More ...