On a stochastic sensor selection algorithm with applications in sensor scheduling and sensor coverage

  • Authors:

  • Vijay Gupta;Timothy H. Chung;Babak Hassibi;Richard M. Murray

  • Affiliations:

  • Division of Engineering and Applied Science, California Institute of Technology, Pasadena, USA;Division of Engineering and Applied Science, California Institute of Technology, Pasadena, USA;Division of Engineering and Applied Science, California Institute of Technology, Pasadena, USA;Division of Engineering and Applied Science, California Institute of Technology, Pasadena, USA

  • Venue:
  • Automatica (Journal of IFAC)
  • Year:
  • 2006

Quantified Score

Hi-index 22.17

Visualization

Abstract

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.