Search

We propose a novel data-driven stochastic model predictive control framework for uncertain linear systems with noisy output measurements. Our approach leverages multi-step predictors to efficiently propagate uncertainty, ensuring chance constraint satisfaction with minimal conservatism. In particular, we present a strategy to identify multi-step predictors and quantify the associated uncertainty using a surrogate (data-driven) state space model. Then, we utilize the derived distribution to formulate a constraint tightening that ensures chance constraint satisfaction. A numerical example highlights the reduced conservatism of handling parametric uncertainty in the proposed method compared to state-of-the-art solutions.

Learning uncertain dynamics models using Gaussian process~(GP) regression has been demonstrated to enable high-performance and safety-aware control strategies for challenging real-world applications. Yet, for computational tractability, most approaches for Gaussian process-based model predictive control (GP-MPC) are based on approximations of the reachable set that are either overly conservative or impede the controller's safety guarantees. To address these challenges, we propose a robust GP-MPC formulation that guarantees constraint satisfaction with high probability. For its tractable implementation, we propose a sampling-based GP-MPC approach that iteratively generates consistent dynamics samples from the GP within a sequential quadratic programming framework. We highlight the improved reachable set approximation compared to existing methods, as well as real-time feasible computation times, using two numerical examples., Comment: to be published in 63rd IEEE Conference on Decision and Control (CDC 2024)

We introduce data to predictive control, D2PC, a framework to facilitate the design of robust and predictive controllers from data. The proposed framework is designed for discrete-time stochastic linear systems with output measurements and provides a principled design of a predictive controller based on data. The framework starts with a parameter identification method based on the Expectation-Maximization algorithm, which incorporates pre-defined structural constraints. Additionally, we provide an asymptotically correct method to quantify uncertainty in parameter estimates. Next, we develop a strategy to synthesize robust dynamic output-feedback controllers tailored to the derived uncertainty characterization. Finally, we introduce a predictive control scheme that guarantees recursive feasibility and satisfaction of chance constraints. This framework marks a significant advancement in integrating data into robust and predictive control schemes. We demonstrate the efficacy of D2PC through a numerical example involving a $10$-dimensional spring-mass-damper system., Comment: Code link: https://github.com/haldunbalim/D2PC

We present a stochastic predictive control framework for nonlinear systems subject to unbounded process noise with closed-loop guarantees. First, we first provide a conceptual shrinking-horizon framework that utilizes general probabilistic reachable sets and minimizes the expected cost. Then, we provide a tractable receding-horizon formulation that uses a nominal state and a simple constraint tightening. Both formulations ensure recursive feasibility, satisfaction of chance constraints, and bounds on the expected cost for the resulting closed-loop system. We provide a constructive design for probabilistic reachable sets of nonlinear systems using stochastic contraction metrics. We demonstrate the practicality of the proposed method through a simulation of a chain of mass-spring-dampers with nonlinear Coulomb friction. Overall, this paper provides a framework for computationally tractable stochastic predictive control approaches with closed-loop guaranteed for nonlinear systems with unbounded noise., Comment: Code: https://gitlab.ethz.ch/ics/SMPC-CCM

In Model Predictive Control (MPC), discrepancies between the actual system and the predictive model can lead to substantial tracking errors and significantly degrade performance and reliability. While such discrepancies can be alleviated with more complex models, this often complicates controller design and implementation. By leveraging the fact that many trajectories of interest are periodic, we show that perfect tracking is possible when incorporating a simple observer that estimates and compensates for periodic disturbances. We present the design of the observer and the accompanying tracking MPC scheme, proving that their combination achieves zero tracking error asymptotically, regardless of the complexity of the unmodelled dynamics. We validate the effectiveness of our method, demonstrating asymptotically perfect tracking on a high-dimensional soft robot with nearly 10,000 states and a fivefold reduction in tracking errors compared to a baseline MPC on small-scale autonomous race car experiments., Comment: 8 pages, 3 figures; 2024 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2024)

