Developing insight into the optimization element in a nonlinear model predictive control context

Optimization is one of the fundamental components in Model Predictive Control (MPC) and Non-linear Model Predictive Control (NMPC). In NMPC the optimization problem that is to be solved can be non-convex which is a challenging problem to solve. Having insight into the optimiza-tion component of the...

Full description

Bibliographic Details
Main Author: Dhoodhat, Zaheer
Format: Others
Language:en
Published: 2014
Online Access:http://hdl.handle.net/10539/15377
id ndltd-netd.ac.za-oai-union.ndltd.org-wits-oai-wiredspace.wits.ac.za-10539-15377
record_format oai_dc
spelling ndltd-netd.ac.za-oai-union.ndltd.org-wits-oai-wiredspace.wits.ac.za-10539-153772019-05-11T03:40:57Z Developing insight into the optimization element in a nonlinear model predictive control context Dhoodhat, Zaheer Optimization is one of the fundamental components in Model Predictive Control (MPC) and Non-linear Model Predictive Control (NMPC). In NMPC the optimization problem that is to be solved can be non-convex which is a challenging problem to solve. Having insight into the optimiza-tion component of the NMPC algorithm will o er value to the control engineers designing and using NMPC controlled systems. This study presents an approach, referred to as the Optimization Roadmap, that graphically provides insight or transparency into the optimization element within NMPC. The methodology was applied to several examples to ratify the insights gained. Two opti-mization algorithms, the gradient based Sequential Quadratic Programming (SQP) algorithm and the meta-heuristic Particle Swarm Optimization (PSO), were employed within the NMPC algo-rithm and their characteristics contrasted. The application of the methodology to the examples revealed that the Optimization Roadmap provides useful insights into the optimization problem to the user. These insights include the convexity or non-convexity of the problem and additionally regions of local minima, if present. The Optimization Roadmap additionally provides insights into areas in which initial conditions, for local optimization methods, could be chosen for the best re-sults. Furthermore, the results show that the local optimization algorithm, SQP, performs much faster than the PSO algorithm. More importantly, by using the Optimization Roadmap to select favourable initial conditions for the SQP algorithm led to it producing results in the vicinity of, if not equal to, those obtained by the PSO algorithm. 2014-09-03T11:45:15Z 2014-09-03T11:45:15Z 2014-09-03 Thesis http://hdl.handle.net/10539/15377 en application/pdf application/pdf
collection NDLTD
language en
format Others
sources NDLTD
description Optimization is one of the fundamental components in Model Predictive Control (MPC) and Non-linear Model Predictive Control (NMPC). In NMPC the optimization problem that is to be solved can be non-convex which is a challenging problem to solve. Having insight into the optimiza-tion component of the NMPC algorithm will o er value to the control engineers designing and using NMPC controlled systems. This study presents an approach, referred to as the Optimization Roadmap, that graphically provides insight or transparency into the optimization element within NMPC. The methodology was applied to several examples to ratify the insights gained. Two opti-mization algorithms, the gradient based Sequential Quadratic Programming (SQP) algorithm and the meta-heuristic Particle Swarm Optimization (PSO), were employed within the NMPC algo-rithm and their characteristics contrasted. The application of the methodology to the examples revealed that the Optimization Roadmap provides useful insights into the optimization problem to the user. These insights include the convexity or non-convexity of the problem and additionally regions of local minima, if present. The Optimization Roadmap additionally provides insights into areas in which initial conditions, for local optimization methods, could be chosen for the best re-sults. Furthermore, the results show that the local optimization algorithm, SQP, performs much faster than the PSO algorithm. More importantly, by using the Optimization Roadmap to select favourable initial conditions for the SQP algorithm led to it producing results in the vicinity of, if not equal to, those obtained by the PSO algorithm.
author Dhoodhat, Zaheer
spellingShingle Dhoodhat, Zaheer
Developing insight into the optimization element in a nonlinear model predictive control context
author_facet Dhoodhat, Zaheer
author_sort Dhoodhat, Zaheer
title Developing insight into the optimization element in a nonlinear model predictive control context
title_short Developing insight into the optimization element in a nonlinear model predictive control context
title_full Developing insight into the optimization element in a nonlinear model predictive control context
title_fullStr Developing insight into the optimization element in a nonlinear model predictive control context
title_full_unstemmed Developing insight into the optimization element in a nonlinear model predictive control context
title_sort developing insight into the optimization element in a nonlinear model predictive control context
publishDate 2014
url http://hdl.handle.net/10539/15377
work_keys_str_mv AT dhoodhatzaheer developinginsightintotheoptimizationelementinanonlinearmodelpredictivecontrolcontext
_version_ 1719082601774317568