ORIHUELA ESPINA, DIEGO LUIS, Barreiro, Antonio , GÓMEZ-ESTERN AGUILAR, FABIO, Rubio, Francisco R.
No
Automatica
Article
Científica
3.02
3.228
01/10/2014
000344207300027
2-s2.0-84908139355
In this paper, the sensor scheduling problem for estimation is tackled, in which a set of sensors must share a common network to communicate their measurements. It is shown that, under some mild conditions, a Kalman-based scheduled filter results in a periodic selection of the sensors. In those cases, the computational cost and energy consumption can be reduced, as the sensors can await asleep between two consecutive measurements. A suboptimal one-step ahead strategy is thoroughly studied as a possible example of observation scheme. (C) 2014 Elsevier Ltd. All rights reserved.
Sensor scheduling; Kalman filter; Periodic observers