LocDyn: Robust Distributed Localization for Mobile Underwater Networks

Abstract

How do we self-localize large teams of underwater nodes using only noisy range measurements? How do we do it in a distributed way, and incorporating dynamics into the problem? How do we reject outliers and produce trustworthy position estimates? And what if some of the vehicles can measure angular information? The stringent acoustic communication constraints and accuracy needs of our geophysical survey application demand fast and very accurate localization methods. We address dynamic localization as a MAP estimation problem where the prior encodes kinematic information, and we apply a convex relaxation method that takes advantage of previous estimates at each measurement acquisition step. The resulting LocDyn algorithm is fast: It converges at an optimal rate for first order methods. LocDyn is distributed: There is no fusion center responsible for processing acquired data and the same simple computations are performed at each node. LocDyn is accurate: Numerical experiments attest to about 30% smaller positioning error than a comparable Kalman filter. LocDyn is robust: It rejects outlier noise, while benchmarking methods succumb in terms of positioning error.