Skip to Main Content
This technical note addresses a sensor scheduling problem for a class of networked sensor systems whose sensors are spatially distributed and measurements are influenced by state dependent noise. A concept of sensor types is introduced without loss of generality to reduce combinatorial complexity. The computation time of the proposed algorithm increases exponentially with the number of the sensor types, while that of standard algorithms is exponential in the number of the sensors. This confirms high speed performance of the proposed algorithm, since the number of sensor types is usually far less than the number of sensors.