LAUSR

Abstract This paper explores the concept of periodic invariance and its use for trajectory tracking problems subject to state and input constraints, offering important computational advantages. In principle, traditional techniques based on receding horizon optimization are computationally expensive due to long prediction and optimization horizons, and number of control and state constraints in a constrained control problem. Their complexity is further affected by additional constraints needed to ensure recursive feasibility via a controllable invariant set. Practically, such invariant sets are difficult to obtain off-line and use them on-line. To overcome this problem, this paper suggests to employ periodic invariant sets as a simple set-theoretic tool for constrained reference tracking problems.