2020
DOI: 10.1186/s42787-020-00097-1
|View full text |Cite
|
Sign up to set email alerts
|

The searching algorithm for detecting a Markovian target based on maximizing the discounted effort reward search

Abstract: This paper presents the searching algorithm to detect a Markovian target which moves randomly in M-cells. Our algorithm is based on maximizing the discounted effort reward search. At each fixed number of time intervals, the search effort is a random variable with a normal distribution. More than minimizing the non-detection probability of the targets at time interval i, we seek for the optimal distribution of the search effort by maximizing the discounted effort reward search. We present some special cases of … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3

Citation Types

0
4
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
5

Relationship

1
4

Authors

Journals

citations
Cited by 5 publications
(4 citation statements)
references
References 32 publications
0
4
0
Order By: Relevance
“…[16][17][18][19][20][21][22][23][40][41] For more recent and interesting search plans, see El-Hadidy et al. [24][25][26] All these studies have aimed to detect the lost targets with minimum cost and maximum probability. Another aim is to study the finiteness of the first meeting time between the randomly moving target and the searchers as in El-Hadidy et al.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…[16][17][18][19][20][21][22][23][40][41] For more recent and interesting search plans, see El-Hadidy et al. [24][25][26] All these studies have aimed to detect the lost targets with minimum cost and maximum probability. Another aim is to study the finiteness of the first meeting time between the randomly moving target and the searchers as in El-Hadidy et al.…”
Section: Introductionmentioning
confidence: 99%
“…This puts us in the face of a difficult discrete stochastic optimization problem that was previously studied in El-Hadidy. 25,26 The main goal here is to obtain the optimal distribution of the searching effort to get the suitable pharmaceutical company with the maximum probability. In the case of multiple M/M/1 cooperative queues where each one of them contains a single server and one access flow, Anily and Haviv 31 provided a collaboration model between them.…”
Section: Introductionmentioning
confidence: 99%
“…Thus, the experts in this field divided the search region to a set of states (may be identical or not). In [38][39][40], the search region is divided into a finite set of square and identical cells. The lost target is randomly moving over these 872 OPTIMAL MULTI ZONES SEARCH TECHNIQUE TO DETECT A LOST TARGET BY USING K SENSORS cells.…”
Section: Introductionmentioning
confidence: 99%
“…OPTIMAL MULTI ZONES SEARCH TECHNIQUE TO DETECT A LOST TARGET BY USING K SENSORS Suppose that the probability of undetection (3) is combined with the discounted effort function 0 < δ i js < 1 which used in El-Hadidy [38,39] to develop the final discounted effort reward function:…”
mentioning
confidence: 99%