Double linear search problem for a Brownian target motion (Q951780)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Double linear search problem for a Brownian target motion |
scientific article; zbMATH DE number 5360870
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Double linear search problem for a Brownian target motion |
scientific article; zbMATH DE number 5360870 |
Statements
Double linear search problem for a Brownian target motion (English)
0 references
3 November 2008
0 references
The present paper deals with a double search model. The existence of the optimal search plan is shown, which minimizes the expected value of the first meeting time between one of the searchers and the target.
0 references
Brownian motion
0 references
expected value
0 references
linear search
0 references
optimal search plan
0 references
0.9008764624595642
0 references
0.8989324569702148
0 references
0.8482847809791565
0 references
0.8299699425697327
0 references
0.8074352741241455
0 references
