This paper addresses system identification using binary-valued sensors in a worst-case setting. The first contribution is an upper bound on time complexity for identification of FIR models, which improves over existing bounds in the literature. The second result concerns the solution of the optimal input design problem for identification of a scalar gain. It is shown that the two contributions can be combined to construct suboptimal input signals for identification of FIR models of arbitrary order.
Casini, M., Garulli, A., Vicino, A. (2007). Time complexity and input design in worst-case identification using binary sensors. In Proceedings of the 46th IEEE Conference on Decision and Control (pp.5528-5533) [10.1109/CDC.2007.4434445].
Time complexity and input design in worst-case identification using binary sensors
CASINI, MARCO;GARULLI, ANDREA;VICINO, ANTONIO
2007-01-01
Abstract
This paper addresses system identification using binary-valued sensors in a worst-case setting. The first contribution is an upper bound on time complexity for identification of FIR models, which improves over existing bounds in the literature. The second result concerns the solution of the optimal input design problem for identification of a scalar gain. It is shown that the two contributions can be combined to construct suboptimal input signals for identification of FIR models of arbitrary order.File | Dimensione | Formato | |
---|---|---|---|
CDC07-bin-finale.pdf
non disponibili
Tipologia:
Post-print
Licenza:
NON PUBBLICO - Accesso privato/ristretto
Dimensione
205.29 kB
Formato
Adobe PDF
|
205.29 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
https://hdl.handle.net/11365/21792
Attenzione
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo