传感器选择问题中贪心算法的界计算
On Calculation of Bounds for Greedy Algorithms when Applied to Sensor Selection Problems
摘要:
研究了贪心算法在具有卡尔曼滤波器的稳定线性系统传感器选择问题中的性能。具体地说,目标是找到影响贪心算法性能的系统参数和条件下,贪心算法总是产生最优解。在本文中,我们开发了贪婪算法的性能比的上限,这是基于博士张\cite{Sundaram}的工作,并提供了有价值的洞察系统参数,影响贪心算法的性能。我们还提出了一组条件,贪心算法将始终产生最优解。然后,我们在仿真中显示如何在这项工作中推导出的性能比界所提到的系统参数影响的性能的贪心算法。
英文摘要:
We consider the problem of studying the performance of greedy algorithm on sensor selection problem for stable linear systems with Kalman Filter. Specifically, the objective is to find the system parameters that affects the performance of greedy algorithms and conditions where greedy algorithm always produces optimal solutions. In this paper, we developed an upper bound for performance ratio of greedy algorithm, which is based on the work of Dr.Zhang \cite{Sundaram} and offers valuable insight into the system parameters that affects the performance of greedy algorithm. We also proposes a set of conditions where greedy algorithm will always produce the optimal solution. We then show in simulations how the system parameters mentioned by the performance ratio bound derived in this work affects the performance of greedy algorithm.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。