Constrained linear quadratic regulation

Abstract

Abstract-This paper is a contribution to the theory of the infinitehorizon linear quadratic regulator (LQR) problem subject to inequality constraints on the inputs and states, extending an approach first proposed by Sznaier and Damborg [16]. A solution algorithm is presented, which requires solving a finite number of finite-dimensional positive definite quadratic programs. The constrained LQR outlined does not feature the undesirable mismatch between open-loop and closed-loop nominal system trajectories, which is present in the other popular forms of model predictive control (MPC) that can be implemented with a finite quadratic programming algorithm. The constrained LQR is shown to be both optimal and stabilizing. The solution algorithm is guaranteed to terminate in finite time with a computational cost that has a reasonable upper bound compared to the minimal cost for computing the optimal solution. Inherent to the approach is the removal of a tuning parameter, the control horizon, which is present in other MPC approaches and for which no reliable tuning guidelines are available. Two examples are presented that compare constrained LQR and two other popular forms of MPC. The examples demonstrate that constrained LQR achieves significantly better performance than the other forms of MPC on some plants, and the computational cost is not prohibitive for online implementation.Index Terms-Constraints, infinite horizon, linear quadratic regulation, model predictive control.

MPC for uncertain systems using the Youla parameterizations

“…we have identified S) and the state estimation errors are sufficiently small. This is a special case of the results in [11] for prestabilized systems. In [11] an algorithm is given for choosing N online.…”

Solar Sail Halo Orbit Control using Reflectivity Control Devices

“…Many rigorous design methods are available now to provide some guaranteed properties on stability. 19,20) Here, we use a simple method that saturates the control input when the control input exceeds a given saturation; that is…”

“…Equations (5) and (19) are integrated over one period to calculate matrix G and the initial condition of F. Then, Eq. (44) provides the guidance to integrate Eqs.…”

Solving the infinite-horizon constrained LQR problem using splitting techniques

“…The most wellknown effort is the work of Scokaert and Rawlings (1998), where they extend the work of Sznaier and Damborg (1987). The idea is to solve a sequence of quadratic programs (QPs) of finite horizon length, which is monotonically non-decreasing.…”