Stochastic search in a convex region
type: Item
instance of: scholarly article
title: Stochastic search in a convex region
zbMATH Open document ID: 0617.60086
DOI: 10.1007/BF01848133
author: Steven P. Lalley
author: Herbert Robbins
publication date: 1988-01-01T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 60K15
Mathematics Subject Classification ID: 90B40
zbMATH DE Number: 4001153
zbMATH Keywords: stochastic search strategy
zbMATH Keywords: first passages to time-dependent boundaries
zbMATH Keywords: semi-Markov process
MaRDI profile type: Publication
cites work: Limit theorems for semi-Markov processes and renewal theory for Markov chains
cites work: Optimal Search for a Moving Target in Discrete Time and Space
cites work: The Princess and Monster Differential Game
cites work: Search Games with Mobile and Immobile Hider
cites work: Search games
cites work: Q4134602
cites work: Q5532185
cites work: Renewal theory for functionals of a Markov chain with general state space
cites work: Asymptotically minimax stochastic search strategies in the plane
cites work: Q3792519
cites work: Change of Time Scale For Markov Processes
cites work: Q4098445
Recommended article: Q3139514
Recommended article: Q4761637
Recommended article: Q3792519
Recommended article: Q4354021
Recommended article: Stochastic convexity in dynamic programming
Recommended article: Q3824103
Recommended article: Asymptotically minimax stochastic search strategies in the plane
published in: Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete
description: scientific article; zbMATH DE number 4001153