Input Constrained Receding Horizon H$_{\infty}$ Control: Quadratic Programming Approach

  • Lee, Young-Il (Department of Control and Instrumentation, Seoul National University of Technology)
  • Published : 2003.06.01

Abstract

This work is a modified version of an earlier work that was based on ellipsoidal type feasible sets. Unlike the earlier work, polyhedral types of invariant and feasible sets are adopted to deal with input constraints. The use of polyhedral sets enables the formulation of on-line algorithm in terms of QP (Quadratic Programming), which can be solved more efficiently than semi-def algorithms. A simple numerical example shows that the proposed method yields larger stabilizable sets with greater bounds on disturbances than is the case in the earlier approach.

Keywords

References

  1. IEE Proc.-D v.147 no.2 Receding horizon $H_{\infty}$ predictive control for systems with input saturation Y. I. Lee;B. Kouvaritakis
  2. Int. J. of Control v.72 no.11 Constrained receding horizon predictive control for systems with disturbances Y. I. Lee;B. Kouvaritakis
  3. IEEE Trans. on AC v.45 no.9 A linear programming approach to constrained robust predictive control Y. I. Lee;B. Kouvaritakis
  4. IEEE Trans. on AC v.36 no.8 A dynamic games approach to controller design: Disturbance rejection in discretetime T. Basar
  5. Int. J. of Control v.68 no.2 Receding Horizon $H_{\infty}$ control for time-varying discrete linear systems J. W. Lee;W. H. Kwon;J. H. Lee
  6. IEEE Trans on AC v.35 Minimum $H_{\infty}$ norm regulation of linear discrete-time systems and its relation to linear quadratic discrete games I. Yaesh;U. Shaked