By Topic

Fast Sensor Scheduling for Spatially Distributed Sensors

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Arai, S. ; Dept. of Syst. Inf. Sci., Tohoku Univ., Sendai, Japan ; Iwatani, Y. ; Hashimoto, K.

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.

Published in:

Automatic Control, IEEE Transactions on  (Volume:56 ,  Issue: 8 )