For mobile robots to operate in an autonomous and safe manner they must be able to adequately perceive their environment despite challenging or unpredictable conditions in their sensory apparatus. Usually, this is addressed through ad-hoc, not easily generalizable Fault Detection and Diagnosis (FDD) approaches. In this work, we leverage Bayesian Networks (BNs) to propose a novel probabilistic inference architecture that provides generality, rigorous inferences and real-time performance for the detection, diagnosis and recovery of diverse and multiple sensory failures in robotic systems. Our proposal achieves all these goals by structuring a BN in a multidimensional setting that up to our knowledge deals coherently and rigorously for the first time with the following issues: modeling of complex interactions among the components of the system, including sensors, anomaly detection and recovery; representation of sensory information and other kinds of knowledge at different levels of cognitive abstraction; and management of the temporal evolution of sensory behavior. Real-time performance is achieved through the compilation of these BNs into feedforward neural networks. Our proposal has been implemented and tested for mobile robot navigation in environments with human presence, a complex task that involves diverse sensor anomalies. The results obtained from both simulated and real experiments prove that our architecture enhances the safety and robustness of robotic operation: among others, the minimum distance to pedestrians, the tracking time and the navigation time all improve statistically in the presence of anomalies, with a diversity of changes in medians ranging from ≃20% to ≃500%.

The integration of several 2D laser rangefinders in a vehicle is a common resource employed for 3D mapping, obstacle detection and navigation. The extrinsic calibration between such sensors (i.e. finding their relative poses) is required to exploit effectively the sensor measurements and to perform data fusion. The approaches found in the literature to obtain such calibration either rely on the approximated parameters from the rig construction or propose ad-hoc solutions for specific LRF rigs. In this paper we present a novel solution for the extrinsic calibration of a set of at least three laser scanners from the information provided by the sensor measurements. This method only requires the lasers to observe a common planar surface from different orientations, thus there is no need of any specific calibration pattern. This calibration technique can be used with almost any geometric sensor configuration (except for sensors scanning parallel planes), and constitutes a versatile solution that is accurate, fast and easy to apply. This approach is validated with both simulated and real data.

The representation of the world upon planar patches has proven to be simple, robust and useful for a variety of robotic tasks, including SLAM, autonomous navigation, or scene recognition. In this work we investigate how to incorporate color information into such representation to improve the matching of planar patches while maintaining the model compactness, which is essential for real-time applications. We propose a descriptor based on the dominant color of the patch, which is defined as the center of the biggest cluster in the patch histogram. In the paper, different color spaces and methods for extracting the dominant color are analyzed. We compare this descriptor with a recent proposal (saturated hue based histogram) and provide some conclusions on the trade-off between their descriptiveness and compactness. Finally, we present experimental results showing how our color descriptor can be exploited to increase the efficiency of both: plane-based place recognition and planar patch categorization.

The integration of several range cameras in a mobile platform is useful for applications in mobile robotics and autonomous vehicles that require a large field of view. This situation is increasingly interesting with the advent of low cost range cameras like those developed by Primesense. Calibrating such combination of sensors for any geometric configuration is a problem that has been recently solved through visual odometry (VO) and SLAM. However, this kind of solution is laborious to apply, requiring robust SLAM or VO in controlled environments. In this paper we propose a new uncomplicated technique for extrinsic calibration of range cameras that relies on finding and matching planes. The method that we present serves to calibrate two or more range cameras in an arbitrary configuration, requiring only to observe one plane from different viewpoints. The conditions to solve the problem are studied, and several practical examples are presented covering different geometric configurations, including an omnidirectional RGB-D sensor composed of 8 range cameras. The quality of this calibration is evaluated with several experiments that demonstrate an improvement of accuracy over design parameters, while providing a versatile solution that is extremely fast and easy to apply.

In the last very few years, monocular SLAM approaches based on bundle adjustment are achieving amazing results in terms of accuracy, computational efficiency, and density of the map. When such solutions are applied on large scenarios it is crucial for the system scalability to maintain a map representation that permits efficient map optimization and augmentation. In order to cope with such large maps, we present an on-the-fly partitioning technique which allows abstraction from the metric map to operate more efficiently. The result is a metric-topological arrangement where the areas with highly-connected observations are grouped in submaps weakly interconnected to each other. This is accomplished by progressively cutting a graph representation of the map, where the nodes are keyframes and the arcs between them represent their shared observations. The experimental results indicate that the proposed approach improves the efficiency of monocular SLAM and provides a metric-topological world representation suitable for other robotic tasks.

This paper presents a new method for recognizing places in indoor environments based on the extraction of planar regions from range data provided by a hand-held RGB-D sensor. We propose to build a plane-based map (PbMap) consisting of a set of 3D planar patches described by simple geometric features (normal vector, centroid, area, etc.). This world representation is organized as a graph where the nodes represent the planar patches and the edges connect planes that are close by. This map structure permits to efficiently select subgraphs representing the local neighborhood of observed planes, that will be compared with other subgraphs corresponding to local neighborhoods of planes acquired previously. To find a candidate match between two subgraphs we employ an interpretation tree that permits working with partially observed and missing planes. The candidates from the interpretation tree are further checked out by a rigid registration test, which also gives us the relative pose between the matched places. The experimental results indicate that the proposed approach is an efficient way to solve this problem, working satisfactorily even when there are substantial changes in the scene (lifelong maps).

Detecting abnd localizing objects from space, like roads, rivers, lakes, etc., is a challenging task with multiple applications in remote sensing. In this paper we address the detection of swimming pools in colour high-resolution images of urban areas acquired by the Quickbird satellite. The main motivation of this work is to survey and localize filled swimming pools during drought periods, fact that should be then punished by the local authorities. The proposed algorithm applies colour analysis for water detection and approximate segmentation, as an initial, rough localization, and active contours techniques to refine the pools' shape. We have tested our algorithm in both satellite and aerial images with satisfactory results.

Piecewise linear transformation is a powerful technique for coping with the registration of images affected by local geometric distortions, as it is usually the case of high-resolution satellite images. A key point when applying this technique is to divide the images to register according to a suitable common triangular mesh. This comprises two different aspects: where to place the mesh vertices (i.e., the mesh geometrical realization) and to set an appropriate topology upon these vertices (i.e., the mesh topological realization). This paper focuses on the latter and presents a novel method that improves the registration of two images by an iterative optimization process that modifies the mesh connectivity by swapping edges. For detecting if an edge needs to be swapped or not, we evaluate the registration improvement of that action on the two triangles connected by the edge. Another contribution of our proposal is the use of the mutual information for measuring the registration consistency within the optimization process, which provides more robustness to image changes than other well-known metrics such as normalized cross-correlation or sum of square differences. The proposed method has been successfully tested with different pairs of panchromatic QuickBird images (0.6 m/pixel of spatial resolution) of a variety of land covers (urban, residential, and rural) acquired under different lighting conditions and viewpoints.