Artículo
Minimizing the expected time to detect a randomly located lost target using 3-dimensional search technique
Autor/es | Caraballo Garrido, Tomás
Teamah, Abd El-Moneim Anwar El-Bagoury, Abd Al-Aziz Hosni |
Departamento | Universidad de Sevilla. Departamento de Ecuaciones Diferenciales y Análisis Numérico |
Fecha de publicación | 2020 |
Fecha de depósito | 2020-09-08 |
Publicado en |
|
Resumen | 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 ... 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. |
Cita | Caraballo Garrido, T., Teamah, A.E.A. y El-Bagoury, A.A.H. (2020). Minimizing the expected time to detect a randomly located lost target using 3-dimensional search technique. Communications in Statistics - Theory and Methods, 49 (13), 3313-3328. |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
Minimizing the expected time to ... | 247.7Kb | [PDF] | Ver/ | |
Este registro aparece en las siguientes colecciones
Excepto si se señala otra cosa, la licencia del ítem se describe como: Attribution-NonCommercial-NoDerivatives 4.0 Internacional
Items relacionados
Enseñando items relacionados por título, autor, creador y materia.
-
Artículo
The Effect of internet searches on Afforestation: The case of a Green Search Engine
Palos Sánchez, Pedro Ramiro; Saura, José Ramón (MDPI AG, 2018)Ecosia is an Internet search engine that plants trees with the income obtained from advertising. This study explored the ...
-
Artículo
Solving Multifacility Huff Location Models on Networks Using Variable Neighborhood Search and Multi-Start Local Search Metaheuristics
Rocksandic, Sanja; Carrizosa Priego, Emilio José; Urosevic, Dragan; Mladenović, Nenad (Elsevier, 2012-12-01)We consider multifacility Huff location problems on networks. The mixed integer nonlinear optimization problem is solved using Variable Neighborhood Search and Multi-Start Local Search metaheuristics. Computational experience is reported.
-
Ponencia
A Local Search in Scatter Search for Improving Biclusters
Nepomuceno Chamorro, Juan Antonio; Troncoso Lora, Alicia; Aguilar Ruiz, Jesús Salvador (IEEE Computer Society, 2011)Scatter Search is a population-based metaheuristic that emphasizes systematic processes against random proce dures. A ...