Iterative risk-constrained model predictive control: A data-driven distributionally robust approach

TL;DR

This paper introduces an iterative, data-driven, distributionally robust MPC method that ensures safe, cost-effective control in uncertain environments by progressively learning and refining risk constraints through accumulated data.

Contribution

It presents a novel iterative MPC scheme that adaptively constructs distributionally robust risk constraints using data, guaranteeing recursive feasibility, safety, and convergence in uncertain control systems.

Findings

Ensures recursive feasibility and asymptotic convergence to the target.

Provides tractable reformulations for risk constraints with Wasserstein and total variation ambiguity sets.

Demonstrates effectiveness through a mobile robot path planning simulation.

Abstract

This paper proposes an iterative distributionally robust model predictive control (MPC) scheme to solve a risk-constrained infinite-horizon optimal control problem. In each iteration, the algorithm generates a trajectory from the starting point to the target equilibrium state with the aim of respecting risk constraints with high probability (that encodes safe operation of the system) and improving the cost of the trajectory as compared to previous iterations. At the end of each iteration, the visited states and observed samples of the uncertainty are stored and accumulated with the previous observations. For each iteration, the states stored previously are considered as terminal constraints of the MPC scheme, and samples obtained thus far are used to construct distributionally robust risk constraints. As iterations progress, more data is obtained and the environment is explored progressively to ensure better safety and cost optimality. We prove that the MPC scheme in each iteration is recursively feasible and the resulting trajectories converge asymptotically to the target while ensuring safety with high probability. We identify conditions under which the cost-to-go reduces as iterations progress. For systems with locally one-step reachable target, we specify scenarios that ensure finite-time convergence of iterations. We provide computationally tractable reformulations of the risk constraints for total variation and Wasserstein distance-based ambiguity sets. A simulation example illustrates the application of our results in finding a risk-constrained path for two mobile robots facing an uncertain obstacle.