06 August 2019
Austempered Ductile Iron Production Technology From Base Material Produced By Ferro-Casting Industry In Indonesia
Rianti Dewi Wulansari Sulamet Ariobimo, 2003 University of Queensland Abstract The quality of... Read More
The Australia Awards are prestigious, transformational scholarships and short courses offered to emerging leaders for study, research and professional development in Australia
13 Mar 2016
Hartono, July 2012
The University of Western Australia
Abstract
In this thesis we consider numerical methods for solving state-constrained optimal control problems. There are two main focii in the research, i.e. state-constrained optimal open-loop and feedback control problems. For all cases, we reformulate the constrained optimal control problem to the unconstrained problem through a penalty method. The state-constraints which we discuss here are only in the form of inequalities but for both purely state-constraint and control-state constraint types.
For solving state-constrained optimal open-loop control problems, we establish a power penalty method and analyze its convergence. This method is then implemented in MISER 3.3 to do some numerical tests. The results conrm that the method work very well. Furthermore, we use the power penalty method to discuss a sensitivity analysis.
On the other hand, for solving state-constrained optimal feedback control problems we construct a new numerical algorithm. The algorithm based on upwind nite dierence scheme is iterated in order to increase the accuracy and speed of computation. In particular, to address the curse of dimensionality, a special method for generating grid points in the domain is developed. Numerical experiment shows that the computational speed increases significantly with this modied method. Moreover, for further improvement in the accuracy the algorithm can be combined with Richardson extrapolation method.
Share this article on:
This website uses cookies to improve your website experience. We may also use cookies to analyse website data so that we can improve our online services. To find out more visit our privacy policy.