Saturated Tracking Control for Input Amplitude Constrained Linear Systems in the Presence of the Energy-bounded Disturbances

2019 ◽  
Author(s):  
Zhongyi Gong ◽  
Jian Ma
Keyword(s):  
Linear Systems ◽  
Tracking Control ◽  
Input Amplitude ◽  
Constrained Linear Systems ◽  
Bounded Disturbances

scholarly journals Ellipsoidal Set Based Command Governors for Constrained Linear Systems with Bounded Disturbances

2021 ◽  
Author(s):  
Nguyen Hoai Nam
Keyword(s):  
Linear Systems ◽  
Computational Efficiency ◽  
Attractive Alternative ◽  
Feasible Set ◽  
Computational Burden ◽  
Numerical Examples ◽  
Constrained Linear Systems ◽  
Bounded Disturbances ◽  
Polyhedral Set ◽  
Almost All

This paper provides a solution for a linear command governor (CG) that employs invariant and constraint-admissible ellipsoid. The motivation is to substitute the typical polyhedral set used in almost all CG schemes with the ellipsoidal one, which is much easier to construct. However the price for this offline computational efficiency is that the size of the feasible set can be relatively small, and the online computational burden is heavier than that of polyhedral set based CGs. The proposed solution overcomes these two weaknesses and offers a very attractive alternative to polyhedral set based CG. Two numerical examples with comparison to earlier solutions from the literature illustrate the effectiveness of the proposed algorithm.

Dead-time compensation of constrained linear systems with bounded disturbances: output feedback case

2013 ◽  
Vol 7 (1) ◽  
pp. 52-59 ◽  
Author(s):  
Tito L. M. Santos ◽  
Guilherme V. Raffo ◽  
Julio E. Normey-Rico ◽  
Daniel Limon
Keyword(s):  
Linear Systems ◽  
Output Feedback ◽  
Dead Time ◽  
Constrained Linear Systems ◽  
Bounded Disturbances ◽  
Dead Time Compensation

scholarly journals Ellipsoidal Set Based Command Governors for Constrained Linear Systems with Bounded Disturbances

2021 ◽  
Author(s):  
Nguyen Hoai Nam
Keyword(s):  
Linear Systems ◽  
Computational Efficiency ◽  
Attractive Alternative ◽  
Feasible Set ◽  
Computational Burden ◽  
Numerical Examples ◽  
Constrained Linear Systems ◽  
Bounded Disturbances ◽  
Polyhedral Set ◽  
Almost All

This paper provides a solution for a linear command governor (CG) that employs invariant and constraint-admissible ellipsoid. The motivation is to substitute the typical polyhedral set used in almost all CG schemes with the ellipsoidal one, which is much easier to construct. However the price for this offline computational efficiency is that the size of the feasible set can be relatively small, and the online computational burden is heavier than that of polyhedral set based CGs. The proposed solution overcomes these two weaknesses and offers a very attractive alternative to polyhedral set based CG. Two numerical examples with comparison to earlier solutions from the literature illustrate the effectiveness of the proposed algorithm.

Sign in / Sign up

Export Citation Format

Share Document