Next Article in Journal
Optimal Service Distribution in WSN Service System Subject to Data Security Constraints
Next Article in Special Issue
Sensors and Technologies in Spain: State-of-the-Art
Previous Article in Journal
Relevance-Based Template Matching for Tracking Targets in FLIR Imagery
Previous Article in Special Issue
Infrared Thermography for Temperature Measurement and Non-Destructive Testing
Article Menu

Export Article

Open AccessArticle
Sensors 2014, 14(8), 14131-14179; doi:10.3390/s140814131

Minimum Time Search in Uncertain Dynamic Domains with Complex Sensorial Platforms

1
Mobile Robotics Lab, Institute of Systems and Robotics, University of Coimbra, Pinhal de Marrocos, Plo II, 3030-290 Coimbra, Portugal
2
Departamento de Arquitectura de Computadores y Automatica, Universidad Complutense de Madrid, Av. Complutense s/n, 28040 Madrid, Spain
*
Author to whom correspondence should be addressed.
Received: 3 February 2014 / Revised: 21 July 2014 / Accepted: 25 July 2014 / Published: 4 August 2014
(This article belongs to the Special Issue State-of-the-Art Sensors Technology in Spain 2013)
View Full-Text   |   Download PDF [6485 KB, uploaded 4 August 2014]   |  

Abstract

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. View Full-Text
Keywords: multi-agent systems; Bayesian search theory; Minimum Time Search; Cross Entropy Optimization multi-agent systems; Bayesian search theory; Minimum Time Search; Cross Entropy Optimization
This is an open access article distributed under the Creative Commons Attribution License (CC BY 3.0).

Scifeed alert for new publications

Never miss any articles matching your research from any publisher
  • Get alerts for new papers matching your research
  • Find out the new papers from selected authors
  • Updated daily for 49'000+ journals and 6000+ publishers
  • Define your Scifeed now

SciFeed Share & Cite This Article

MDPI and ACS Style

Lanillos, P.; Besada-Portas, E.; Lopez-Orozco, J.A.; de la Cruz, J.M. Minimum Time Search in Uncertain Dynamic Domains with Complex Sensorial Platforms. Sensors 2014, 14, 14131-14179.

Show more citation formats Show less citations formats

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Sensors EISSN 1424-8220 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top