We present a model predictive control (MPC) formulation to directly optimize economic criteria for linear constrained systems subject to disturbances and uncertain model parameters. The proposed formulation combines a certainty equivalent economic MPC with a simple least-squares parameter adaptation. For the resulting adaptive economic MPC scheme, we derive strong asymptotic and transient performance guarantees. We provide a numerical example involving building temperature control and demonstrate performance benefits of online parameter adaptation., Comment: Final version, IEEE Conference on Decision and Control (CDC), 2024

Safely exploring environments with a-priori unknown constraints is a fundamental challenge that restricts the autonomy of robots. While safety is paramount, guarantees on sufficient exploration are also crucial for ensuring autonomous task completion. To address these challenges, we propose a novel safe guaranteed exploration framework using optimal control, which achieves first-of-its-kind results: guaranteed exploration for non-linear systems with finite time sample complexity bounds, while being provably safe with arbitrarily high probability. The framework is general and applicable to many real-world scenarios with complex non-linear dynamics and unknown domains. Based on this framework we propose an efficient algorithm, SageMPC, SAfe Guaranteed Exploration using Model Predictive Control. SageMPC improves efficiency by incorporating three techniques: i) exploiting a Lipschitz bound, ii) goal-directed exploration, and iii) receding horizon style re-planning, all while maintaining the desired sample complexity, safety and exploration guarantees of the framework. Lastly, we demonstrate safe efficient exploration in challenging unknown environments using SageMPC with a car model.

Appropriate time discretization is crucial for real-time applications of numerical optimal control, such as nonlinear model predictive control. However, if the discretization error strongly depends on the applied control input, meeting accuracy and sampling time requirements simultaneously can be challenging using classical discretization methods. In particular, neither fixed-grid nor adaptive-grid discretizations may be suitable, when they suffer from large integration error or exceed the prescribed sampling time, respectively. In this work, we take a first step at closing this gap by utilizing probabilistic numerical integrators to approximate the solution of the initial value problem, as well as the computational uncertainty associated with it, inside the optimal control problem (OCP). By taking the viewpoint of probabilistic numerics and propagating the numerical uncertainty in the cost, the OCP is reformulated such that the optimal input reduces the computational uncertainty insofar as it is beneficial for the control objective. The proposed approach is illustrated using a numerical example, and potential benefits and limitations are discussed., Comment: to be published in the 6th Annual Learning for Dynamics & Control Conference (L4DC 2024)

System level synthesis enables improved robust MPC formulations by allowing for joint optimization of the nominal trajectory and controller. This paper introduces a tailored algorithm for solving the corresponding disturbance feedback optimization problem for linear time-varying systems. The proposed algorithm iterates between optimizing the controller and the nominal trajectory while converging q-linearly to an optimal solution. We show that the controller optimization can be solved through Riccati recursions leading to a horizon-length, state, and input scalability of $\mathcal{O}(N^2 ( n_x^3 +n_u^3))$ for each iterate. On a numerical example, the proposed algorithm exhibits computational speedups by a factor of up to $10^3$ compared to general-purpose commercial solvers., Comment: Young Author Award (finalist): IFAC Conference on Nonlinear Model Predictive Control (NMPC) 2024

Predictive safety filters provide a way of projecting potentially unsafe inputs, proposed, e.g. by a human or learning-based controller, onto the set of inputs that guarantee recursive state and input constraint satisfaction by leveraging model predictive control techniques. In this paper, we extend this framework such that in addition, robust asymptotic stability of the closed-loop system can be guaranteed by enforcing a decrease of an implicit Lyapunov function which is constructed using a predicted system trajectory. Differently from previous results, we show robust asymptotic stability with respect to a predefined disturbance set on an extended state consisting of the system state and a warmstart input sequence. The proposed strategy is applied to an automotive lane keeping example in simulation., Comment: Accepted at NMPC'24

