Generalised linear search plan for a \(d\)-dimensional random walk target (Q2205085)
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 7262417
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Generalised linear search plan for a \(d\)-dimensional random walk target |
scientific article; zbMATH DE number 7262417 |
Statements
Generalised linear search plan for a \(d\)-dimensional random walk target (English)
0 references
20 October 2020
0 references
Summary: In this paper, we present a mathematical search model that studies the generalised linear search plan for detecting a \(d\)-dimensional random walk target. The target will meet one of the searchers where each searcher starts its motion from any point rather than the origin on \(n\)-disjoint real lines in \(\mathbb{R}^{n}\). Rather than, finding the conditions that show the finiteness of this search plan, we study the existence of the optimal search plan that minimises the expected value of the first meeting time between one of the searchers and the target.
0 references
linear search method
0 references
\(d\)-dimensional random walk
0 references
finite search plan
0 references
optimal search plan
0 references
semi continuous mapping
0 references
0.8826678395271301
0 references
0.8447709083557129
0 references
0.8238500952720642
0 references
0.8218585252761841
0 references
