Stochastic search in a convex region (Q1822144)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Stochastic search in a convex region |
scientific article; zbMATH DE number 4001153
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Stochastic search in a convex region |
scientific article; zbMATH DE number 4001153 |
Statements
Stochastic search in a convex region (English)
0 references
1988
0 references
A stochastic search strategy is proposed for locating a possibly mobile target in a bounded, convex region of the plane. The strategy is asymptotically minimax as \(\epsilon\) \(\to 0\) with respect to the time required to get within \(\epsilon\) of the target. The proof involves the study of first passages to time-dependent boundaries by a certain semi- Markov process.
0 references
stochastic search strategy
0 references
first passages to time-dependent boundaries
0 references
semi-Markov process
0 references
0.87415576
0 references