In recent years, the increasing need for high-performance controllers in applications like autonomous driving has motivated the development of optimization routines tailored to specific control problems. In this paper, we propose an efficient inexact model predictive control (MPC) strategy for autonomous miniature racing with inherent robustness properties. We rely on a feasible sequential quadratic programming (SQP) algorithm capable of generating feasible intermediate iterates such that the solver can be stopped after any number of iterations, without jeopardizing recursive feasibility. In this way, we provide a strategy that computes suboptimal and yet feasible solutions with a computational footprint that is much lower than state-of-the-art methods based on the computation of locally optimal solutions. Under suitable assumptions on the terminal set and on the controllability properties of the system, we can state that, for any sufficiently small disturbance affecting the system's dynamics, recursive feasibility can be guaranteed. We validate the effectiveness of the proposed strategy in simulation and by deploying it onto a physical experiment with autonomous miniature race cars. Both the simulation and experimental results demonstrate that, using the feasible SQP method, a feasible solution can be obtained with moderate additional computational effort compared to strategies that resort to early termination without providing a feasible solution. At the same time, the proposed method is significantly faster than the state-of-the-art solver Ipopt.

Safety guarantees are vital in many control applications, such as robotics. Model predictive control (MPC) provides a constructive framework for controlling safety-critical systems, but is limited by its computational complexity. We address this problem by presenting a novel algorithm that automatically computes an explicit approximation to nonlinear MPC schemes while retaining closed-loop guarantees. Specifically, the problem can be reduced to a function approximation problem, which we then tackle by proposing ALKIA-X, the Adaptive and Localized Kernel Interpolation Algorithm with eXtrapolated reproducing kernel Hilbert space norm. ALKIA-X is a non-iterative algorithm that ensures numerically well-conditioned computations, a fast-to-evaluate approximating function, and the guaranteed satisfaction of any desired bound on the approximation error. Hence, ALKIA-X automatically computes an explicit function that approximates the MPC, yielding a controller suitable for safety-critical systems and high sampling rates. We apply ALKIA-X to approximate two nonlinear MPC schemes, demonstrating reduced computational demand and applicability to realistic problems., Comment: Submitted to IEEE Transactions on Automatic Control. Compared to the previously uploaded version, this version contains an additional numerical example

Robust and stochastic optimal control problem (OCP) formulations allow a systematic treatment of uncertainty, but are typically associated with a high computational cost. The recently proposed zero-order robust optimization (zoRO) algorithm mitigates the computational cost of uncertainty-aware MPC by propagating the uncertainties outside of the MPC problem. This paper details the combination of zoRO with the real-time iteration (RTI) scheme and presents an efficient open-source implementation in acados, utilizing BLASFEO for the linear algebra operations. In addition to the scaling advantages posed by the zoRO algorithm, the efficient implementation drastically reduces the computational overhead, and, combined with an RTI scheme, enables the use of tube-based MPC for a wider range of applications. The flexibility, usability and effectiveness of the proposed implementation is demonstrated on two examples. On the practical example of a differential drive robot, the proposed implementation results in a tenfold reduction of computation time with respect to the previously available zoRO implementation., Comment: 7 pages, 4 figures, submitted to ECC 2024

We present a robust model predictive control (MPC) framework for linear systems facing bounded parametric uncertainty and bounded disturbances. Our approach deviates from standard MPC formulations by integrating multi-step predictors, which provide reduced error bounds. These bounds, derived from multi-step predictors, are utilized in a homothetic tube formulation to mitigate conservatism. Lastly, a multi-rate formulation is adopted to handle the incompatibilities of multi-step predictors. We provide a theoretical analysis, guaranteeing robust recursive feasibility, constraint satisfaction, and (practical) stability of the desired setpoint. We use a simulation example to compare it to existing literature and demonstrate advantages in terms of conservatism and computational complexity., Comment: Extended version of accepted paper in IEEE Control Systems Letters, 2023. Contains additional details regarding the numerical example and LMI derivation

Real-world systems are often characterized by high-dimensional nonlinear dynamics, making them challenging to control in real time. While reduced-order models (ROMs) are frequently employed in model-based control schemes, dimensionality reduction introduces model uncertainty which can potentially compromise the stability and safety of the original high-dimensional system. In this work, we propose a novel reduced-order model predictive control (ROMPC) scheme to solve constrained optimal control problems for nonlinear, high-dimensional systems. To address the challenges of using ROMs in predictive control schemes, we derive an error bounding system that dynamically accounts for model reduction error. Using these bounds, we design a robust MPC scheme that ensures robust constraint satisfaction, recursive feasibility, and asymptotic stability. We demonstrate the effectiveness of our proposed method in simulations on a high-dimensional soft robot with nearly 10,000 states., Comment: 9 pages, 3 figures, To be presented at Conference for Decision and Control 2023

Model predictive control (MPC) achieves stability and constraint satisfaction for general nonlinear systems, but requires computationally expensive online optimization. This paper studies approximations of such MPC controllers via neural networks (NNs) to achieve fast online evaluation. We propose safety augmentation that yields deterministic guarantees for convergence and constraint satisfaction despite approximation inaccuracies. We approximate the entire input sequence of the MPC with NNs, which allows us to verify online if it is a feasible solution to the MPC problem. We replace the NN solution by a safe candidate based on standard MPC techniques whenever it is infeasible or has worse cost. Our method requires a single evaluation of the NN and forward integration of the input sequence online, which is fast to compute on resource-constrained systems. The proposed control framework is illustrated using two numerical non-linear MPC benchmarks of different complexity, demonstrating computational speedups that are orders of magnitude higher than online optimization. In the examples, we achieve deterministic safety through the safety-augmented NNs, where a naive NN implementation fails.

This paper addresses the problem of optimally controlling nonlinear systems with norm-bounded disturbances and parametric uncertainties while robustly satisfying constraints. The proposed approach jointly optimizes a nominal nonlinear trajectory and an error feedback, requiring minimal offline design effort and offering low conservatism. This is achieved by decomposing the affine-in-the-parameter uncertain nonlinear system into a nominal $\textit{nonlinear}$ system and an uncertain linear time-varying system. Using this decomposition, we can apply established tools from system level synthesis to $\textit{convexly}$ over-bound all uncertainties in the nonlinear optimization problem. Moreover, it enables tight joint optimization of the linearization error bounds, parametric uncertainties bounds, nonlinear trajectory, and error feedback. With this novel controller parameterization, we can formulate a convex constraint to ensure robust performance guarantees for the nonlinear system. The presented method is relevant for numerous applications related to trajectory optimization, e.g., in robotics and aerospace engineering. We demonstrate the performance of the approach and its low conservatism through the simulation example of a post-capture satellite stabilization., Comment: Accepted for CDC (Singapore, 13-15 December 2023). Code: https://gitlab.ethz.ch/ics/nonlinear-parametric-SLS

We investigate model predictive control (MPC) formulations for linear systems subject to i.i.d. stochastic disturbances with bounded support and chance constraints. Existing stochastic MPC formulations with closed-loop guarantees can be broadly classified in two separate frameworks: i) using robust techniques; ii) feasibility preserving algorithms. We investigate two particular MPC formulations representative for these two frameworks called robust-stochastic MPC and indirect feedback stochastic MPC. We provide a qualitative analysis, highlighting intrinsic limitations of both approaches in different edge cases. Then, we derive a unifying stochastic MPC framework that naturally includes these two formulations as limit cases. This qualitative analysis is complemented with numerical results, showcasing the advantages and limitations of each method., Comment: Extended version of the paper to be presented in Proc. Conference on Decision and Control (CDC), 2023. Appendix contains additionally the theoretical proof and details regarding the computation of the constraint tightening

In cooperative multi-agent robotic systems, coordination is necessary in order to complete a given task. Important examples include search and rescue, operations in hazardous environments, and environmental monitoring. Coordination, in turn, requires simultaneous satisfaction of safety critical constraints, in the form of state and input constraints, and a connectivity constraint, in order to ensure that at every time instant there exists a communication path between every pair of agents in the network. In this work, we present a model predictive controller that tackles the problem of performing multi-agent coordination while simultaneously satisfying safety critical and connectivity constraints. The former is formulated in the form of state and input constraints and the latter as a constraint on the second smallest eigenvalue of the associated communication graph Laplacian matrix, also known as Fiedler eigenvalue, which enforces the connectivity of the communication network. We propose a sequential quadratic programming formulation to solve the associated optimization problem that is amenable to distributed optimization, making the proposed solution suitable for control of multi-agent robotics systems relying on local computation. Finally, the effectiveness of the algorithm is highlighted with a numerical simulation.

