.png){kind=icon}
返回
Sensor resource allocation for tracking using outer approximation
.png){kind=icon}
PRE
AI
DOI：10.1109/LSP.2006.884007.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this letter, we consider the problem of activating the optimal combination of sensors to track a target moving through a network of sensors. Our objective is to minimize the predicted, approximate error in the target position estimate subject to constraints on sensor usage and sensor-usage costs. We formulate the scheduling problem as a binary convex programming problem and solve it using the outer approximation (OA) algorithm. We apply the proposed OA scheduling method to the scenario of tracking an underwater target using a network of active sensors. We demonstrate using Monte Carlo simulations that our OA scheduling method obtains optimal solutions to scheduling problems of up to 70 sensors in the order of seconds.
Keyword:
binary programming
outer approximation (OA)
resource allocation
sensor scheduling
target tracking
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
9.6
论文数:
1.1W
被引数:
1.7W
机构
暂无机构信息
引用论文
A thermally robust and thickness independent ferroelectric phase in laminated hafnium zirconium oxide.png)
AIP Advances
OAAI
AIP AdvancesIF0
OAAI分享收藏分享收藏 没有更多内容
没有更多内容