Book Description

Despite its sub-optimality, Model Predictive Control (MPC) has received much attention over the recent decades due to its ability to handle constraints. In particular, stochastic MPC, which includes uncertainty in the system dynamics, is one of the most active recent research topics in MPC. In this dissertation, we focus on (1) increasing computation speed of constrained stochastic MPC of linear systems with additive noise and, (2) improving the accuracy of an approximate solution involving systems with additive and multiplicative noise. Constrained MPC for linear systems with additive noise has been successfully formulated as a semidefinite programming problem (SDP) using the Youla parameterization or innovation feedback and linear matrix inequalities. Unfortunately, this method can be prohibitively slow even for problems with moderate size state. Thus, in this thesis we develop an interior point algorithm which can more efficiently solve the problem. This algorithm converts the stochastic problem into a deterministic one using the mean and the covariance matrix as the system state and using affine feedback. A line search interior point method is then directly applied to the nonlinear deterministic optimization problem. In the process, we take advantage of a recursive structure that appears when a control problem is solved via the line search interior point method in order to decrease the algorithmic complexity of the solution. We compare the computation time and complexity of our algorithm against an SDP solver. The second part of the dissertation deals with systems with additive and multiplicative noise under probabilistic constraints. This class of systems differs from the additive noise case in that the probability distribution of a state is neither Gaussian nor known in closed form. This causes a problem when the probability constraints are dealt with. In previous studies, this problem has been tackled by approximating the state as a Gaussian random variable or by approximating the probability bound as an ellipsoid. In this dissertation, we use the Cornish-Fisher expansion to approximate the probability bounds of the constraints. Since the Cornish-Fisher expansion utilizes quantile values with the first several moments, the probabilistic constraints have the same form as those in the additive noise case when the constraints are converted to deterministic ones. This makes the procedure smooth when we apply the developed algorithm to a linear system with multiplicative noise. Moreover, we can easily extend the application of the algorithm to a linear system with additive plus multiplicative noise.