- Title
- Performance vs complexity trade-offs for Markovian networked jump estimators
- Creator
- Dolz, D.; Quevedo, D. E.; Peñarrocha, I.; Sanchis, R.
- Relation
- 19th World Congress of the International Federation of Automatic Control (IFAC 2014). Proceedings of the 19th IFAC World Congress, 2014 (Cape Town, South Africa 24-29 August, 2014) p. 7412-7417
- Publisher Link
- http://dx.doi.org/10.3182/20140824-6-ZA-1003.00632
- Publisher
- International Federation of Automatic Control (IFAC)
- Resource Type
- conference paper
- Date
- 2014
- Description
- This paper addresses the design of a state observer for networked systems with random delays and dropouts. The model of plant and network covers the cases of multiple sensors, out-of-sequence and buffered measurements. The measurement outcomes over a finite interval model the network measurement reception scenarios, which follow a Markov distribution. We present a tractable optimization problem to precalculate off-line a finite set of gains of jump observers. The proposed procedure allows us to trade the complexity of the observer implementation for achieved performance. Several examples illustrate that the on-line computational cost of the observer implementation is lower than that of the Kalman filter, whilst the performance is similar.
- Subject
- control and estimation with data loss; sensor networks; gain scheduling
- Identifier
- http://hdl.handle.net/1959.13/1296710
- Identifier
- uon:19291
- Identifier
- ISBN:9783902823625
- Language
- eng
- Reviewed
- Hits: 1285
- Visitors: 1199
- Downloads: 0
| Thumbnail | File | Description | Size | Format |
|---|