Linear quadratic feasible predictive control
type: Item
instance of: scholarly article
title: Linear quadratic feasible predictive control
zbMATH Open document ID: 0934.93026
DOI: 10.1016/S0005-1098(98)80012-5
author: J. Rossiter
author: Basil Kouvaritakis
author: Mark Cannon
published in: Automatica
publication date: 2000-04-25T00:00:00Z
review text: A linear quadratic feasible predictive control (LQFPC) algorithm is proposed. The LQFPC gives comparable performance to the recently developed linear quadratic constrained predictive control (LQCPC) and linear quadratic infinite horizon predictive control (LQIHPC) algorithms. The proposed LQFPC algorithm ``centres'' predictions around a ``mean level'' control strategy and thus overcomes (under same weak assumptions) the feasibility difficulties associated with LQCPC. In addition, LQFPC uses a prediction class which converges to the ``feasible unconstrained optimal'' and offers thus an alternative to the set-point conditioning associated with the LQIHPC algorithm. Numerical examples illustrate the advantages of LQFPC at the expense of a modest, often insignificant increase in the final value of the cost function.
Mathematics Subject Classification ID: 93B51
zbMATH DE Number: 1325640
zbMATH Keywords: feasibility
zbMATH Keywords: linear quadratic feasible predictive control
zbMATH Keywords: set-point conditioning
reviewed by: Ingmar Randvee
MaRDI profile type: Publication
full work available at URL: s0005-1098(98)80012-5
OpenAlex ID: W1984686263
description: scientific article; zbMATH DE number 1325640