1,122 research outputs found
Attention and Anticipation in Fast Visual-Inertial Navigation
We study a Visual-Inertial Navigation (VIN) problem in which a robot needs to
estimate its state using an on-board camera and an inertial sensor, without any
prior knowledge of the external environment. We consider the case in which the
robot can allocate limited resources to VIN, due to tight computational
constraints. Therefore, we answer the following question: under limited
resources, what are the most relevant visual cues to maximize the performance
of visual-inertial navigation? Our approach has four key ingredients. First, it
is task-driven, in that the selection of the visual cues is guided by a metric
quantifying the VIN performance. Second, it exploits the notion of
anticipation, since it uses a simplified model for forward-simulation of robot
dynamics, predicting the utility of a set of visual cues over a future time
horizon. Third, it is efficient and easy to implement, since it leads to a
greedy algorithm for the selection of the most relevant visual cues. Fourth, it
provides formal performance guarantees: we leverage submodularity to prove that
the greedy selection cannot be far from the optimal (combinatorial) selection.
Simulations and real experiments on agile drones show that our approach ensures
state-of-the-art VIN performance while maintaining a lean processing time. In
the easy scenarios, our approach outperforms appearance-based feature selection
in terms of localization errors. In the most challenging scenarios, it enables
accurate visual-inertial navigation while appearance-based feature selection
fails to track robot's motion during aggressive maneuvers.Comment: 20 pages, 7 figures, 2 table
A Decentralized Optimal LQ State Observer Based On An Augmented Lagrangian Approach
à paraître dans AUTOMATICA en 2014International audienceThis paper is devoted to the design of a decentralized optimal batch LQ state observer for state estimation of large-scale interconnected systems, well suited for implementation on a sensor network. The here-proposed approach relies on both the use of an augmented Lagrangian formulation and a price-decomposition-coordination algorithm. The state estimation of an open-channel hydraulic system illustrates the effectiveness of this approach and is used to provide a comparison with alternative methods
Target Localization and Tracking in Wireless Sensor Networks
This thesis addresses the target localization problem in wireless sensor networks (WSNs) by employing statistical modeling and convex relaxation techniques. The first and the second part of the thesis focus on received signal strength (RSS)- and RSS-angle of arrival (AoA)-based target localization problem, respectively. Both non-cooperative and cooperative WSNs are investigated and various settings of the localization problem are of interest (e.g. known and unknown target transmit power, perfectly and imperfectly known path loss exponent). For all cases, maximum likelihood (ML) estimation problem is first formulated.
The general idea is to tightly approximate the ML estimator by another one whose
global solution is a close representation of the ML solution, but is easily obtained due to greater smoothness of the derived objective function. By applying certain relaxations, the solution to the derived estimator is readily obtained through general-purpose solvers. Both centralized (assumes existence of a central node that collects all measurements and carries out all necessary processing for network mapping) and distributed (each target determines its own location by iteratively solving a local representation of the derived estimator) algorithms are described. More specifically, in the case of centralized RSS-based localization, second-order cone programming (SOCP) and semidefinite programming (SDP) estimators are derived by applying SOCP and SDP relaxation techniques in non-cooperative and cooperative WSNs, respectively. It is also shown that the derived SOCP estimator can be extended for distributed implementation in cooperative WSNs. In the second part of the thesis, derivation procedure of a weighted least squares (WLS) estimator by converting the centralized non-cooperative RSS-AoA localization problem into a generalized trust region
sub-problem (GTRS) framework, and an SDP estimator by applying SDP relaxations to
the centralized cooperative RSS-AoA localization problem are described. Furthermore, a distributed SOCP estimator is developed, and an extension of the centralized WLS estimator for non-cooperative WSNs to distributed conduction in cooperative WSNs is also presented. The third part of the thesis is committed to RSS-AoA-based target tracking problem. Both cases of target tracking with fixed/static anchors and mobile sensors are investigated. First, the non-linear measurement model is linearized by applying Cartesian to polar coordinates conversion. Prior information extracted from target transition model is then added to the derived model, and by following maximum a posteriori (MAP) criterion, a MAP algorithm is developed. Similarly, by taking advantage of the derived model and the prior knowledge, Kalman filter (KF) algorithm is designed. Moreover, by allowing sensor mobility, a simple navigation routine for sensors’ movement management is described, which significantly enhances the estimation accuracy of the presented algorithms even for a reduced number of sensors.
The described algorithms are assessed and validated through simulation results and
real indoor measurements
State Estimation for Distributed and Hybrid Systems
This thesis deals with two aspects of recursive state estimation: distributed estimation and estimation for hybrid systems. In the first part, an approximate distributed Kalman filter is developed. Nodes update their state estimates by linearly combining local measurements and estimates from their neighbors. This scheme allows nodes to save energy, thus prolonging their lifetime, compared to centralized information processing. The algorithm is evaluated experimentally as part of an ultrasound based positioning system. The first part also contains an example of a sensor-actuator network, where a mobile robot navigates using both local sensors and information from a sensor network. This system was implemented using a component-based framework. The second part develops, a recursive joint maximum a posteriori state estimation scheme for Markov jump linear systems. The estimation problem is reformulated as dynamic programming and then approximated using so called relaxed dynamic programming. This allows the otherwise exponential complexity to be kept at manageable levels. Approximate dynamic programming is also used to develop a sensor scheduling algorithm for linear systems. The algorithm produces an offline schedule that when used together with a Kalman filter minimizes the estimation error covariance
- …