In April 2016 Manchester eScholar was replaced by the University of Manchester’s new Research Information Management System, Pure. In the autumn the University’s research outputs will be available to search and browse via a new Research Portal. Until then the University’s full publication record can be accessed via a temporary portal and the old eScholar content is available to search and browse via this archive.

Hamiltonian Decomposition for Online Implementation of Model Predictive Control

Navarro Poupard, Eduardo

[Thesis]. Manchester, UK: The University of Manchester; 2019.

Access to files

Abstract

Reliable and optimal decision-making tools are essential in industry to achieve high performance. One of these tools is Model Predictive Control (MPC), which is an advanced control technique that generates an action that affects the controlled variables of a given process with respect to a performance criteria, while satisfying the process' physical and operational restrictions. At the core of the MPC algorithm lies an optimization problem that is solved by a numerical method at every sample time. New demand for more self-contained and autonomous modular processes has seen MPC embedded in small-scale platforms, such as Programmable Logic Controllers (PLCs). This has prompted a need for custom-made numerical methods that help to efficiently run the computationally demanding optimization algorithms. In this thesis, we design effective optimization solvers for PLCs by proposing several approaches that factorize the Newton system of the interior-point method (IPM). These approaches are based on the two-point boundary-value (TPBV) problem structure, rarely explored in MPC, called the Hamiltonian system. One of the main proposals is that, once the augmented system is in the Hamiltonian form, it can be reduced to an incomplete LU factorization in which two possible options are available to compute the solution of the system: (i) A direct method called the Hamiltonian recursion method, and (ii) an iterative method called the Hamiltonian/GMRES method. Regarding the former, a forward substitution of a sequence of matrices is carried out, whereas with the latter, a Krylov method is used. We prove that the convergence of the iterative method is bounded and its rate is quantified. Numerical experiments demonstrate that both methods are feasible and efficient compared to the state-of-the-art methods.

Bibliographic metadata

Type of resource:
Content type:
Form of thesis:
Type of submission:
Degree type:
Doctor of Philosophy
Degree programme:
PhD Electrical and Electronic Engineering
Publication date:
Location:
Manchester, UK
Total pages:
175
Abstract:
Reliable and optimal decision-making tools are essential in industry to achieve high performance. One of these tools is Model Predictive Control (MPC), which is an advanced control technique that generates an action that affects the controlled variables of a given process with respect to a performance criteria, while satisfying the process' physical and operational restrictions. At the core of the MPC algorithm lies an optimization problem that is solved by a numerical method at every sample time. New demand for more self-contained and autonomous modular processes has seen MPC embedded in small-scale platforms, such as Programmable Logic Controllers (PLCs). This has prompted a need for custom-made numerical methods that help to efficiently run the computationally demanding optimization algorithms. In this thesis, we design effective optimization solvers for PLCs by proposing several approaches that factorize the Newton system of the interior-point method (IPM). These approaches are based on the two-point boundary-value (TPBV) problem structure, rarely explored in MPC, called the Hamiltonian system. One of the main proposals is that, once the augmented system is in the Hamiltonian form, it can be reduced to an incomplete LU factorization in which two possible options are available to compute the solution of the system: (i) A direct method called the Hamiltonian recursion method, and (ii) an iterative method called the Hamiltonian/GMRES method. Regarding the former, a forward substitution of a sequence of matrices is carried out, whereas with the latter, a Krylov method is used. We prove that the convergence of the iterative method is bounded and its rate is quantified. Numerical experiments demonstrate that both methods are feasible and efficient compared to the state-of-the-art methods.
Thesis main supervisor(s):
Thesis co-supervisor(s):
Language:
en

Record metadata

Manchester eScholar ID:
uk-ac-man-scw:319338
Created by:
Navarro Poupard, Eduardo
Created:
28th April, 2019, 18:26:00
Last modified by:
Navarro Poupard, Eduardo
Last modified:
1st May, 2020, 11:33:19

Can we help?

The library chat service will be available from 11am-3pm Monday to Friday (excluding Bank Holidays). You can also email your enquiry to us.