In this paper, the problem of recursively estimating the state uncertainty set of a discrete-time linear dynamical system is addressed. A novel approach based on minimum-volume bounding parallelotopes is introduced and an algorithm of polynomial complexity is derived. Simulation results and performance comparisons with ellipsoidal recursive state-bounding algorithms are also given. Copyright (C) 1996 Elsevier Science Ltd.
L., C., Garulli, A., G., Z. (1996). Recursive state bounding by parallelotopes. AUTOMATICA, 32(7), 1049-1055 [10.1016/0005-1098(96)00048-9].
Recursive state bounding by parallelotopes
GARULLI, ANDREA;
1996-01-01
Abstract
In this paper, the problem of recursively estimating the state uncertainty set of a discrete-time linear dynamical system is addressed. A novel approach based on minimum-volume bounding parallelotopes is introduced and an algorithm of polynomial complexity is derived. Simulation results and performance comparisons with ellipsoidal recursive state-bounding algorithms are also given. Copyright (C) 1996 Elsevier Science Ltd.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
https://hdl.handle.net/11365/29369
Attenzione
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo