arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2301.11450eess.SP
收藏

SMILE:基于稀疏低秩矩阵分解的鲁棒网络定位

SMILE: Robust Network Localization via Sparse and Low-Rank Matrix Decomposition

Lillian Clark, Sampad Mohanty, Bhaskar Krishnamachari

摘要:

出于机器人传感器网络中的协作定位,我们考虑了大规模网络定位的位置估计来自节点间的无线电信号的问题。成熟的网络定位方法通常假设所有无线电链路都是视距的,并且受到高斯噪声的影响。然而,导致非视线衰减的障碍物的存在提出了独特的挑战。为了实现强大的网络定位,我们提出了稀疏矩阵推理和线性嵌入(SMILE),这是一种新的方法,它借鉴了著名的局部线性嵌入(LLE)算法和稀疏加低秩矩阵分解的最新进展。我们证明了我们的方法是强大的噪声信号传播,严重的衰减,由于非视线,和丢失的成对测量。我们的实验包括模拟的大规模网络,一个11节点的传感器网络,和一个18节点的移动机器人和静态锚无线电网络在GPS拒绝石灰石矿。我们的研究结果表明,SMILE优于忽略非视线(NLOS)影响的经典多维缩放(MDS),以及优于最先进的鲁棒网络定位算法,这些算法确实考虑了NLOS衰减,包括基于图卷积网络的方法。我们证明,这种提高的准确性是不是在复杂性的成本,SMILE看到非常大的网络,这是重要的位置估计更新在动态设置,例如移动机器人的计算时间减少。

英文摘要:

Motivated by collaborative localization in robotic sensor networks, we consider the problem of large-scale network localization where location estimates are derived from inter-node radio signals. Well-established methods for network localization commonly assume that all radio links are line-of-sight and subject to Gaussian noise. However, the presence of obstacles which cause non-line-of-sight attenuation present distinct challenges. To enable robust network localization, we present Sparse Matrix Inference and Linear Embedding (SMILE), a novel approach which draws on both the well-known Locally Linear Embedding (LLE) algorithm and recent advances in sparse plus low-rank matrix decomposition. We demonstrate that our approach is robust to noisy signal propagation, severe attenuation due to non-line-of-sight, and missing pairwise measurements. Our experiments include simulated large-scale networks, an 11-node sensor network, and an 18-node network of mobile robots and static anchor radios in a GPS-denied limestone mine. Our findings indicate that SMILE outperforms classical multidimensional scaling (MDS) which ignores the effect of non-line of sight (NLOS), as well as outperforming state-of-the-art robust network localization algorithms that do account for NLOS attenuation including a graph convolutional network-based approach. We demonstrate that this improved accuracy is not at the cost of complexity, as SMILE sees reduced computation time for very large networks which is important for position estimation updates in a dynamic setting, e.g for mobile robots.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