Jurre Hanema

Jurre Hanema

Auto-generated profile, based on publicly available information

Jurre Hanema

Control Systems Group Department of Electrical Engineering Eindhoven University of Technology The Netherlands

Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2020 in Automatica
Verified
Journal Article
Closed access
JHJurre Hanema
Jurre Hanema
MLMircea Lazar
Mircea Lazar
RTRoland Tóth
Roland Tóth

1 November 2017 in Automatica
Verified
Journal Article
Closed access
JHJurre Hanema
Jurre Hanema
MLMircea Lazar
Mircea Lazar
RTRoland Tóth
Roland Tóth

12 April 2016 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
HAHossam S. Abbas
Hossam S. Abbas
RTRoland Toth
Roland Toth
NMNader Meskin
Nader Meskin
JMJavad Mohammadpour
Javad Mohammadpour
JHJurre Hanema
Jurre Hanema
In this note, a discrete-time robust model predictive control (MPC) design approach is proposed to control systems described by linear parameter-varying models in input-output form subject to constraints. To ensure the stability of the closed-loop system, a quadratic terminal cost along with an ellipsoidal terminal constraint are included in the control optimization problem. The MPC design problem is formulated as a linear matrix inequality problem. The proposed MPC scheme is applied on a continuously stirred tank reactor as an illustrative example.

25 August 2017 in International Journal of Robust and Nonlinear Control
Verified
Journal Article
Closed access
PDF file
HAHossam S. ABBAS
Hossam S. ABBAS
JHJ. Hanema
J. Hanema
RTRoland Toth
Roland Toth
JMJ. Mohammadpour
J. Mohammadpour
NMNader Meskin
Nader Meskin

1 December 2016
Verified
Conference Paper
Closed access
JHJurre Hanema
Jurre Hanema
RTRoland Toth
Roland Toth
MLMircea Lazar
Mircea Lazar
Currently available model predictive control methods for linear parameter-varying systems assume that the future behavior of the scheduling trajectory is unknown over the prediction horizon. In this paper, an anticipative tube MPC algorithm for polytopic linear parameter-varying systems under full state feedback is developed. In contrast to existing approaches, the method explicitly takes into account expected future variations in the scheduling variable: its current value is measured exactly, while the future values over the prediction horizon are assumed to belong to a sequence of sets describing expected deviations from a nominal trajectory. Through this mechanism, the controller “anticipates” upon future changes in the system dynamics. The algorithm constructs a tube homothetic to a terminal set and employs gain scheduled vertex control laws. A worst-case cost is minimized: the corresponding optimization problem is a single linear program with complexity linear in the prediction horizon. Numerical examples show the validity of the approach.

30 March 2021 in IET Control Theory & Applications
Verified
Journal Article
Open access
PDF file
JHJurre Hanema
Jurre Hanema
RTRoland Toth
Roland Toth
MLMircea Lazar
Mircea Lazar
This paper proposes a model predictive control (MPC) approach for non‐linear systems where the non‐linear dynamics are embedded inside a linear parameter‐varying (LPV) representation. The non‐linear MPC problem is therefore replaced by an LPV MPC problem, without using linearization. Compared to general non‐linear MPC, advantages of this approach are that it allows for the tractable construction of a terminal set and cost, and that only a single convex program must be solved online. The key idea that enables proving recursive feasibility and stability, is to restrict the state evolution of the non‐linear system to a time‐varying sequence of state constraint sets. Because in LPV embeddings, there exists a relationship between the scheduling and state variables, these state constraints are used to construct a corresponding future scheduling tube. Compared to non‐time‐varying state constraints, tighter bounds on the future scheduling trajectories are obtained. Computing a scheduling tube in this setting requires applying a non‐linear function to the sequence of constraint sets. Outer approximations of this non‐linear projection‐based scheduling tube can be found, e.g., via interval analysis. The computational properties of the approach are demonstrated on numerical examples.