This paper addresses the problem of finite horizon constrained robust optimal control for nonlinear systems subject to norm-bounded disturbances. To this end, the underlying uncertain nonlinear system is decomposed based on a first-order Taylor series expansion into a nominal system and an error (deviation) described as an uncertain linear time-varying system. This decomposition allows us to leverage System Level Synthesis to jointly optimize an affine error feedback, a nominal nonlinear trajectory, and, most importantly, a dynamic linearization error over-bound used to ensure robust constraint satisfaction for the nonlinear system. The proposed approach thereby results in less conservative planning compared with state-of-the-art techniques. We demonstrate the benefits of the proposed approach to control the rotational motion of a rigid body subject to state and input constraints., Comment: submitted to IEEE Transactions on Automatic Control (TAC)

We present an output feedback stochastic model predictive control (SMPC) approach for linear systems subject to Gaussian disturbances and measurement noise and probabilistic constraints on system states and inputs. The presented approach combines a linear Kalman filter for state estimation with an indirect feedback SMPC, which is initialized with a predicted nominal state, while feedback of the current state estimate enters through the objective of the SMPC problem. For this combination, we establish recursive feasibility of the SMPC problem due to the chosen initialization, and closed-loop chance constraint satisfaction thanks to an appropriate tightening of the constraints in the SMPC problem also considering the state estimation uncertainty. Additionally, we show that for specific design choices in the SMPC problem, the unconstrained linear-quadratic-Gaussian (LQG) solution is recovered if it is feasible for a given initial condition and the considered constraints. We demonstrate this fact for a numerical example, and show that the resulting output feedback controller can provide non-conservative constraint satisfaction., Comment: 7 pages, 1 figure

By enabling constraint-aware online model adaptation, model predictive control using Gaussian process (GP) regression has exhibited impressive performance in real-world applications and received considerable attention in the learning-based control community. Yet, solving the resulting optimal control problem in real-time generally remains a major challenge, due to i) the increased number of augmented states in the optimization problem, as well as ii) computationally expensive evaluations of the posterior mean and covariance and their respective derivatives. To tackle these challenges, we employ i) a tailored Jacobian approximation in a sequential quadratic programming (SQP) approach, and combine it with ii) a parallelizable GP inference and automatic differentiation framework. Reducing the numerical complexity with respect to the state dimension $n_x$ for each SQP iteration from $\mathcal{O}(n_x^6)$ to $\mathcal{O}(n_x^3)$, and accelerating GP evaluations on a graphical processing unit, the proposed algorithm computes suboptimal, yet feasible solutions at drastically reduced computation times and exhibits favorable local convergence properties. Numerical experiments verify the scaling properties and investigate the runtime distribution across different parts of the algorithm., Comment: accepted for European Journal of Control (EJC), ECC 2023 Special Issue

A predictive control barrier function (PCBF) based safety filter is a modular framework to verify safety of a control input by predicting a future trajectory. The approach relies on the solution of two optimization problems, first computing the minimal state constraint violation given the current state in the form of slacks on the constraint, and then computing the minimal deviation from a proposed input given the previously computed minimal slacks. This paper presents an approximation procedure that uses a neural network to approximate the optimal value function of the first optimization problem, which defines a control barrier function (CBF). By including this explicit approximation in a CBF-based safety filter formulation, the online computation becomes independent of the prediction horizon. It is shown that this approximation guarantees convergence to a neighborhood of the feasible set of the PCBF safety filter problem with zero constraint violation. The convergence result relies on a novel class $\mathcal{K}$ lower bound on the PCBF decrease and depends on the approximation error of the neural network. Lastly, we demonstrate our approach in simulation for an autonomous driving example and show that the proposed approximation leads to a significant decrease in computation time compared to the original approach., Comment: Accepted at ECC23

