On the Design of Terminal Ingredients in Periodic Model Predictive Path‐Following

ABSTRACT Establishing recursive feasibility and convergence for nonlinear model predictive path‐following control (MPPFC) is a non‐trivial task, particularly when following periodic reference paths. We propose a procedure for the design of terminal ingredients in MPPFC for constrained nonlinear systems. In MPPFC, the system is augmented by a progress dynamics and a virtual control input, the progress velocity , which serves as an additional decision variable in the optimization problem. Unlike standard time‐based tracking MPC, this allows the controller to optimize the timing law itself. Based on a periodic path in the state space and a corresponding nominal timing law, we construct a periodically time‐varying quadratic terminal cost and an associated ellipsoidal terminal region by linearizing the dynamics along the nominal trajectory and solving a periodic Riccati differential equation. By reparameterizing these time‐dependent ingredients with respect to the progress variable, we obtain a progress‐varying terminal cost and terminal region suitable for path‐following. Furthermore, we prove that the resulting scheme is recursively feasible, guarantees convergence of the error to zero, and ensures convergence of the progress velocity to its nominal reference. The applicability of the approach is demonstrated on a 2D nonlinear system.

Authors

Institutions

Publication Details

Journal
PAMM
Published
2026-09-21
DOI
https://doi.org/10.1002/pamm.70218
Primary Topic
Advanced Control Systems Optimization
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
article

On the Design of Terminal Ingredients in Periodic Model Predictive Path‐Following

Andrea Carron, Julian Berberich, Melanie Zeilinger, Mohamed Abou‐Taleb
PAMM
Advanced Control Systems Optimization
article

On the Design of Terminal Ingredients in Periodic Model Predictive Path‐Following

Andrea Carron, Julian Berberich, Melanie Zeilinger, Mohamed Abou‐Taleb
article en

Abstract

ABSTRACT Establishing recursive feasibility and convergence for nonlinear model predictive path‐following control (MPPFC) is a non‐trivial task, particularly when following periodic reference paths. We propose a procedure for the design of terminal ingredients in MPPFC for constrained nonlinear systems. In MPPFC, the system is augmented by a progress dynamics and a virtual control input, the progress velocity , which serves as an additional decision variable in the optimization problem. Unlike standard time‐based tracking MPC, this allows the controller to optimize the timing law itself. Based on a periodic path in the state space and a corresponding nominal timing law, we construct a periodically time‐varying quadratic terminal cost and an associated ellipsoidal terminal region by linearizing the dynamics along the nominal trajectory and solving a periodic Riccati differential equation. By reparameterizing these time‐dependent ingredients with respect to the progress variable, we obtain a progress‐varying terminal cost and terminal region suitable for path‐following. Furthermore, we prove that the resulting scheme is recursively feasible, guarantees convergence of the error to zero, and ensures convergence of the progress velocity to its nominal reference. The applicability of the approach is demonstrated on a 2D nonlinear system.

PAMMVol. 26(4)
University of Stuttgart (DE), Institute for Biomedical Engineering (CH)
Peace, Justice and strong institutions
Openalex Percentile: Top 15%
Advanced Control Systems Optimization
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.