arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1310.5251cs.ITeess.SPmath.IT
收藏

非线性测量模型的稀疏性提升传感器选择

Sparsity-Promoting Sensor Selection for Non-linear Measurement Models

Sundeep Prabhakar Chepuri, Geert Leus

摘要:

传感器选择是大规模传感器网络设计中的一个重要问题。传感器选择可以解释为选择保证一定估计性能的最佳传感器子集的问题。我们专注于与一般非线性模型相关的观察。只要观测是独立的,并且其似然满足正则性条件,该框架就是有效的。我们使用几个函数的Cramér-Rao界(CRB)作为性能指标。我们制定的传感器选择问题作为一个选择向量的设计,这在其原始形式是一个非凸l0-(准)范数优化问题。我们提出了宽松的传感器选择求解器,可以有效地解决在多项式时间。我们还提出了一个投影次梯度算法,这是有吸引力的大规模问题,也表明该算法可以很容易地分布。所提出的框架说明了一些与传感器布局设计的本地化的例子。

英文摘要:

Sensor selection is an important design problem in large-scale sensor networks. Sensor selection can be interpreted as the problem of selecting the best subset of sensors that guarantees a certain estimation performance. We focus on observations that are related to a general non-linear model. The proposed framework is valid as long as the observations are independent, and its likelihood satisfies the regularity conditions. We use several functions of the Cramér-Rao bound (CRB) as a performance measure. We formulate the sensor selection problem as the design of a selection vector, which in its original form is a nonconvex l0-(quasi) norm optimization problem. We present relaxed sensor selection solvers that can be efficiently solved in polynomial time. We also propose a projected subgradient algorithm that is attractive for large-scale problems and also show how the algorithm can be easily distributed. The proposed framework is illustrated with a number of examples related to sensor placement design for localization.

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

↑