一种用于大规模传感器网络中近最优传感器调度的随机贪心算法
A Randomized Greedy Algorithm for Near-Optimal Sensor Scheduling in Large-Scale Sensor Networks
AI总结:
本文提出一种随机贪心算法,用于在资源受限的线性动态系统中选择少量传感器进行状态估计,通过分析曲率特性,得出估计误差的上界,并通过仿真验证了算法的有效性。
摘要:
我们研究了在资源受限的线性动态系统中调度传感器的问题,目标是从大规模网络中选择少量传感器进行状态估计。我们将该问题表述为在matroid约束下最大化单调集函数的问题。我们提出了一种随机贪心算法,其速度显著快于现有方法。通过引入曲率的概念,量化函数与子模函数的接近程度,我们分析了所提算法的性能,并得出了估计器所用传感器的预期均方误差(MSE)与最优MSE之间的界限。此外,我们推导了在测量为独立同分布随机向量且具有有界$\ell_2$范数的情况下曲率的概率界限。仿真结果展示了随机贪心算法在与贪心和半定规划松弛方法的比较中的有效性。
英文摘要:
We study the problem of scheduling sensors in a resource-constrained linear dynamical system, where the objective is to select a small subset of sensors from a large network to perform the state estimation task. We formulate this problem as the maximization of a monotone set function under a matroid constraint. We propose a randomized greedy algorithm that is significantly faster than state-of-the-art methods. By introducing the notion of curvature which quantifies how close a function is to being submodular, we analyze the performance of the proposed algorithm and find a bound on the expected mean square error (MSE) of the estimator that uses the selected sensors in terms of the optimal MSE. Moreover, we derive a probabilistic bound on the curvature for the scenario where{\color{black}{ the measurements are i.i.d. random vectors with bounded $\ell_2$ norm.}} Simulation results demonstrate efficacy of the randomized greedy algorithm in a comparison with greedy and semidefinite programming relaxation methods.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。