Alert button
Picture for Silvère Bonnabel

Silvère Bonnabel

Alert button

SIERRA

Variational Gaussian approximation of the Kushner optimal filter

Oct 03, 2023
Marc Lambert, Silvère Bonnabel, Francis Bach

In estimation theory, the Kushner equation provides the evolution of the probability density of the state of a dynamical system given continuous-time observations. Building upon our recent work, we propose a new way to approximate the solution of the Kushner equation through tractable variational Gaussian approximations of two proximal losses associated with the propagation and Bayesian update of the probability density. The first is a proximal loss based on the Wasserstein metric and the second is a proximal loss based on the Fisher metric. The solution to this last proximal loss is given by implicit updates on the mean and covariance that we proposed earlier. These two variational updates can be fused and shown to satisfy a set of stochastic differential equations on the Gaussian's mean and covariance matrix. This Gaussian flow is consistent with the Kalman-Bucy and Riccati flows in the linear case and generalize them in the nonlinear one.

* Lecture Notes in Computer Science, 2023 
Viaarxiv icon

Invariant Smoothing for Localization: Including the IMU Biases

Sep 25, 2023
Paul Chauchat, Silvère Bonnabel, Axel Barrau

In this article we investigate smoothing (i.e., optimisation-based) estimation techniques for robot localization using an IMU aided by other localization sensors. We more particularly focus on Invariant Smoothing (IS), a variant based on the use of nontrivial Lie groups from robotics. We study the recently introduced Two Frames Group (TFG), and prove it can fit into the framework of Invariant Smoothing in order to better take into account the IMU biases, as compared to the state-of-the-art in robotics. Experiments based on the KITTI dataset show the proposed framework compares favorably to the state-of-the-art smoothing methods in terms of robustness in some challenging situations.

Viaarxiv icon

Variational inference via Wasserstein gradient flows

May 31, 2022
Marc Lambert, Sinho Chewi, Francis Bach, Silvère Bonnabel, Philippe Rigollet

Figure 1 for Variational inference via Wasserstein gradient flows
Figure 2 for Variational inference via Wasserstein gradient flows
Figure 3 for Variational inference via Wasserstein gradient flows
Figure 4 for Variational inference via Wasserstein gradient flows

Along with Markov chain Monte Carlo (MCMC) methods, variational inference (VI) has emerged as a central computational approach to large-scale Bayesian inference. Rather than sampling from the true posterior $\pi$, VI aims at producing a simple but effective approximation $\hat \pi$ to $\pi$ for which summary statistics are easy to compute. However, unlike the well-studied MCMC methodology, VI is still poorly understood and dominated by heuristics. In this work, we propose principled methods for VI, in which $\hat \pi$ is taken to be a Gaussian or a mixture of Gaussians, which rest upon the theory of gradient flows on the Bures-Wasserstein space of Gaussian measures. Akin to MCMC, it comes with strong theoretical guarantees when $\pi$ is log-concave.

* 52 pages, 15 figures 
Viaarxiv icon

Factor Graph-Based Smoothing Without Matrix Inversion for Highly Precise Localization

Sep 22, 2020
Paul Chauchat, Axel Barrau, Silvère Bonnabel

Figure 1 for Factor Graph-Based Smoothing Without Matrix Inversion for Highly Precise Localization
Figure 2 for Factor Graph-Based Smoothing Without Matrix Inversion for Highly Precise Localization
Figure 3 for Factor Graph-Based Smoothing Without Matrix Inversion for Highly Precise Localization
Figure 4 for Factor Graph-Based Smoothing Without Matrix Inversion for Highly Precise Localization

We consider the problem of localizing a manned, semi-autonomous, or autonomous vehicle in the environment using information coming from the vehicle's sensors, a problem known as navigation or simultaneous localization and mapping (SLAM) depending on the context. To infer knowledge from sensors' measurements, while drawing on a priori knowledge about the vehicle's dynamics, modern approaches solve an optimization problem to compute the most likely trajectory given all past observations, an approach known as smoothing. Improving smoothing solvers is an active field of research in the SLAM community. Most work is focused on reducing computation load by inverting the involved linear system while preserving its sparsity. The present paper raises an issue which, to the knowledge of the authors, has not been addressed yet: standard smoothing solvers require explicitly using the inverse of sensor noise covariance matrices. This means the parameters that reflect the noise magnitude must be sufficiently large for the smoother to properly function. When matrices are close to singular, which is the case when using high precision modern inertial measurement units (IMU), numerical issues necessarily arise, especially with 32-bits implementation demanded by most industrial aerospace applications. We discuss these issues and propose a solution that builds upon the Kalman filter to improve smoothing algorithms. We then leverage the results to devise a localization algorithm based on fusion of IMU and vision sensors. Successful real experiments using an actual car equipped with a tactical grade high performance IMU and a LiDAR illustrate the relevance of the approach to the field of autonomous vehicles.

