This paper presents an experimentally validated alternative to the classical extended Kalman filter approach to the solution of the probabilistic state-space simultaneous localization and mapping (SLAM) problem. Several authors have reported the divergence of this classical approach due to the linearization of the inherent nonlinear nature of the SLAM problem. Hence, the approach described in this work aims to avoid the analytical linearization based on Taylor-series expansion of both the model and measurement equations by using the unscented filter. An innovation-based consistency checking validates the feasibility and applicability of the unscented SLAM approach to a real large-scale outdoor exploration mission.
Prosthetic vision is being applied to partially recover the retinal stimulation of visually impaired people. However, the phosphenic images produced by the implants have very limited information bandwidth due to the poor resolution and lack of color or contrast. The ability of object recognition and scene understanding in real environments is severely restricted for prosthetic users. Computer vision can play a key role to overcome the limitations and to optimize the visual information in the prosthetic vision, improving the amount of information that is presented. We present a new approach to build a schematic representation of indoor environments for simulated phosphene images. The proposed method combines a variety of convolutional neural networks for extracting and conveying relevant information about the scene such as structural informative edges of the environment and silhouettes of segmented objects. Experiments were conducted with normal sighted subjects with a Simulated Prosthetic Vision system. The results show good accuracy for object recognition and room identification tasks for indoor scenes using the proposed approach, compared to other image processing methods.
In this paper, we tackle several problems that appear in robotics and autonomous systems: algorithm tuning, automatic control, and intelligent design. All those problems share in common that they can be mapped to global optimization problems where evaluations are expensive. Bayesian optimization (BO) has become a fundamental global optimization algorithm in many problems where sample efficiency is of paramount importance. BO uses a probabilistic surrogate model to learn the response function and reduce the number of samples required. Gaussian processes (GPs) have become a standard surrogate model for their flexibility to represent a distribution over functions. In a black-box settings, the common assumption is that the underlying function can be modeled with a stationary GP. In this paper, we present a novel kernel function specially designed for BO, that allows nonstationary behavior of the surrogate model in an adaptive local region. This kernel is able to reconstruct nonstationarity even with the irregular sampling distribution that arises from BO. Furthermore, in our experiments, we found that this new kernel results in an improved local search (exploitation), without penalizing the global search (exploration) in many applications. We provide extensive results in well-known optimization benchmarks, machine learning hyperparameter tuning, reinforcement learning, and control problems, and UAV wing optimization. The results show that the new method is able to outperform the state of the art in BO both in stationary and nonstationary problems.