It is shown that the Generalized Predictive Control (GPC) law for an n-th order plant and N-step prediction horizon can be computed in O(Nn) processing time on a serial processor and in O ( N ) time on a linear array of O(n) processors.
Fast parallel algorithms for predictive control / L. Chisci; A. Garulli; G. Zappa. - STAMPA. - (1994), pp. 1248-1253. (Intervento presentato al convegno IEE International Conference CONTROL 1994 tenutosi a Coventry, United Kingdom) [10.1049/cp:19940316].
Fast parallel algorithms for predictive control
CHISCI, LUIGI;ZAPPA, GIOVANNI
1994
Abstract
It is shown that the Generalized Predictive Control (GPC) law for an n-th order plant and N-step prediction horizon can be computed in O(Nn) processing time on a serial processor and in O ( N ) time on a linear array of O(n) processors.
File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
IEE94.pdf
Accesso chiuso
Tipologia:
Versione finale referata (Postprint, Accepted manuscript)
Licenza:
Tutti i diritti riservati
Dimensione
356.43 kB
Formato
Adobe PDF
|
356.43 kB | Adobe PDF | Richiedi una copia |
I documenti in FLORE sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
