Constrained cautious stable predictive control

Terminal constraints provide for stable predicted trajectories and thus form the basis of predictive control algorithms with guaranteed stability. In the presence of system input constraints, however, stability is dependent on a feasibility assumption, namely that it is possible to meet the terminal...

Full description

Bibliographic Details
Main Authors: Rossiter, J, Gossner, JR, Kouvaritakis, B
Format: Journal article
Language:English
Published: 1997
_version_ 1797091766387605504
author Rossiter, J
Gossner, JR
Kouvaritakis, B
author_facet Rossiter, J
Gossner, JR
Kouvaritakis, B
author_sort Rossiter, J
collection OXFORD
description Terminal constraints provide for stable predicted trajectories and thus form the basis of predictive control algorithms with guaranteed stability. In the presence of system input constraints, however, stability is dependent on a feasibility assumption, namely that it is possible to meet the terminal constraints with the allowable inputs. The terminal constraints used to date are only sufficient and lead to highly tuned controllers with high input activity which may cause infeasibility with a consequent loss of the guarantee of stability. Here we overcome this problem by deriving conditions which are both necessary and sufficient. Use of these leads to an increase in the degrees of freedom which can be used to either improve performance or reduce the relevant control horizon thereby affording significant computational advantages. The efficacy of the proposed algorithms are illustrated by means of numerical examples. © IEE, 1997.
first_indexed 2024-03-07T03:37:12Z
format Journal article
id oxford-uuid:bcb10ed3-82d8-4f84-adaf-f0c2d374c917
institution University of Oxford
language English
last_indexed 2024-03-07T03:37:12Z
publishDate 1997
record_format dspace
spelling oxford-uuid:bcb10ed3-82d8-4f84-adaf-f0c2d374c9172022-03-27T05:26:13ZConstrained cautious stable predictive controlJournal articlehttp://purl.org/coar/resource_type/c_dcae04bcuuid:bcb10ed3-82d8-4f84-adaf-f0c2d374c917EnglishSymplectic Elements at Oxford1997Rossiter, JGossner, JRKouvaritakis, BTerminal constraints provide for stable predicted trajectories and thus form the basis of predictive control algorithms with guaranteed stability. In the presence of system input constraints, however, stability is dependent on a feasibility assumption, namely that it is possible to meet the terminal constraints with the allowable inputs. The terminal constraints used to date are only sufficient and lead to highly tuned controllers with high input activity which may cause infeasibility with a consequent loss of the guarantee of stability. Here we overcome this problem by deriving conditions which are both necessary and sufficient. Use of these leads to an increase in the degrees of freedom which can be used to either improve performance or reduce the relevant control horizon thereby affording significant computational advantages. The efficacy of the proposed algorithms are illustrated by means of numerical examples. © IEE, 1997.
spellingShingle Rossiter, J
Gossner, JR
Kouvaritakis, B
Constrained cautious stable predictive control
title Constrained cautious stable predictive control
title_full Constrained cautious stable predictive control
title_fullStr Constrained cautious stable predictive control
title_full_unstemmed Constrained cautious stable predictive control
title_short Constrained cautious stable predictive control
title_sort constrained cautious stable predictive control
work_keys_str_mv AT rossiterj constrainedcautiousstablepredictivecontrol
AT gossnerjr constrainedcautiousstablepredictivecontrol
AT kouvaritakisb constrainedcautiousstablepredictivecontrol