We consider sampled-data Model Predictive Control (MPC) of nonlinear continuous-time control systems. We derive sufficient conditions to guarantee recursive feasibility and asymptotic stability without stabilising costs and/or constraints. Moreover, we present formulas to explicitly estimate the required length of the prediction horizon based on the concept of (local) cost controllability. For the linear-quadratic case, cost controllability can be inferred from standard assumptions. In addition, we extend results on the relationship between the horizon length and the distance of the initial state to the boundary of the viability kernel from the discrete-time to the continuous-time setting.
In this paper we propose a model predictive control scheme for constrained fractional-order discrete-time systems. We prove that all constraints are satisfied at all time instants and we prescribe conditions for the origin to be an asymptotically stable equilibrium point of the controlled system. We employ a finite-dimensional approximation of the original infinite-dimensional dynamics for which the approximation error can become arbitrarily small. We use the approximate dynamics to design a tube-based model predictive controller which steers the system state to a neighbourhood of the origin o…
This paper is concerned with solving chance-constrained finite-horizon optimal control problems, with a particular focus on the recursive feasibility issue of stochastic model predictive control (SMPC) in terms of mission-wide probability of safety (MWPS). MWPS assesses the probability that the entire state trajectory lies within the constraint set, and the objective of the SMPC controller is to ensure that it is no less than a threshold value. This differs from classic SMPC where the probability that the state lies in the constraint set is enforced independently at each time instant. Unlike r…
This paper investigates recursive feasibility, recursive robust stability and near-optimality properties of policy iteration (PI). For this purpose, we consider deterministic nonlinear discrete-time systems whose inputs are generated by PI for undiscounted cost functions. We first assume that PI is recursively feasible, in the sense that the optimization problems solved at each iteration admit a solution. In this case, we provide novel conditions to establish recursive robust stability properties for a general attractor, meaning that the policies generated at each iteration ensure a robust \KL…
The paper investigates data-driven output-feedback predictive control of linear systems subject to stochastic disturbances. The scheme relies on the recursive solution of a suitable data-driven reformulation of a stochastic Optimal Control Problem (OCP), which allows for forward prediction and optimization of statistical distributions of inputs and outputs. Our approach avoids the use of parametric system models. Instead it is based on previously recorded data using a recently proposed stochastic variant of Willems' fundamental lemma. The stochastic variant of the lemma is applicable to a larg…
We present a data-driven model predictive control scheme for chance-constrained Markovian switching systems with unknown switching probabilities. Using samples of the underlying Markov chain, ambiguity sets of transition probabilities are estimated which include the true conditional probability distributions with high probability. These sets are updated online and used to formulate a time-varying, risk-averse optimal control problem. We prove recursive feasibility of the resulting MPC scheme and show that the original chance constraints remain satisfied at every time step. Furthermore, we show…
Quadratic Program(QP) based state-feedback controllers, whose inequality constraints bound the rate of change of control barrier(CBFs) and lyapunov function with a class-$\mathcal{K}$ function of their values, are sensitive to the parameters of these class-$\mathcal{K}$ functions. The construction of valid CBFs, however, is not straightforward, and for arbitrarily chosen parameters of the QP, the system trajectories may enter states at which the QP either eventually becomes infeasible, or may not achieve desired performance. In this work, we pose the control synthesis problem as a differential…
In this paper, we present a novel stochastic output-feedback MPC scheme for distributed systems with additive process and measurement noise. The chance constraints are treated with the concept of probabilistic reachable sets, which, under an unimodality assumption on the disturbance distributions are guaranteed to be satisfied in closed-loop. By conditioning the initial state of the optimization problem on feasibility, the fundamental property of recursive feasibility is ensured. Closed-loop chance constraint satisfaction, recursive feasibility and convergence to an asymptotic average cost bou…
We study tracking control for nonlinear systems with known relative degree and stable internal dynamics by the recently introduced technique of Funnel MPC. The objective is to achieve the evolution of the tracking error within a prescribed performance funnel. We propose a novel stage cost for Funnel MPC, extending earlier designs to the case of arbitrary relative degree, and show that the control objective as well as initial and recursive feasibility are always achieved - without requiring any terminal conditions or a sufficiently long prediction horizon. We only impose an additional feasibili…
In this paper we propose a data-driven distributionally robust Model Predictive Control framework for constrained stochastic systems with unbounded additive disturbances. Recursive feasibility is ensured by optimizing over an linearly interpolated initial state constraint in combination with a simplified affine disturbance feedback policy. We consider a moment-based ambiguity set with data-driven radius for the second moment of the disturbance, where we derive a minimum number of samples in order to ensure user-given confidence bounds on the chance constraints and closed-loop performance. The …
A novel perspective on the design of robust model predictive control (MPC) methods is presented, whereby closed-loop constraint satisfaction is ensured using recursive feasibility of the MPC optimization. Necessary and sufficient conditions are derived for recursive feasibility, based on the effects of model perturbations and disturbances occurring at one time step. Using these conditions and Farkas' lemma, sufficient conditions suitable for design are formulated. The proposed method is called a closed-loop design, as only the existence of feasible inputs at the next time step is enforced by d…
Leveraging recent developments in black-box risk-aware verification, we provide three algorithms that generate probabilistic guarantees on (1) optimality of solutions, (2) recursive feasibility, and (3) maximum controller runtimes for general nonlinear safety-critical finite-time optimal controllers. These methods forego the usual (perhaps) restrictive assumptions required for typical theoretical guarantees, e.g. terminal set calculation for recursive feasibility in Nonlinear Model Predictive Control, or convexification of optimal controllers to ensure optimality. Furthermore, we show that the…
This paper proposes a parallelizable algorithm for linear-quadratic model predictive control (MPC) problems with state and input constraints. The algorithm itself is based on a parallel MPC scheme that has originally been designed for systems with input constraints. In this context, one contribution of this paper is the construction of time-varying yet separable constraint margins ensuring recursive feasibility and asymptotic stability of sub-optimal parallel MPC in a general setting, which also includes state constraints. Moreover, it is shown how to tradeoff online run-time guarantees versus…
Massachusetts Institute of Technology（麻省理工学院）；Boston University（波士顿大学）
It has been shown that optimizing quadratic costs while stabilizing affine control systems to desired (sets of) states subject to state and control constraints can be reduced to a sequence of Quadratic Programs (QPs) by using Control Barrier Functions (CBFs) and Control Lyapunov Functions (CLFs). In this paper, we employ machine learning techniques to ensure the feasibility of these QPs, which is a challenging problem, especially for high relative degree constraints where High Order CBFs (HOCBFs) are required. To this end, we propose a sampling-based learning approach to learn a new feasibilit…
Engineered cyberphysical systems are growing increasingly large and complex. These systems require scalable controllers that robustly satisfy state and input constraints in the presence of additive noise -- such controllers should also be accompanied by theoretical guarantees on feasibility and stability. In our companion paper, we introduced Distributed and Localized Model Predictive Control (DLMPC) for large-scale linear systems; DLMPC is a scalable closed-loop MPC scheme in which subsystems need only exchange local information in order to synthesize and implement local controllers. In this …
This paper deals with the development and analysis of novel time-optimal point-to-point model predictive control concepts for nonlinear systems. Recent approaches in the literature apply a time transformation, however, which do not maintain recursive feasibility for piecewise constant control parameterization. The key idea in this paper is to introduce uniform grids with variable discretization. A shrinking-horizon grid adaptation scheme ensures convergence to a specific region around the target state and recursive feasibility. The size of the region is configurable by design parameters. This …
University of Pennsylvania（宾夕法尼亚大学）；University of California San Diego（加利福尼亚大学圣迭戈分校）
This work presents an explicit-implicit procedure to compute a model predictive control (MPC) law with guarantees on recursive feasibility and asymptotic stability. The approach combines an offline-trained fully-connected neural network with an online primal active set solver. The neural network provides a control input initialization while the primal active set method ensures recursive feasibility and asymptotic stability. The neural network is trained with a primal-dual loss function, aiming to generate control sequences that are primal feasible and meet a desired level of suboptimality. Sin…
For constrained linear systems with bounded disturbances and parametric uncertainty, we propose a robust adaptive model predictive control strategy with online parameter estimation. Constraints enforcing persistently exciting closed loop control actions are introduced for a set-membership parameter identification scheme. The algorithm requires the online solution of a convex program, satisfies constraints robustly, and ensures recursive feasibility and input-to-state stability. Almost sure convergence to the actual system parameters is demonstrated under assumptions on stabilizability, reachab…
This paper considers linear discrete-time systems with additive disturbances, and designs a Model Predictive Control (MPC) law incorporating a dynamic feedback gain to minimise a quadratic cost function subject to a single chance constraint. The feedback gain is selected online and we provide two selection methods based on minimising upper bounds on predicted costs. The chance constraint is defined as a discounted sum of violation probabilities on an infinite horizon. By penalising violation probabilities close to the initial time and assigning violation probabilities in the far future with va…
A Learning Model Predictive Controller (LMPC) for linear system in presented. The proposed controller is an extension of the LMPC [1] and it aims to decrease the computational burden. The control scheme is reference-free and is able to improve its performance by learning from previous iterations. A convex safe set and a terminal cost function are used in order to guarantee recursive feasibility and non-increasing performance at each iteration. The paper presents the control design approach, and shows how to recursively construct the convex terminal set and the terminal cost from state and inpu…
The optimization of process economics within the model predictive control (MPC) formulation has given rise to a new control paradigm known as economic MPC (EMPC). Several authors have discussed the closed-loop properties of EMPC-controlled deterministic systems, however, little have uncertain systems been studied. In this paper we propose EMPC formulations for nonlinear Markovian switching systems which guarantee recursive feasibility, asymptotic performance bounds and constrained mean square (MS) stability.
This paper presents a distributionally robust stochastic model predictive control (SMPC) approach for linear discrete-time systems subject to unbounded and correlated additive disturbances. We consider hard input constraints and state chance constraints, which are approximated as distributionally robust (DR) Conditional Value-at-Risk (CVaR) constraints over a Wasserstein ambiguity set. The computational complexity is reduced by resorting to a tube-based MPC scheme with indirect feedback, such that the error scenarios can be sampled offline. Recursive feasibility is guaranteed by softening the …
This paper presents a nonlinear model predictive control strategy for stochastic systems with general (state and input dependent) disturbances subject to chance constraints. Our approach uses an online computed stochastic tube to ensure stability, constraint satisfaction and recursive feasibility in the presence of stochastic uncertainties. The shape of the tube and the constraint backoff is based on an offline computed incremental Lyapunov function.
We show that Funnel MPC, a novel Model Predictive Control (MPC) scheme, allows tracking of smooth reference signals with prescribed performance for nonlinear multi-input multi-output systems of relative degree one with stable internal dynamics. The optimal control problem solved in each iteration of Funnel MPC resembles the basic idea of penalty methods used in optimization. To this end, we present a new stage cost design to mimic the high-gain idea of (adaptive) funnel control. We rigorously show initial and recursive feasibility of Funnel MPC without imposing terminal conditions or other req…
Funnel MPC, a novel Model Predictive Control (MPC) scheme, allows guaranteed output tracking of smooth reference signals with prescribed error bounds for nonlinear multi-input multi-output systems. To this end, the stage cost resembles the high-gain idea of funnel control. However, rigorous proofs for initial and recursive feasibility without incorporating additional output constraints in the Funnel MPC scheme are only available for systems with relative degree one and stable internal dynamics. In this paper, we extend these results to systems with relative degree two by incorporating also a t…
In this paper, we develop a distributionally robust model predictive control framework for the control of wind farms with the goal of power tracking and mechanical stress reduction of the individual wind turbines. We introduce an ARMA model to predict the turbulent wind speed, where we merely assume that the residuals are sub-Gaussian noise with statistics contained in an moment-based ambiguity set. We employ a recently developed distributionally model predictive control scheme to ensure constraint satisfaction and recursive feasibility of the control algorithm. The effectiveness of the approa…
In this paper, model predictive control (MPC) strategies are proposed for dead-beat control of linear systems with and without state and control constraints. In unconstrained MPC, deadbeat performance can be guaranteed by setting the control horizon to the system dimension, and adding an terminal equality constraint. It is proved that the unconstrained deadbeat MPC is equivalent to linear deadbeat control. The proposed constrained deadbeat MPC is designed by setting the control horizon equal to the system dimension and penalizing only the terminal cost. The recursive feasibility and deadbeat p…
This paper proposes a hierarchical decentralized reference governor for constrained cascade systems. The reference governor (RG) approach is reformulated in terms of receding horizon strategy such that a locally receding horizon optimization is obtained for each subsystem with a pre-established prediction horizon. The algorithm guarantees that not only the nominal overall closed-loop system without any constraint is recoverable but also the state and control constraints are satisfied in transient conditions. Also, considering unfeasible reference signals, the output of any subsystem goes local…
This paper presents a computationally efficient robust model predictive control law for discrete linear time invariant systems subject to additive disturbances that may depend on the state and/or input norms. Despite the dependency being non-convex, we are able to capture it exactly for input dependency and approximately for state dependency in at most a second order cone programming problem. The formulation has linear complexity in the planning horizon length. The approach is thus amenable to efficient real-time implementation with a guarantee on recursive feasibility and global optimality. R…
Adaptive model predictive control (MPC) methods using set-membership identification to reduce parameter uncertainty are considered in this work. Strong duality is used to reformulate the set-membership equations exactly within the MPC optimization. A predicted worst-case cost is then used to enable performance-oriented exploration. The proposed approach guarantees robust constraint satisfaction and recursive feasibility. It is shown that method can be implemented using homothetic tube and flexible tube parameterizations of state tubes, and a simulation study demonstrates performance improvemen…
The paper considers constrained linear systems with stochastic additive disturbances and noisy measurements transmitted over a lossy communication channel. We propose a model predictive control (MPC) law that minimizes a discounted cost subject to a discounted expectation constraint. Sensor data is assumed to be lost with known probability, and data losses are accounted for by expressing the predicted control policy as an affine function of future observations, which results in a convex optimal control problem. An online constraint-tightening technique ensures recursive feasibility of the onli…
This work develops a stochastic model predictive controller~(SMPC) for uncertain linear systems with additive Gaussian noise subject to state and control constraints. The proposed approach is based on the recently developed finite-horizon optimal covariance steering control theory, which steers the mean and the covariance of the system state to prescribed target values at a given terminal time. We call our approach covariance steering-based SMPC, or CS-SMPC. We show that the proposed approach has several advantages over traditional SMPC approaches in the literature. Specifically, it is shown t…
