Invariant set constructions for feasible reference tracking

Abstract : Model predictive control strategy is based on the iterative resolution of a constrained optimization problem. In thsi context, the feasibility represents a central issue. The present paper concentrates on the use of the invariant sets to guarantee the feasibility of the predictive control law for reference tracking applications. In a first stage, two basic algorithms to approximate the maximal invariant set (MPI) will be presented. The first one proposes set iterations using a contraction procedure, while the second one uses an expansive construction. In a second stage, these procedures are adapted for the computation of feasible reference tracking (FRT) sets.
Document type :
Conference papers
Complete list of metadatas

https://hal-supelec.archives-ouvertes.fr/hal-00418330
Contributor : Josiane Dartron <>
Submitted on : Friday, September 18, 2009 - 9:47:19 AM
Last modification on : Saturday, September 15, 2018 - 1:03:05 AM

Identifiers

Collections

Citation

Hichem Benlaoukli, Sorin Olaru. Invariant set constructions for feasible reference tracking. 2009 IEEE International Conference on Control and Automation (ICCA), Dec 2009, Christchurch, New Zealand. pp.972-977, ⟨10.1109/ICCA.2009.5410423⟩. ⟨hal-00418330⟩

Share

Metrics

Record views

101