activity
20132026
most citedProbabilistic performance validation of deep learning-based robust NMPC controllers

55 citations · 181 across the 25 of their papers we have counts for

collaborators
Showing 2021Show all

6 papers · 1 filter

math.ST2021

Prediction error quantification through probabilistic scaling -- EXTENDED VERSION

Victor Mirasierra, Martina Mammarella, Fabrizio Dabbene +1

In this paper, we address the probabilistic error quantification of a general class of prediction methods. We consider a given prediction model and show how to obtain, through a sa…

math.OC2021★ 12 cited

A sparse ADMM-based solver for linear MPC subject to terminal quadratic constraint

Pablo Krupa, Rim Jaouani, Daniel Limon +1

Model Predictive Control (MPC) typically includes a terminal constraint to guarantee stability of the closed-loop system under nominal conditions. In linear MPC this constraint is…

eess.SY2021★ 3 cited

Tractable robust MPC design based on nominal predictions

Ignacio Alvarado, Pablo Krupa, Daniel Limon +1

Many popular approaches in the field of robust model predictive control (MPC) are based on nominal predictions. This paper presents a novel formulation of this class of controller…

eess.SY2021

Real-time implementation of MPC for tracking in embedded systems: Application to a two-wheeled inverted pendulum

Pablo Krupa, Jose Camara, Ignacio Alvarado +2

This article presents the real-time implementation of the model predictive control for tracking formulation to control a two-wheeled inverted pendulum robot. This formulation offer…

math.OC2021★ 5 cited

Restart of accelerated first order methods with linear convergence under a quadratic functional growth condition

Teodoro Alamo, Pablo Krupa, Daniel Limon

Accelerated first order methods, also called fast gradient methods, are popular optimization methods in the field of convex optimization. However, they are prone to suffer from osc…

eess.SY2021★ 4 cited

Chance constrained sets approximation: A probabilistic scaling approach -- EXTENDED VERSION

Martina Mammarella, Victor Mirasierra, Matthias Lorenzen +2

In this paper, a sample-based procedure for obtaining simple and computable approximations of chance-constrained sets is proposed. The procedure allows to control the complexity of…