.png){kind=icon}
返回
Sensor Scheduling for Target Tracking by Suboptimal Algorithms
.png){kind=icon}
PRE
AI
DOI：10.1109/TVT.2008.927726.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We analyze the problem of tracking a single target, from which measurements are taken using noisy sensors. Each measurement is associated with the measurement error, usage cost, and physical and computational constraints. As it is acceptable for many real applications that target dynamics are modeled as a linear system that is impaired by white Gaussian noise. Moreover, it is assumed that sensor measurements are linearly distributed with white Gaussian noise. Optimal sensor scheduling is achieved by finding the sensor sequence that minimizes the total cost, which consists of the measurement error and sensor usage cost for the entire time horizon subject to specific system constraints. To handle this discrete optimization problem, we propose well-performing suboptimal methods for different energy constraints in sensor nodes. First, we propose a suboptimal method called the best step look-ahead technique, which performs very well when the energy constraints can safely be removed due to their negligible influence on the overall system. We also show that, under certain assumptions, the Viterbi algorithm can be applied as a suboptimal method to obtain attractive results. Second, the energy constraints are relaxed using Lagrangian multipliers to formulate the problem as a Min-Max optimization problem. We use particle swarm optimization to tune the Lagrangian multipliers and Viterbi algorithm to find the optimal sensor sequence. To illustrate the effectiveness of our algorithms in realistic settings, we study a numerical problem of single target tracking with several noisy sensors and convincingly show that the proposed methods perform better than existing methods.
Keyword:
Katman filtering
particle swarm optimization (PSO)
sensor scheduling
target tracking
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.1
论文数:
1.8W
被引数:
6.6W
机构
引用论文
分享收藏分享收藏Distributed particle swarm optimization and simulated annealing for energy-efficient coverage in wireless sensor networks.png)
SENSORS
OAAI
SENSORSIF3.5
OAAI分享收藏
查看更多内容