pith. sign in

arxiv: 1709.08746 · v1 · pith:XYWWXYNFnew · submitted 2017-09-25 · 📡 eess.SY · cs.MA· cs.SY· math.OC

DIeSEL: DIstributed SElf-Localization of a network of underwater vehicles

classification 📡 eess.SY cs.MAcs.SYmath.OC
keywords distributedpositionproblemaccurateaddressesagentagentsalgorithm
0
0 comments X
read the original abstract

How can teams of artificial agents localize and position themselves in GPS-denied environments? How can each agent determine its position from pairwise ranges, own velocity, and limited interaction with neighbors? This paper addresses this problem from an optimization point of view: we directly optimize the nonconvex maximum-likelihood estimator in the presence of range measurements contaminated with Gaussian noise, and we obtain a provably convergent, accurate and distributed positioning algorithm that outperforms the extended Kalman filter, a standard centralized solution for this problem.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.