This paper presents a synthesis method for the generalised dynamic regret problem, comparing the performance of a strictly causal controller to the optimal non-causal controller under a weighted disturbance. This framework encompasses both the dynamic regret problem, considering the difference of the incurred costs, as well as the competitive ratio, which considers their ratio, and which have both been proposed as inherently adaptive alternatives to classical control methods. Furthermore, we extend the synthesis to the case of pointwise-in-time bounds on the disturbance and show that the optimal solution is no worse than the bounded energy optimal solution and is lower bounded by a constant factor, which is only dependent on the disturbance weight. The proposed optimisation-based synthesis allows considering systems subject to state and input constraints. Finally, we provide a numerical example which compares the synthesised controller performance to $\mathcal{H}_2$- and $\mathcal{H}_\infty$-controllers., Comment: Accepted at IFAC WC 2023

In multi-agent coverage control problems, agents navigate their environment to reach locations that maximize the coverage of some density. In practice, the density is rarely known $\textit{a priori}$, further complicating the original NP-hard problem. Moreover, in many applications, agents cannot visit arbitrary locations due to $\textit{a priori}$ unknown safety constraints. In this paper, we aim to efficiently learn the density to approximately solve the coverage problem while preserving the agents' safety. We first propose a conditionally linear submodular coverage function that facilitates theoretical analysis. Utilizing this structure, we develop MacOpt, a novel algorithm that efficiently trades off the exploration-exploitation dilemma due to partial observability, and show that it achieves sublinear regret. Next, we extend results on single-agent safe exploration to our multi-agent setting and propose SafeMac for safe coverage and exploration. We analyze SafeMac and give first of its kind results: near optimal coverage in finite time while provably guaranteeing safety. We extensively evaluate our algorithms on synthetic and real problems, including a bio-diversity monitoring task under safety constraints, where SafeMac outperforms competing methods., Comment: Accepted at NeurIPS 2022

We present a robust adaptive model predictive control (MPC) framework for nonlinear continuous-time systems with bounded parametric uncertainty and additive disturbance. We utilize general control contraction metrics (CCMs) to parameterize a homothetic tube around a nominal prediction that contains all uncertain trajectories. Furthermore, we incorporate model adaptation using set-membership estimation. As a result, the proposed MPC formulation is applicable to a large class of nonlinear systems, reduces conservatism during online operation, and guarantees robust constraint satisfaction and convergence to a neighborhood of the desired setpoint. One of the main technical contributions is the derivation of corresponding tube dynamics based on CCMs that account for the state and input dependent nature of the model mismatch. Furthermore, we online optimize over the nominal parameter, which enables general set-membership updates for the parametric uncertainty in the MPC. Benefits of the proposed homothetic tube MPC and online adaptation are demonstrated using a numerical example involving a planar quadrotor., Comment: This is the accepted version of the paper in Automatica, 2023

To address feasibility issues in model predictive control (MPC), most implementations relax hard state constraints using additional slack variables with a suitable penalty. We propose an alternative strategy for open-loop asymptotically/Lyapunov stable nonlinear systems by relaxing the initial state constraint with a suitable penalty. The proposed MPC framework is globally feasible, ensures (semi-)global asymptotic stability, and (approximately) recovers the closed-loop properties of the nominal MPC on the feasible set. The proposed framework can be naturally combined with a robust formulation to ensure robustness subject to bounded disturbances while retaining input-ot-state stability in case of arbitrarily large disturbances. We also show how the overall design can be simplified in case the nonlinear system is exponentially stable. In the special case of linear systems, the proposed MPC formulation reduces to a quadratic program and the offline design and online computational complexity is only marginally increased compared to anominal design. Benefits compared to classical soft contrained MPC formulations are demonstrated with numerical examples.

