A Method for Reducing the Complexity of Model Predictive Control in Robotics Applications
For robotics applications with limited computational resources, this method reduces online optimization complexity while maintaining stability guarantees.
The paper introduces a time-shift-invariant parametrization for input and state trajectories in model predictive control that reduces computational complexity and enables warm-starting, with inherent stability and recursive feasibility guarantees for linear time-invariant systems. This makes it suitable for resource-constrained robotics applications.
This article describes an approach for parametrizing input and state trajectories in model predictive control. The parametrization is designed to be invariant to time shifts, which enables warm-starting the successive optimization problems and reduces the computational complexity of the online optimization. It is shown that in certain cases (e.g. for linear time-invariant dynamics with input and state constraints) the parametrization leads to inherent stability and recursive feasibility guarantees without additional terminal set constraints. Due to the fact that the number of decision variables are greatly reduced through the parametrization, while the warm-starting capabilities are preserved, the approach is suitable for applications where the available computational resources (memory and CPU-power) are limited.