* IEEE Transactions on Control Systems Technology, Institute of Electrical and Electronics Engineers, 2020, pp.1-14  
Viaarxiv icon

Associating Uncertainty to Extended Poses for on Lie Group IMU Preintegration with Rotating Earth

Jul 28, 2020
Martin Brossard, Axel Barrau, Paul Chauchat, Silvère Bonnabel

Figure 1 for Associating Uncertainty to Extended Poses for on Lie Group IMU Preintegration with Rotating Earth
Figure 2 for Associating Uncertainty to Extended Poses for on Lie Group IMU Preintegration with Rotating Earth
Figure 3 for Associating Uncertainty to Extended Poses for on Lie Group IMU Preintegration with Rotating Earth
Figure 4 for Associating Uncertainty to Extended Poses for on Lie Group IMU Preintegration with Rotating Earth

The recently introduced matrix group SE2(3) provides a 5x5 matrix representation for the orientation, velocity and position of an object in the 3-D space, a triplet we call ''extended pose''. In this paper we build on this group to develop a theory to associate uncertainty with extended poses represented by 5x5 matrices. Our approach is particularly suited to describe how uncertainty propagates when the extended pose represents the state of an Inertial Measurement Unit (IMU). In particular it allows revisiting the theory of IMU preintegration on manifold and reaching a further theoretic level in this field. Exact preintegration formulas that account for rotating Earth, that is, centrifugal force and Coriolis force, are derived as a byproduct, and the factors are shown to be more accurate. The approach is validated through extensive simulations and applied to sensor-fusion where a loosely-coupled fixed-lag smoother fuses IMU and LiDAR on one hour long experiments using our experimental car. It shows how handling rotating Earth may be beneficial for long-term navigation within incremental smoothing algorithms.

Viaarxiv icon

A New Approach to 3D ICP Covariance Estimation for Mobile Robotics

Sep 12, 2019
Martin Brossard, Silvère Bonnabel, Axel Barrau

Figure 1 for A New Approach to 3D ICP Covariance Estimation for Mobile Robotics
Figure 2 for A New Approach to 3D ICP Covariance Estimation for Mobile Robotics
Figure 3 for A New Approach to 3D ICP Covariance Estimation for Mobile Robotics
Figure 4 for A New Approach to 3D ICP Covariance Estimation for Mobile Robotics

In mobile robotics, scan matching of point clouds using Iterative Closest Point (ICP) allows estimating sensor displacements. It may prove important to assess the associated uncertainty about the obtained rigid transformation, especially for sensor fusion purposes. In this paper we propose a novel approach to 3D ICP covariance computation that accounts for all the sources of errors as listed in Censi's pioneering work, namely wrong convergence, underconstrained situations, and sensor noise. Our approach builds on two facts. First, ICP is not a standard sensor: owing to wrong convergence the concept of ICP covariance per se is actually meaningless, as the dispersion in the ICP outputs may largely depend on the accuracy of the initialization, and is thus inherently related to the prior uncertainty on the displacement. We capture this using the unscented transform, which also reflects correlations between initial and final uncertainties. Then, assuming white sensor noise leads to overoptimism: ICP is biased, owing to e.g. calibration biases, which we account for. Our solution is tested on publicly available real data ranging from structured to unstructured environments, where our algorithm predicts consistent results with actual uncertainty, and compares very favorably to previous methods. We finally demonstrate the benefits of our method for pose-graph localization, where our approach improves accuracy and robustness of the estimates.

Viaarxiv icon

AI-IMU Dead-Reckoning

Apr 12, 2019
Martin Brossard, Axel Barrau, Silvère Bonnabel

Figure 1 for AI-IMU Dead-Reckoning
Figure 2 for AI-IMU Dead-Reckoning
Figure 3 for AI-IMU Dead-Reckoning
Figure 4 for AI-IMU Dead-Reckoning

