An active set solver for input-constrained robust receding horizon control

An efficient optimization procedure is proposed for computing a receding horizon control law for linear systems with constrained control inputs and additive disturbances. The procedure uses an active set method to solve the dynamic programming problem associated with the min-max optimization of a pr...

Descripción completa

Detalles Bibliográficos
Autores principales: Buerger, J, Cannon, M, Kouvaritakis, B, IEEE
Formato: Conference item
Publicado: 2011
_version_ 1826286201510821888
author Buerger, J
Cannon, M
Kouvaritakis, B
IEEE
author_facet Buerger, J
Cannon, M
Kouvaritakis, B
IEEE
author_sort Buerger, J
collection OXFORD
description An efficient optimization procedure is proposed for computing a receding horizon control law for linear systems with constrained control inputs and additive disturbances. The procedure uses an active set method to solve the dynamic programming problem associated with the min-max optimization of a predicted cost. The active set at the solution is determined at each sampling instant as a function of the current system state using the first-order necessary conditions for optimality. The computational complexity of each iteration is linear in the length of the prediction horizon. We discuss conditions for stability and bounds on state and input l 2-norms in closed loop operation. © 2011 IEEE.
first_indexed 2024-03-07T01:40:15Z
format Conference item
id oxford-uuid:969d0af6-d9a2-40f2-8007-34e433b61b40
institution University of Oxford
last_indexed 2024-03-07T01:40:15Z
publishDate 2011
record_format dspace
spelling oxford-uuid:969d0af6-d9a2-40f2-8007-34e433b61b402022-03-26T23:54:04ZAn active set solver for input-constrained robust receding horizon controlConference itemhttp://purl.org/coar/resource_type/c_5794uuid:969d0af6-d9a2-40f2-8007-34e433b61b40Symplectic Elements at Oxford2011Buerger, JCannon, MKouvaritakis, BIEEEAn efficient optimization procedure is proposed for computing a receding horizon control law for linear systems with constrained control inputs and additive disturbances. The procedure uses an active set method to solve the dynamic programming problem associated with the min-max optimization of a predicted cost. The active set at the solution is determined at each sampling instant as a function of the current system state using the first-order necessary conditions for optimality. The computational complexity of each iteration is linear in the length of the prediction horizon. We discuss conditions for stability and bounds on state and input l 2-norms in closed loop operation. © 2011 IEEE.
spellingShingle Buerger, J
Cannon, M
Kouvaritakis, B
IEEE
An active set solver for input-constrained robust receding horizon control
title An active set solver for input-constrained robust receding horizon control
title_full An active set solver for input-constrained robust receding horizon control
title_fullStr An active set solver for input-constrained robust receding horizon control
title_full_unstemmed An active set solver for input-constrained robust receding horizon control
title_short An active set solver for input-constrained robust receding horizon control
title_sort active set solver for input constrained robust receding horizon control
work_keys_str_mv AT buergerj anactivesetsolverforinputconstrainedrobustrecedinghorizoncontrol
AT cannonm anactivesetsolverforinputconstrainedrobustrecedinghorizoncontrol
AT kouvaritakisb anactivesetsolverforinputconstrainedrobustrecedinghorizoncontrol
AT ieee anactivesetsolverforinputconstrainedrobustrecedinghorizoncontrol
AT buergerj activesetsolverforinputconstrainedrobustrecedinghorizoncontrol
AT cannonm activesetsolverforinputconstrainedrobustrecedinghorizoncontrol
AT kouvaritakisb activesetsolverforinputconstrainedrobustrecedinghorizoncontrol
AT ieee activesetsolverforinputconstrainedrobustrecedinghorizoncontrol