A moving horizon convex relaxation for mobile sensor network localization

Andrea Simonetto, Geert Leus

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

In mobile sensor network localization problems we seek to estimate the position of the mobile sensor nodes by using a subset of pair-wise range measurements (among the nodes and with mobile anchors). When the sensor nodes are static, convex relaxations have been shown to provide a remarkably accurate approximate solution to this NP-hard estimation problem. In this paper, we propose a novel convex relaxation to tackle the more challenging dynamic case and we develop a moving horizon convex estimator based on a maximum a posteriori (MAP) formulation. The resulting estimator is then compared to standard extended and unscented Kalman filters both with respect to computational complexity and performance with simulated data. The results are promising, yet a more detailed analysis is needed.

Original languageEnglish
Title of host publication2014 IEEE 8th Sensor Array and Multichannel Signal Processing Workshop, SAM 2014
PublisherIEEE Computer Society
Pages25-28
Number of pages4
ISBN (Print)9781479914814
DOIs
Publication statusPublished - 1 Jan 2014
Externally publishedYes
Event2014 IEEE 8th Sensor Array and Multichannel Signal Processing Workshop, SAM 2014 - A Coruna, Spain
Duration: 22 Jun 201425 Jun 2014

Publication series

NameProceedings of the IEEE Sensor Array and Multichannel Signal Processing Workshop
ISSN (Electronic)2151-870X

Conference

Conference2014 IEEE 8th Sensor Array and Multichannel Signal Processing Workshop, SAM 2014
Country/TerritorySpain
CityA Coruna
Period22/06/1425/06/14

Fingerprint

Dive into the research topics of 'A moving horizon convex relaxation for mobile sensor network localization'. Together they form a unique fingerprint.

Cite this