In this paper, we propose a Feasible Sequential Linear Programming (FSLP) algorithm applied to time-optimal control problems (TOCP) obtained through direct multiple shooting discretization. This method is motivated by TOCP with nonlinear constraints which arise in motion planning of mechatronic systems. The algorithm applies a trust-region globalization strategy ensuring global convergence. For fully determined problems our algorithm provides locally quadratic convergence. Moreover, the algorithm keeps all iterates feasible enabling early termination at suboptimal, feasible solutions. This additional feasibility is achieved by an efficient iterative strategy using evaluations of constraints, i.e., zero-order information. Convergence of the feasibility iterations can be enforced by reduction of the trust-region radius. These feasibility iterations maintain feasibility for general Nonlinear Programs (NLP). Therefore, the algorithm is applicable to general NLPs. We demonstrate our algorithm's efficiency and the feasibility update strategy on a TOCP of an overhead crane motion planning simulation case., Comment: Accepted for publication at the IEEE Conference on Decision and Control 2022 (CDC 22)

This paper contrasts recursive state space models and direct multi-step predictors for linear predictive control. We provide a tutorial exposition for both model structures to solve the following problems: 1. stochastic optimal control; 2. system identification; 3. stochastic optimal control based on the estimated model. Throughout the paper, we provide detailed discussions of the benefits and limitations of these two model parametrizations for predictive control and highlight the relation to existing works. Additionally, we derive a novel (partially tight) constraint tightening for stochastic predictive control with parametric uncertainty in the multi-step predictor., Comment: Fixed an error in Equ. (15) (two matrices where added instead of concatenated)

We present a stochastic model predictive control (SMPC) framework for linear systems subject to possibly unbounded disturbances. State of the art SMPC approaches with closed-loop chance constraint satisfaction recursively initialize the nominal state based on the previously predicted nominal state or possibly the measured state under some case distinction. We improve these initialization strategies by allowing for a continuous optimization over the nominal initial state in an interpolation of these two extremes. The resulting SMPC scheme can be implemented as one standard quadratic program and is more flexible compared to state-of-the-art initialization strategies. As the main technical contribution, we show that the proposed SMPC framework also ensures closed-loop satisfaction of chance constraints and suitable performance bounds., Comment: Extended version of accepted paper in IEEE Control Systems Letters, 2022. Contains additional details regarding the proof and an additional example

We present an optimisation-based method for synthesising a dynamic regret optimal controller for linear systems with potentially adversarial disturbances and known or adversarial initial conditions. The dynamic regret is defined as the difference between the true incurred cost of the system and the cost which could have optimally been achieved under any input sequence having full knowledge of all future disturbances for a given disturbance energy. This problem formulation can be seen as an alternative to classical $\mathcal{H}_2$- or $\mathcal{H}_\infty$-control. The proposed controller synthesis is based on the system level parametrisation, which allows reformulating the dynamic regret problem as a semi-definite problem. This yields a new framework that allows to consider structured dynamic regret problems, which have not yet been considered in the literature. For known pointwise ellipsoidal bounds on the disturbance, we show that the dynamic regret bound can be improved compared to using only a bounded energy assumption and that the optimal dynamic regret bound differs by at most a factor of $\frac{2}{\pi}$ from the computed solution. Furthermore, the proposed framework allows guaranteeing state and input constraint satisfaction., Comment: Accepted at L-CSS

Tube-based model predictive control (MPC) methods leverage tubes to bound deviations from a nominal trajectory due to uncertainties in order to ensure constraint satisfaction. This paper presents a novel tube-based MPC formulation based on system level disturbance reachable sets (SL-DRS), which leverage the affine system level parameterization (SLP). We show that imposing a finite impulse response (FIR) constraint on the affine SLP guarantees containment of all future deviations in a finite sequence of SL-DRS. This allows us to formulate a system level tube-MPC (SLTMPC) method using the SL-DRS as tubes, which enables concurrent optimization of the nominal trajectory and the tubes, while using a positively invariant terminal set. Finally, we show that the SL-DRS tubes can also be computed offline., Comment: ECC 2022 submission

