Distributed Invariant Kalman Filter for Cooperative Localization using Matrix Lie Groups
Yizhi Zhou, Yufan Liu, Pengxiang Zhu, Xuan Wang
TL;DR
This work tackles distributed cooperative localization for a team of robots operating in 3-D environments without GPS. It develops a Distributed Invariant EKF (DInEKF) that formulates states on the matrix Lie group $SE_2(3)$, yielding state-estimate-independent Jacobians and improved estimator consistency. The algorithm proceeds with Lie-group propagation, local absolute updates, and CI-EKF-based fusion of correlated relative measurements from one-hop neighbors, ensuring consistency without a fusion center. Extensive simulations and indoor real-world experiments show that DInEKF outperforms traditional distributed EKF methods in both accuracy and consistency, highlighting the practical value of incorporating invariance and CI-based fusion in distributed multi-robot localization.
Abstract
This paper studies the problem of Cooperative Localization (CL) for multi-robot systems, where a group of mobile robots jointly localize themselves by using measurements from onboard sensors and shared information from other robots. We propose a novel distributed invariant Kalman Filter (DInEKF) based on the Lie group theory, to solve the CL problem in a 3-D environment. Unlike the standard EKF which computes the Jacobians based on the linearization at the state estimate, DInEKF defines the robots' motion model on matrix Lie groups and offers the advantage of state estimate-independent Jacobians. This significantly improves the consistency of the estimator. Moreover, the proposed algorithm is fully distributed, relying solely on each robot's ego-motion measurements and information received from its one-hop communication neighbors. The effectiveness of the proposed algorithm is validated in both Monte-Carlo simulations and real-world experiments. The results show that the proposed DInEKF outperforms the standard distributed EKF in terms of both accuracy and consistency.
