Searching for a \(d\)-dimensional Brownian target with multiple sensors (Q2204246)
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 7261366
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Searching for a \(d\)-dimensional Brownian target with multiple sensors |
scientific article; zbMATH DE number 7261366 |
Statements
Searching for a \(d\)-dimensional Brownian target with multiple sensors (English)
0 references
15 October 2020
0 references
Summary: We consider a search problem for a \(d\)-dimensional Brownian target that moves randomly on \(d\)-space. We have \(n\)-searchers moving with a linear paths in \(d\)-dimension to search for the target. Each of the searchers moves continuously along its line in both directions of the starting point (origin of its line). The purpose of this paper is to formulate a search model and find the condition under which the expected value of the first meeting time between one of the searchers and the target finite. Also, we show the existence of the optimal search plan that minimises the expected value of the first meeting time.
0 references
disjoint real lines
0 references
finite search plan
0 references
\(d\)-dimensional Brownian motion
0 references
digonal matrix
0 references
optimal search plan
0 references
multiple sensors
0 references
0.8943275213241577
0 references
0.8628700971603394
0 references
0.8482847809791565
0 references
0.8447709083557129
0 references
0.8247383236885071
0 references
