Abstract

In this paper, we consider a class of optimal control problems involving continuous inequality state constraints. This class of optimal control problems can be solved using the technique developed in a paper by Goh and Teo, where a simple constraint transcription is used to convert continuous inequality state constraints into equivalent equality terminal state constraints. However, that constraint transcription has the disadvantage that the equality terminal state constraints so obtained do not satisfy the usual constraint qualification. Thus, convergence is not guaranteed and some oscillation may exist in numerical computation. The aim of this paper is to use a new constraint transcription together with the concept of control parametrization to devise a new computational algorithm for solving this general class of constrained optimal control problems. This new algorithm is much more stable numerically, as we have successfully overcome the above-mentioned disadvantages.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.