A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
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 convexdoi:10.1109/sam.2014.6882329 dblp:conf/ieeesam/SimonettoL14 fatcat:gzh75ich6jhrxlhdhzpofm5muq