Home/Consistent Unscented Incremental Smoothing for Multi-robot Cooperative Target Tracking

Consistent Unscented Incremental Smoothing for Multi-robot Cooperative Target Tracking

Guoquan Huang, Michael Kaess and John J. Leonard
Journal Article, Journal of Robotics and Autonomous Systems, Vol. 69, pp. 52-67, July, 2015

View Publication

Copyright notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.


In this paper, we study the problem of multi-robot cooperative target tracking, where a team of mobile robots cooperatively localize themselves and track (multiple) targets using their onboard sensor measurements as well as target stochastic kinematic information, and which is hence termed cooperative localization and target tracking (CLATT). A novel efficient, con- sistent, unscented incremental smoothing (UIS) algorithm is introduced. The key idea of the proposed approach is that we employ unscented transform to numerically compute Jacobians so as to attain reduced linearization errors, while further imposing appropriate constraints on unscented transform to en- sure correct observability properties for the incrementally-linearized system. In particular, for the first time we analyze the observability properties of the optimal batch maximum a posteriori (MAP)-based CLATT system, and show that the Fisher information (Hessian) matrix without prior has a nullspace of dimension three, corresponding to the global state information. However, this may not be the case when the Jacobians (and thus the Hessian) are computed canonically by the standard unscented transform, thus negatively impacting the estimation performance. To address this issue, we formulate an observability-constrained unscented transform, and find its closed-from solution as the projection of the canonical unscented Jacobian (i.e., com- puted by the standard unscented transform) onto an appropriate observable subspace such that the resulting Hessian has a nullspace of correct dimensions. The proposed approach is tested extensively through Monte Carlo simulations as well as a real-world experiment, and is shown to outperform the state-of-the-art incremental smoothing algorithm.

author = {Guoquan Huang and Michael Kaess and John J. Leonard},
title = {Consistent Unscented Incremental Smoothing for Multi-robot Cooperative Target Tracking},
journal = {Journal of Robotics and Autonomous Systems},
year = {2015},
month = {July},
volume = {69},
pages = {52-67},
} 2018-11-12T12:38:29-05:00