On a stochastic sensor selection algorithm with applications in sensor scheduling and sensor coverage
On a stochastic sensor selection algorithm with applications in sensor scheduling and sensor coverage
复制标题
DOI：
10.1016/j.automatica.2005.09.016
复制
发表时间：
2006-02-01
期刊：
影响因子：
6.4
通讯作者：
Murray, RM
中科院分区：
文献类型：
--
作者：
Gupta, V;Chung, TH;Murray, RM
在本说明中，我们考虑以下问题。假设一组传感器正在共同尝试估计一个过程。一个传感器在每个时间步进行测量，然后在所有传感器之间交换测量结果。导致误差协方差最小的传感器调度是什么？我们描述了一种易于实现且易于计算的随机传感器选择策略。上述问题出现在许多领域，我们讨论其中两个领域。在传感器选择问题中，存在多个传感器不能同时工作（例如同一频段的声纳）。因此需要安排测量。在传感器覆盖问题中，地理区域需要由移动传感器覆盖，每个传感器的范围有限。因此，从每个位置，传感器都会获得该区域的不同视角，并且传感器需要优化其轨迹。该算法应用于这些问题并通过简单的例子进行说明。 (c) 2005 Elsevier Ltd. 保留所有权利。
In this note we consider the following problem. Suppose a set of sensors is jointly trying to estimate a process. One sensor takes a measurement at every time step and the measurements are then exchanged among all the sensors. What is the sensor schedule that results in the minimum error covariance? We describe a stochastic sensor selection strategy that is easy to implement and is computationally tractable. The problem described above comes up in many domains out of which we discuss two. In the sensor selection problem, there are multiple sensors that cannot operate simultaneously (e.g., sonars in the same frequency band). Thus measurements need to be scheduled. In the sensor coverage problem, a geographical area needs to be covered by mobile sensors each with limited range. Thus from every position, the sensors obtain a different view-point of the area and the sensors need to optimize their trajectories. The algorithm is applied to these problems and illustrated through simple examples. (c) 2005 Elsevier Ltd. All rights reserved.