Paul A. Trodden

Pablo R Baldivieso-Monasterios, Paul A. Trodden

The use of available disturbance predictions within a nominal model predictive control formulation is studied. The main challenge that arises is the loss of recursive feasibility and stability guarantees when a persistent disturbance is present in the model and on the system. We show how standard stabilizing terminal conditions may be modified to account for the use of disturbances in the prediction model. Robust stability and feasibility are established under the assumption that the disturbance change across sampling instances is limited.

Bernardo A. Hernandez, Paul A. Trodden

A new adaptive predictive controller for constrained linear systems is presented. The main feature of the proposed controller is the partition of the input in two components. The first part is used to persistently excite the system, in order to guarantee accurate and convergent parameter estimates in a deterministic framework. An MPC-inspired receding horizon optimization problem is developed to achieve the required excitation in a manner that is optimal for the plant. The remaining control action is employed by a conventional tube MPC controller to regulate the plant in the presence of parametric uncertainty and the excitation generated for estimation purposes. Constraint satisfaction, robust exponential stability, and convergence of the estimates are guaranteed under design conditions mildly more demanding than that of standard MPC implementations.

Romain Guicherd, Paul A. Trodden, Andrew R. Mills et al.

The partitioning of a system model will condition the structure of the controller as well as its design. In order to partition a system model, one has to know what states and inputs to group together to define subsystem models. For a given partitioning, the total magnitude of the interactions between subsystem models is evaluated. Therefore, the partitioning problem seeking for weak interactions can be posed as a minimization problem. Initially, the problem is formulated as a non-linear integer minimization that is then relaxed into a linear integer programming problem. It is shown within this paper that cuts can be applied to the initial search space in order to find the least interacting partitioning; only composed of controllable subsystems. Two examples are given to demonstrate the methodology.