arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1302.1616math.OC
收藏

大型传感器网络中基于广义信息增益的目标跟踪传感器选择

Sensor Selection Based on Generalized Information Gain for Target Tracking in Large Sensor Networks

Xiaojing Shen, Pramod K. Varshney

AI总结:

针对大型传感器网络目标跟踪中的约束传感器选择问题,提出基于广义信息增益的选择框架,并给出可分/不可分及相关噪声情形下的解析、线性规划与半定规划随机化求解方法。

摘要:

本文研究大型传感器网络中在具有线性等式或不等式约束条件下用于目标跟踪的传感器选择问题。首先,我们推导了一种用于传感器选择的等效 Kalman 滤波器,即广义信息滤波器。随后,在一个正则性条件下,我们证明:最小化未来多个时间步的最终估计误差协方差或平均估计误差协方差的多阶段前瞻策略,等价于在每个时间步最大化广义信息增益迹的短视传感器选择策略。此外,当各传感器之间的测量噪声互不相关且约束在时间上可分时,可以通过解析方式获得传感器选择的最优解。当约束在时间上不可分时,可通过近似求解一个线性规划问题来获得传感器选择方案,从而能够快速处理大型传感器网络中的传感器选择问题。尽管无法保证所选子集的性能与性能界之间的差距始终很小,但数值算例表明,该算法在许多情况下接近最优。最后,当传感器之间的测量噪声相关时,具有时间不可分约束的传感器选择问题可松弛为一个 Boolean 二次规划问题;该问题可通过 Gaussian 随机化过程并结合求解一个半定规划问题而得到高效处理。数值算例表明,所提出的方法明显优于忽略噪声相关性的方法。

英文摘要:

In this paper, sensor selection problems for target tracking in large sensor networks with linear equality or inequality constraints are considered. First, we derive an equivalent Kalman filter for sensor selection, i.e., generalized information filter. Then, under a regularity condition, we prove that the multistage look-ahead policy that minimizes either the final or the average estimation error covariances of next multiple time steps is equivalent to a myopic sensor selection policy that maximizes the trace of the generalized information gain at each time step. Moreover, when the measurement noises are uncorrelated between sensors, the optimal solution can be obtained analytically for sensor selection when constraints are temporally separable. When constraints are temporally inseparable, sensor selections can be obtained by approximately solving a linear programming problem so that the sensor selection problem for a large sensor network can be dealt with quickly. Although there is no guarantee that the gap between the performance of the chosen subset and the performance bound is always small, numerical examples suggest that the algorithm is near-optimal in many cases. Finally, when the measurement noises are correlated between sensors, the sensor selection problem with temporally inseparable constraints can be relaxed to a Boolean quadratic programming problem which can be efficiently solved by a Gaussian randomization procedure along with solving a semi-definite programming problem. Numerical examples show that the proposed method is much better than the method that ignores dependence of noises.

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

↑