Optimal searching for a randomly located target in a bounded known region (Q2224039)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7305341
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimal searching for a randomly located target in a bounded known region |
scientific article; zbMATH DE number 7305341 |
Statements
Optimal searching for a randomly located target in a bounded known region (English)
0 references
3 February 2021
0 references
Summary: This paper addresses the problem of searching for a randomly located target in a bounded known region by a single searcher. The searcher wishes to find the target's position, that is given by the value of the two independent double truncated random variables \((X;Y)\) and they have joint symmetric probability density function \(f(x;y)\). It is desired to search in an optimal manner to minimise the expected value of the time for detecting the target, assuming double truncated circular normal distributed estimates of its position.
0 references
optimal search path
0 references
double truncated circular normal distribution
0 references
nonlinear optimisation
0 references
randomly located targets
0 references
bounded known regions
0 references
probability density function
0 references
0.8590190410614014
0 references
0.835695743560791
0 references
