Minimum time search in uncertain dynamic domains with complex sensorial platforms

• Autor(a) principal: Lanillos, Pablo
• Data de Publicação: 2014
• Outros Autores: Besada-Portas, Eva, Lopez-Orozco, Jose Antonio, de la Cruz, Jesus Manuel
• Tipo de documento: Artigo
• Idioma: eng
• Título da fonte: Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
• Texto Completo: http://hdl.handle.net/10316/109684; https://doi.org/10.3390/s140814131
• topic: multi-agent systems; Bayesian search theory; Minimum Time Search; Cross Entropy Optimization; Algorithms; Automation; Models, Theoretical; Nonlinear Dynamics; Probability; Uncertainty

The minimum time search in uncertain domains is a searching task, which appears in real world problems such as natural disasters and sea rescue operations, where a target has to be found, as soon as possible, by a set of sensor-equipped searchers. The automation of this task, where the time to detect the target is critical, can be achieved by new probabilistic techniques that directly minimize the Expected Time (ET) to detect a dynamic target using the observation probability models and actual observations collected by the sensors on board the searchers. The selected technique, described in algorithmic form in this paper for completeness, has only been previously partially tested with an ideal binary detection model, in spite of being designed to deal with complex non-linear/non-differential sensorial models. This paper covers the gap, testing its performance and applicability over different searching tasks with searchers equipped with different complex sensors. The sensorial models under test vary from stepped detection probabilities to continuous/discontinuous differentiable/non-differentiable detection probabilities dependent on distance, orientation, and structured maps. The analysis of the simulated results of several static and dynamic scenarios performed in this paper validates the applicability of the technique with different types of sensor models.