In this paper we propose a novel accurate method for dead-reckoning of wheeled vehicles based only on an Inertial Measurement Unit (IMU). In the context of intelligent vehicles, robust and accurate dead-reckoning based on the IMU may prove useful to correlate feeds from imaging sensors, to safely navigate through obstructions, or for safe emergency stops in the extreme case of exteroceptive sensors failure. The key components of the method are the Kalman filter and the use of deep neural networks to dynamically adapt the noise parameters of the filter. The method is tested on the KITTI odometry dataset, and our dead-reckoning inertial method based only on the IMU accurately estimates 3D position, velocity, orientation of the vehicle and self-calibrates the IMU biases. We achieve on average a 1.10% translational error and the algorithm competes with top-ranked methods which, by contrast, use LiDAR or stereo vision. We make our implementation open-source at: https://github.com/mbrossar/ai-imu-dr

Viaarxiv icon

Exploiting Symmetries to Design EKFs with Consistency Properties for Navigation and SLAM

Mar 13, 2019
Martin Brossard, Axel Barrau, Silvère Bonnabel

Figure 1 for Exploiting Symmetries to Design EKFs with Consistency Properties for Navigation and SLAM
Figure 2 for Exploiting Symmetries to Design EKFs with Consistency Properties for Navigation and SLAM
Figure 3 for Exploiting Symmetries to Design EKFs with Consistency Properties for Navigation and SLAM
Figure 4 for Exploiting Symmetries to Design EKFs with Consistency Properties for Navigation and SLAM

The Extended Kalman Filter (EKF) is both the historical algorithm for multi-sensor fusion and still state of the art in numerous industrial applications. However, it may prove inconsistent in the presence of unobservability under a group of transformations. In this paper we first build an alternative EKF based on an alternative nonlinear state error. This EKF is intimately related to the theory of the Invariant EKF (IEKF). Then, under a simple compatibility assumption between the error and the transformation group, we prove the linearized model of the alternative EKF automatically captures the unobservable directions, and many desirable properties of the linear case then directly follow. This provides a novel fundamental result in filtering theory. We apply the theory to multi-sensor fusion for navigation, when all the sensors are attached to the vehicle and do not have access to absolute information, as typically occurs in GPS-denied environments. In the context of Simultaneous Localization And Mapping (SLAM), Monte-Carlo runs and comparisons to OC-EKF, robocentric EKF, and optimization-based smoothing algorithms (iSAM) illustrate the results. The proposed EKF is also proved to outperform standard EKF and to achieve comparable performance to iSAM on a publicly available real dataset for multi-robot SLAM.

Viaarxiv icon

Invariant Smoothing on Lie Groups

Aug 05, 2018
Paul Chauchat, Axel Barrau, Silvère Bonnabel

Figure 1 for Invariant Smoothing on Lie Groups
Figure 2 for Invariant Smoothing on Lie Groups
Figure 3 for Invariant Smoothing on Lie Groups
Figure 4 for Invariant Smoothing on Lie Groups

In this paper we propose a (non-linear) smoothing algorithm for group-affine observation systems, a recently introduced class of estimation problems on Lie groups that bear a particular structure. As most non-linear smoothing methods, the proposed algorithm is based on a maximum a posteriori estimator, determined by optimization. But owing to the specific properties of the considered class of problems, the involved linearizations are proved to have a form of independence with respect to the current estimates, leveraged to avoid (partially or sometimes totally) the need to relinearize. The method is validated on a robot localization example, both in simulations and on real experimental data.

* Accepted for publication at IROS 2018 
Viaarxiv icon

On the Covariance of ICP-based Scan-matching Techniques

Mar 16, 2016
Silvère Bonnabel, Martin Barczyk, François Goulette

Figure 1 for On the Covariance of ICP-based Scan-matching Techniques
Figure 2 for On the Covariance of ICP-based Scan-matching Techniques
Figure 3 for On the Covariance of ICP-based Scan-matching Techniques
Figure 4 for On the Covariance of ICP-based Scan-matching Techniques

This paper considers the problem of estimating the covariance of roto-translations computed by the Iterative Closest Point (ICP) algorithm. The problem is relevant for localization of mobile robots and vehicles equipped with depth-sensing cameras (e.g., Kinect) or Lidar (e.g., Velodyne). The closed-form formulas for covariance proposed in previous literature generally build upon the fact that the solution to ICP is obtained by minimizing a linear least-squares problem. In this paper, we show this approach needs caution because the rematching step of the algorithm is not explicitly accounted for, and applying it to the point-to-point version of ICP leads to completely erroneous covariances. We then provide a formal mathematical proof why the approach is valid in the point-to-plane version of ICP, which validates the intuition and experimental results of practitioners.

* Accepted at 2016 American Control Conference 
Viaarxiv icon