We provide a stability and performance analysis for nonlinear model predictive control (NMPC) schemes subject to input constraints. Given an exponential stabilizability and detectability condition w.r.t. the employed state cost, we provide a sufficiently long prediction horizon to ensure asymptotic stability and a desired performance bound w.r.t. the infinite-horizon optimal controller. Compared to existing results, the provided analysis is applicable to positive semi-definite (detectable) cost functions, provides tight bounds using a linear programming analysis, and allows for a seamless integration of general positive-definite terminal cost functions in the analysis. The practical applicability of the derived theoretical results are demonstrated with numerical examples., Comment: This is the accepted version of the paper in IEEE Transaction on Automatic Control, 2023. This version contains additionally the proof of Theorem 7 in the appendix

Robust tube-based model predictive control (MPC) methods address constraint satisfaction by leveraging an a priori determined tube controller in the prediction to tighten the constraints. This paper presents a system level tube-MPC (SLTMPC) method derived from the system level parameterization (SLP), which allows optimization over the tube controller online when solving the MPC problem, which can significantly reduce conservativeness. We derive the SLTMPC method by establishing an equivalence relation between a class of robust MPC methods and the SLP. Finally, we show that the SLTMPC formulation naturally arises from an extended SLP formulation and show its merits in a numerical example., Comment: 9 pages, 2 figures; revised version with reviewer feedback

Gaussian process (GP) regression has been widely used in supervised machine learning due to its flexibility and inherent ability to describe uncertainty in function estimation. In the context of control, it is seeing increasing use for modeling of nonlinear dynamical systems from data, as it allows the direct assessment of residual model uncertainty. We present a model predictive control (MPC) approach that integrates a nominal system with an additive nonlinear part of the dynamics modeled as a GP. Approximation techniques for propagating the state distribution are reviewed and we describe a principled way of formulating the chance constrained MPC problem, which takes into account residual uncertainties provided by the GP model to enable cautious control. Using additional approximations for efficient computation, we finally demonstrate the approach in a simulation example, as well as in a hardware implementation for autonomous racing of remote controlled race cars, highlighting improvements with regard to both performance and safety over a nominal controller., Comment: Published in IEEE Transactions on Control Systems Technology

In this paper, we propose the inexact alternating minimization algorithm (inexact AMA), which allows inexact iterations in the algorithm, and its accelerated variant, called the inexact fast alternating minimization algorithm (inexact FAMA). We show that inexact AMA and inexact FAMA are equivalent to the inexact proximal-gradient method and its accelerated variant applied to the dual problem. Based on this equivalence, we derive complexity upper-bounds on the number of iterations for the inexact algorithms. We apply inexact AMA and inexact FAMA to distributed optimization problems, with an emphasis on distributed MPC applications, and show the convergence properties for this special case. By employing the complexity upper-bounds on the number of iterations, we provide sufficient conditions on the inexact iterations for the convergence of the algorithms. We further study the special case of quadratic local objectives in the distributed optimization problems, which is a standard form in distributed MPC. For this special case, we allow local computational errors at each iteration. By exploiting a warm-starting strategy and the sufficient conditions on the errors for convergence, we propose an approach to certify the number of iterations for solving local problems, which guarantees that the local computational errors satisfy the sufficient conditions and the inexact distributed optimization algorithm converges to the optimal solution.

We consider the problem of solving a distributed optimization problem using a distributed computing platform, where the communication in the network is limited: each node can only communicate with its neighbours and the channel has a limited data-rate. A common technique to address the latter limitation is to apply quantization to the exchanged information. We propose two distributed optimization algorithms with an iteratively refining quantization design based on the inexact proximal gradient method and its accelerated variant. We show that if the parameters of the quantizers, i.e. the number of bits and the initial quantization intervals, satisfy certain conditions, then the quantization error is bounded by a linearly decreasing function and the convergence of the distributed algorithms is guaranteed. Furthermore, we prove that after imposing the quantization scheme, the distributed algorithms still exhibit a linear convergence rate, and show complexity upper-bounds on the number of iterations to achieve a given accuracy. Finally, we demonstrate the performance of the proposed algorithms and the theoretical findings for solving a distributed optimal control problem.