Name
Abstract | ||
|---|---|---|
In this paper, we consider estimating the state of a linear time-invariant system over a network subject to limited sensor communications. A sensor locally computes the state estimate for the system from its observations and send it to a remote estimator under the constraint that the total transmission times are no more than a pre-specified value. The sensor needs to decide when to send the local estimate in order to minimize the average estimation error covariance at the remote estimator. Offline scheduling and online scheduling policies are two typical solutions. The main contribution of this paper is that we propose a novel form of hybrid scheduling policies, which combine the two conventional ones and demonstrate that the estimator performance is improved when compared with the optimal offline schedule while the computation complexity is reduced when compared with the optimal online schedule. Therefore, the proposed schedules provide a trade-off between the two classic approaches in terms of estimation quality and computation complexity. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1109/ACSSC.2013.6810223 | 2013 ASILOMAR CONFERENCE ON SIGNALS, SYSTEMS AND COMPUTERS |
Keywords | Field | DocType |
kalman filters,schedules,vectors | Mathematical optimization,Fair-share scheduling,Computer science,Real-time computing,Schedule,Rate-monotonic scheduling,Earliest deadline first scheduling,Dynamic priority scheduling,Round-robin scheduling,Hybrid Scheduling,Estimator | Conference |
ISSN | Citations | PageRank |
1058-6393 | 0 | 0.34 |
References | Authors | |
6 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Chao Yang | 1 | 34 | 3.89 |
| Ling Shi | 2 | 1717 | 107.86 |
| Wann-Jiun Ma | 3 | 42 | 6.20 |