arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1707.08781eess.SYcs.SY
收藏

基于共识的联合目标跟踪与传感器定位

Consensus-based joint target tracking and sensor localization

School of Electronic Engineering, Center for Cyber Security, University of Electronic Science and Technology of China(电子科技大学电子工程学院网络安全中心);Dipartimento di Ingegneria dell’Informazione (DINFO), Università degli Studi di Firenze(佛罗伦萨大学信息与工程学院)

Lin Gao, Giorgio Battistelli, Luigi Chisci, Ping Wei

AI总结:

本文提出基于共识的卡尔曼滤波方法,用于分布式无线传感器网络中的目标跟踪与传感器自定位,通过平均加权Kullback-Leibler散度作为代价函数,并引入在线技术优化漂移参数,实验验证了算法的有效性。

摘要:

本文扩展了基于共识的卡尔曼滤波,用于解决分布式无线传感器网络中的联合目标跟踪和传感器自定位问题。平均加权Kullback-Leibler散度,作为未知漂移参数的函数,被用作衡量融合后验分布与本地分布之间差异的代价。进一步,提出了一种合理的代价近似,并引入在线技术来最小化存储在每个节点中的漂移参数的近似代价函数。所提算法的特点是不需要额外的数据交换,仅略微增加内存空间和计算负载,与标准共识卡尔曼滤波相当。最后,通过在树形网络和含环网络以及线性和非线性传感器上的仿真实验验证了所提算法的有效性。

英文摘要:

In this paper, consensus-based Kalman filtering is extended to deal with the problem of joint target tracking and sensor self-localization in a distributed wireless sensor network. The average weighted Kullback-Leibler divergence, which is a function of the unknown drift parameters, is employed as the cost to measure the discrepancy between the fused posterior distribution and the local distribution at each sensor. Further, a reasonable approximation of the cost is proposed and an online technique is introduced to minimize the approximated cost function with respect to the drift parameters stored in each node. The remarkable features of the proposed algorithm are that it needs no additional data exchanges, slightly increased memory space and computational load comparable to the standard consensus-based Kalman filter. Finally, the effectiveness of the proposed algorithm is demonstrated through simulation experiments on both a tree network and a network with cycles as well as for both linear and nonlinear sensors.

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

↑