arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1203.6243eess.SYcs.ROcs.SY
收藏

多步传感器调度的最优剪枝

Optimal Pruning for Multi-Step Sensor Scheduling

AGT Group (R&D) GmbH(AGT集团(研发)有限公司)

Marco F. Huber

AI总结:

针对线性高斯传感器调度问题,提出基于信息矩阵和Riccati方程单调性的信息剪枝算法,以计算高效地最小化多步估计误差。

摘要:

在所考虑的线性高斯传感器调度问题中,仅从一组传感器中选择一个传感器进行测量。为了以计算可行的方式最小化多个时间步上的估计误差,提出了所谓基于信息的剪枝算法。该算法利用传感器的信息矩阵和Riccati方程的单调性,从而能够根据传感器的信息贡献进行排序,并将许多传感器从调度中排除。此外,为分支定界搜索计算了一个紧的下界,进一步提高了剪枝性能。

英文摘要:

In the considered linear Gaussian sensor scheduling problem, only one sensor out of a set of sensors performs a measurement. To minimize the estimation error over multiple time steps in a computationally tractable fashion, the so-called information-based pruning algorithm is proposed. It utilizes the information matrices of the sensors and the monotonicity of the Riccati equation. This allows ordering sensors according to their information contribution and excluding many of them from scheduling. Additionally, a tight lower is calculated for branch-and-bound search, which further improves the pruning performance.

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

↑