Minimizing the expected time to detect a randomly located lost target using 3-dimensional search technique
This paper considers a new model in search theory to find a randomly located target in the 3-dimensional space. An approximation algorithm that facilitates searching procedures for searchers or robots is presented. The expected time to detect the target is also proved. The statistical analysis by ca...
| Autores: | , , |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión enviada para evaluación y publicación |
| Fecha de publicación: | 2020 |
| País: | España |
| Institución: | Universidad de Sevilla (US) |
| Repositorio: | idUS. Depósito de Investigación de la Universidad de Sevilla |
| OAI Identifier: | oai:idus.us.es:11441/100792 |
| Acceso en línea: | https://hdl.handle.net/11441/100792 https://doi.org/10.1080/03610926.2019.1588323 |
| Access Level: | acceso abierto |
| Palabra clave: | 3-D Search Search theory Trivariate standard normal distributions Expected time Lost black box 3-D search algorithm Optimal search |
| Sumario: | This paper considers a new model in search theory to find a randomly located target in the 3-dimensional space. An approximation algorithm that facilitates searching procedures for searchers or robots is presented. The expected time to detect the target is also proved. The statistical analysis by calculating the optimal search strategy which minimizes the time to detect the target, assuming trivariate standard normal distribution is provided, and the technique by flowcharts is designed as well. The effectiveness of this strategy is illustrated by introducing an application from real world. |
|---|