Thomas Neve
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Thomas Neve has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Tom Lefebvre
Ghent University
3 shared publications Guillaume Crevecoeur
D2Lab Research Group, Department of Electromechanical, Systems and Metal Engineering Ghent University Zwijnaarde Belgium
2 shared publications- Guillaume Crevecoeur
Ghent University
2 shared publications - Babak Mehdizadeh Gavgani
Department of Electromechanical, Systems & Metal Engineering, Ghent University, Kortrijk, Belgium
1 shared publication - Daan P. K. Truijen
Department of Electromechanical, Systems & Metal Engineering, Ghent University, Kortrijk, Belgium
1 shared publication - Jeroen D. M. De Kooning
Ghent University
1 shared publication
Latest Publications
- 1 December 2025
- Published by Wiley in Optimal Control Applications and Methods
- Vol. 47 (1) , 254-274
Nonlinear Model Predictive Control With Value Function Regression: A Tessellation‐Based Sampling Approach
Advanced model‐based control strategies, such as Model Predictive Control (MPC), offer powerful solutions for managing complex dynamical systems. Despite its benefits, MPC faces significant computational challenges, particularly when applied to systems with fast dynamics and stringent real‐time constraints. To address these challenges, we leverage offline‐generated value function data to enhance real‐time MPC performance. The main parameter affecting the computational demand of MPC is the length of the prediction horizon. This work aims to reduce the length of the prediction horizon of a model predictive controller (MPC) to reduce computation time while maintaining optimality guarantees. To this end, we propose to approximate the trajectory optimization problem for MPC by learning a finite‐horizon value function. This approximated value function is then integrated into a truncated trajectory optimization problem, allowing the MPC to operate with a shorter prediction horizon and thus, ideally, lower computational demands. To manage the costly creation of the value function dataset, we propose a novel tessellation sampling strategy that directs attention to the important regions of the state space. Through this sampling strategy, we show that an effective and robust value function surrogate can be built, resulting in an accurate approximate MPC. The methodology is then validated experimentally on a Furuta pendulum, where it demonstrates the potential for real‐time MPC through learning methodologies. Here, we extend to a multi‐goal problem formulation. By leveraging the model properties of the Furuta system, we can avoid retraining the value function for multiple goals by applying an affine transformation to the value function domain.
- 1 December 2025
- Published by Wiley in Optimal Control Applications and Methods
- Vol. 47 (1) , 254-274
Nonlinear Model Predictive Control With Value Function Regression: A Tessellation‐Based Sampling Approach
Advanced model‐based control strategies, such as Model Predictive Control (MPC), offer powerful solutions for managing complex dynamical systems. Despite its benefits, MPC faces significant computational challenges, particularly when applied to systems with fast dynamics and stringent real‐time constraints. To address these challenges, we leverage offline‐generated value function data to enhance real‐time MPC performance. The main parameter affecting the computational demand of MPC is the length of the prediction horizon. This work aims to reduce the length of the prediction horizon of a model predictive controller (MPC) to reduce computation time while maintaining optimality guarantees. To this end, we propose to approximate the trajectory optimization problem for MPC by learning a finite‐horizon value function. This approximated value function is then integrated into a truncated trajectory optimization problem, allowing the MPC to operate with a shorter prediction horizon and thus, ideally, lower computational demands. To manage the costly creation of the value function dataset, we propose a novel tessellation sampling strategy that directs attention to the important regions of the state space. Through this sampling strategy, we show that an effective and robust value function surrogate can be built, resulting in an accurate approximate MPC. The methodology is then validated experimentally on a Furuta pendulum, where it demonstrates the potential for real‐time MPC through learning methodologies. Here, we extend to a multi‐goal problem formulation. By leveraging the model properties of the Furuta system, we can avoid retraining the value function for multiple goals by applying an affine transformation to the value function domain.
- Open Access
- 28 October 2024
- Published by Wiley in Optimal Control Applications and Methods
- Vol. 46 (2) , 709-725
Fast Nonlinear Model Predictive Control Combining Online Trajectory Optimization and Value Function Regression
Model predictive control (MPC) is a well‐developed method capable of handling complex control tasks. Implementation of an MPC requires solution of a deterministic finite horizon nonlinear optimal control (OC) problem. OC problems can be solved globally, explicitly expressing the optimal policy (and value function) as a function of the present state, or, locally, using online trajectory optimization, generating a solution that is only valid for the present state. For nonlinear problems however, neither is possible analytically, and the latter, finding a local solution online, is usually preferred. The difficulty with online trajectory optimization is that the solution must be available within a single sampling period. The main parameter affecting the computational demand of MPC is the length of the prediction horizon. The goal in this work is to reduce the length of the prediction horizon of a model predictive controller (MPC) to reduce computation time whilst preserving optimality guarantees. To this end, we propose approximation of the trajectory optimization problem for MPC by learning a finite horizon value function. The approximated value function is inserted into a truncated trajectory optimization problem so that the MPC can be attained with a reduced prediction horizon, ergo reduced computational load. By sampling the value function in a goal oriented way, we show that an effective approximate value function can be found by including both the function value and the gradients of the value function. The result is an accurate approximate MPC which leverages learning methodologies to reduce computational cost while still accounting for constraints.
- 28 October 2024
- Published by Wiley in Optimal Control Applications and Methods
- Vol. 46 (2) , 709-725
Open AccessFast Nonlinear Model Predictive Control Combining Online Trajectory Optimization and Value Function Regression
Model predictive control (MPC) is a well‐developed method capable of handling complex control tasks. Implementation of an MPC requires solution of a deterministic finite horizon nonlinear optimal control (OC) problem. OC problems can be solved globally, explicitly expressing the optimal policy (and value function) as a function of the present state, or, locally, using online trajectory optimization, generating a solution that is only valid for the present state. For nonlinear problems however, neither is possible analytically, and the latter, finding a local solution online, is usually preferred. The difficulty with online trajectory optimization is that the solution must be available within a single sampling period. The main parameter affecting the computational demand of MPC is the length of the prediction horizon. The goal in this work is to reduce the length of the prediction horizon of a model predictive controller (MPC) to reduce computation time whilst preserving optimality guarantees. To this end, we propose approximation of the trajectory optimization problem for MPC by learning a finite horizon value function. The approximated value function is inserted into a truncated trajectory optimization problem so that the MPC can be attained with a reduced prediction horizon, ergo reduced computational load. By sampling the value function in a goal oriented way, we show that an effective approximate value function can be found by including both the function value and the gradients of the value function. The result is an accurate approximate MPC which leverages learning methodologies to reduce computational cost while still accounting for constraints.
- 26 April 2023
- Published by ASME International in Journal of Dynamic Systems, Measurement, and Control
- Vol. 145 (6) , 1-14
Differential Flatness of Slider–Pusher Systems for Constrained Time Optimal Collision Free Path Planning
In this work, we show that the differential kinematics of slider–pusher systems are differentially flat assuming quasi-static behavior and frictionless contact. Second, we demonstrate that the state trajectories are invariant to time-differential transformations of the path parametrizing coordinate. For one this property allows to impose arbitrary velocity profiles on the slider without impacting the geometry of the state trajectory. This property implies that certain path planning problems may be decomposed approximately into a strictly geometric path planning and an auxiliary throughput speed optimization problem. Building on these insights, we elaborate a numerical approach tailored to constrained time optimal collision free path planning and apply it to the slider–pusher system.
- 26 April 2023
- Published by ASME International in Journal of Dynamic Systems, Measurement, and Control
- Vol. 145 (6) , 1-14
Differential Flatness of Slider–Pusher Systems for Constrained Time Optimal Collision Free Path Planning
In this work, we show that the differential kinematics of slider–pusher systems are differentially flat assuming quasi-static behavior and frictionless contact. Second, we demonstrate that the state trajectories are invariant to time-differential transformations of the path parametrizing coordinate. For one this property allows to impose arbitrary velocity profiles on the slider without impacting the geometry of the state trajectory. This property implies that certain path planning problems may be decomposed approximately into a strictly geometric path planning and an auxiliary throughput speed optimization problem. Building on these insights, we elaborate a numerical approach tailored to constrained time optimal collision free path planning and apply it to the slider–pusher system.
- Open Access
Flatness-based MPC using B-splines transcription with application to a Pusher-Slider System
This work discusses the use of model predictive control (MPC) for the manipulation of a pusher-slider system. In particular we leverage the differential flatness of the pusher-slider in combination with a B-splines transcription to address the computational demand that is typically associated to real-time implementation of an MPC controller. We demonstrate the flatness based B-spline MPC controller in simulation and compare it to a standard MPC implementation approach using direct multiple shooting. We evaluate the computational advantage of the flatness based MPC empirically and document computational acceleration up to 65%.
Open AccessFlatness-based MPC using B-splines transcription with application to a Pusher-Slider System
This work discusses the use of model predictive control (MPC) for the manipulation of a pusher-slider system. In particular we leverage the differential flatness of the pusher-slider in combination with a B-splines transcription to address the computational demand that is typically associated to real-time implementation of an MPC controller. We demonstrate the flatness based B-spline MPC controller in simulation and compare it to a standard MPC implementation approach using direct multiple shooting. We evaluate the computational advantage of the flatness based MPC empirically and document computational acceleration up to 65%.