A Method for Reducing the Complexity of Model Predictive Control in Robotics Applications
pith:LUXNUXHG Add to your LaTeX paper
What is a Pith Number?\usepackage{pith}
\pithnumber{LUXNUXHG}
Prints a linked pith:LUXNUXHG badge after your title and writes the identifier into PDF metadata. Compiles on arXiv with no extra files. Learn more
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.