Imperial College London

ProfessorEricKerrigan

Faculty of EngineeringDepartment of Electrical and Electronic Engineering

Professor of Control and Optimization
 
 
 
//

Contact

 

+44 (0)20 7594 6343e.kerrigan Website

 
 
//

Assistant

 

Mrs Raluca Reynolds +44 (0)20 7594 6281

 
//

Location

 

1114Electrical EngineeringSouth Kensington Campus

//

Summary

 

Publications

Citation

BibTex format

@unpublished{McInerney:2019,
author = {McInerney, I and Kerrigan, EC and Constantinides, GA},
publisher = {arXiv},
title = {Bounding computational complexity under cost function scaling in predictive control},
url = {http://arxiv.org/abs/1902.02221v1},
year = {2019}
}

RIS format (EndNote, RefMan)

TY  - UNPB
AB - We present a framework for upper bounding the number of iterations requiredby first-order optimization algorithms implementing constrained LQRcontrollers. We derive new bounds for the condition number and extremaleigenvalues of the primal and dual Hessian matrices when the cost function isscaled. These bounds are horizon-independent, allowing for their use withreceding, variable and decreasing horizon controllers. We considerably relaxprior assumptions on the structure of the weight matrices and assume only thatthe system is Schur-stable and the primal Hessian of the quadratic program (QP)is positive-definite. Our analysis uses the Toeplitz structure of the QPmatrices to relate their spectrum to the transfer function of the system,allowing for the use of system-theoretic techniques to compute the bounds.Using these bounds, we can compute the effect on the computational complexityof trading off the input energy used against the state deviation. An examplesystem shows a three-times increase in algorithm iterations between the twoextremes, with the state 2-norm decreased by only 5% despite a greatlyincreased state deviation penalty.
AU - McInerney,I
AU - Kerrigan,EC
AU - Constantinides,GA
PB - arXiv
PY - 2019///
TI - Bounding computational complexity under cost function scaling in predictive control
UR - http://arxiv.org/abs/1902.02221v1
UR - https://arxiv.org/abs/1902.02221v1
UR - http://hdl.handle.net/10044/1/71707
ER -