2015
DOI: 10.4236/ajor.2015.52005
|View full text |Cite
|
Sign up to set email alerts
|

Computational Studies on Detecting a Diffusing Target in a Square Region by a Stationary or Moving Searcher

Abstract: In this paper, we compute the non-detection probability of a randomly moving target by a stationary or moving searcher in a square search region. We find that when the searcher is stationary, the decay rate of the non-detection probability achieves the maximum value when the searcher is fixed at the center of the square search region; when both the searcher and the target diffuse with significant diffusion coefficients, the decay rate of the non-detection probability only depends on the sum of the diffusion co… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2015
2015
2016
2016

Publication Types

Select...
2

Relationship

2
0

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 18 publications
(11 reference statements)
0
1
0
Order By: Relevance
“…Fernando and Sritharan computed the non-detection probability of infinitely many diffusing Brownian targets by a moving searcher which traveled along a deterministic path with constant speed in the two-dimensional plane [20]. Wang and Zhou conducted numerical studies to calculate the non-detection probability of a randomly moving target by a stationary or moving searcher in a square search region [21]. They also considered the search problem where a target moves between a hiding area and an operating area via multiple pathways where the searchers are equipped with either cookie-cutter sensors [22] or stochastically intermittent sensors [23].…”
Section: Introductionmentioning
confidence: 99%
“…Fernando and Sritharan computed the non-detection probability of infinitely many diffusing Brownian targets by a moving searcher which traveled along a deterministic path with constant speed in the two-dimensional plane [20]. Wang and Zhou conducted numerical studies to calculate the non-detection probability of a randomly moving target by a stationary or moving searcher in a square search region [21]. They also considered the search problem where a target moves between a hiding area and an operating area via multiple pathways where the searchers are equipped with either cookie-cutter sensors [22] or stochastically intermittent sensors [23].…”
Section: Introductionmentioning
confidence: 99%