1,322 research outputs found
Towards parallelizable sampling-based Nonlinear Model Predictive Control
This paper proposes a new sampling-based nonlinear model predictive control
(MPC) algorithm, with a bound on complexity quadratic in the prediction horizon
N and linear in the number of samples. The idea of the proposed algorithm is to
use the sequence of predicted inputs from the previous time step as a warm
start, and to iteratively update this sequence by changing its elements one by
one, starting from the last predicted input and ending with the first predicted
input. This strategy, which resembles the dynamic programming principle, allows
for parallelization up to a certain level and yields a suboptimal nonlinear MPC
algorithm with guaranteed recursive feasibility, stability and improved cost
function at every iteration, which is suitable for real-time implementation.
The complexity of the algorithm per each time step in the prediction horizon
depends only on the horizon, the number of samples and parallel threads, and it
is independent of the measured system state. Comparisons with the fmincon
nonlinear optimization solver on benchmark examples indicate that as the
simulation time progresses, the proposed algorithm converges rapidly to the
"optimal" solution, even when using a small number of samples.Comment: 9 pages, 9 pictures, submitted to IFAC World Congress 201
Asymptotic Stability of POD based Model Predictive Control for a semilinear parabolic PDE
In this article a stabilizing feedback control is computed for a semilinear
parabolic partial differential equation utilizing a nonlinear model predictive
(NMPC) method. In each level of the NMPC algorithm the finite time horizon open
loop problem is solved by a reduced-order strategy based on proper orthogonal
decomposition (POD). A stability analysis is derived for the combined POD-NMPC
algorithm so that the lengths of the finite time horizons are chosen in order
to ensure the asymptotic stability of the computed feedback controls. The
proposed method is successfully tested by numerical examples
Dynamic Tube MPC for Nonlinear Systems
Modeling error or external disturbances can severely degrade the performance
of Model Predictive Control (MPC) in real-world scenarios. Robust MPC (RMPC)
addresses this limitation by optimizing over feedback policies but at the
expense of increased computational complexity. Tube MPC is an approximate
solution strategy in which a robust controller, designed offline, keeps the
system in an invariant tube around a desired nominal trajectory, generated
online. Naturally, this decomposition is suboptimal, especially for systems
with changing objectives or operating conditions. In addition, many tube MPC
approaches are unable to capture state-dependent uncertainty due to the
complexity of calculating invariant tubes, resulting in overly-conservative
approximations. This work presents the Dynamic Tube MPC (DTMPC) framework for
nonlinear systems where both the tube geometry and open-loop trajectory are
optimized simultaneously. By using boundary layer sliding control, the tube
geometry can be expressed as a simple relation between control parameters and
uncertainty bound; enabling the tube geometry dynamics to be added to the
nominal MPC optimization with minimal increase in computational complexity. In
addition, DTMPC is able to leverage state-dependent uncertainty to reduce
conservativeness and improve optimization feasibility. DTMPC is demonstrated to
robustly perform obstacle avoidance and modify the tube geometry in response to
obstacle proximity
On generalized terminal state constraints for model predictive control
This manuscript contains technical results related to a particular approach
for the design of Model Predictive Control (MPC) laws. The approach, named
"generalized" terminal state constraint, induces the recursive feasibility of
the underlying optimization problem and recursive satisfaction of state and
input constraints, and it can be used for both tracking MPC (i.e. when the
objective is to track a given steady state) and economic MPC (i.e. when the
objective is to minimize a cost function which does not necessarily attains its
minimum at a steady state). It is shown that the proposed technique provides,
in general, a larger feasibility set with respect to existing approaches, given
the same computational complexity. Moreover, a new receding horizon strategy is
introduced, exploiting the generalized terminal state constraint. Under mild
assumptions, the new strategy is guaranteed to converge in finite time, with
arbitrarily good accuracy, to an MPC law with an optimally-chosen terminal
state constraint, while still enjoying a larger feasibility set. The features
of the new technique are illustrated by three examples.Comment: Part of the material in this manuscript is contained in a paper
accepted for publication on Automatica and it is subject to Elsevier
copyright. The copy of record is available on http://www.sciencedirect.com
Approximate non-linear model predictive control with safety-augmented neural networks
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 on
three non-linear MPC benchmarks of different complexity, demonstrating
computational speedups orders of magnitudes higher than online optimization. In
the examples, we achieve deterministic safety through the safety-augmented NNs,
where naive NN implementation fails
- …