Show simple item record

dc.contributor.authorWang, Y.
dc.contributor.authorYu, C.
dc.contributor.authorTeo, Kok Lay
dc.date.accessioned2018-02-06T06:17:43Z
dc.date.available2018-02-06T06:17:43Z
dc.date.created2018-02-06T05:49:53Z
dc.date.issued2016
dc.identifier.citationWang, Y. and Yu, C. and Teo, K.L. 2016. A new computational strategy for optimal control problem with a cost on changing control. Numerical Algebra, Control and Optimization. 6 (3): pp. 339-364.
dc.identifier.urihttp://hdl.handle.net/20.500.11937/63536
dc.identifier.doi10.3934/naco.2016016
dc.description.abstract

© 2016 American Institute of Mathematical Sciences. All rights reserved.In this paper, we consider a class of optimal control problems where the cost function is the sum of the terminal cost, the integral cost and the full variation of control. Here, the full variation of a control is defined as the sum of the total variations of its components. By using the control parameterization technique in conjunction with the time scaling transformation, we develop a new computational algorithm for solving this type of optimal control problem. Rigorous convergence analysis is provided for the new method. For illustration, we solve two numerical examples to show the effectiveness of the proposed method.

dc.publisherAmerican Institute of Mathematical Sciences
dc.titleA new computational strategy for optimal control problem with a cost on changing control
dc.typeJournal Article
dcterms.source.volume6
dcterms.source.number3
dcterms.source.startPage339
dcterms.source.endPage364
dcterms.source.issn2155-3289
dcterms.source.titleNumerical Algebra, Control and Optimization
curtin.departmentDepartment of Mathematics and Statistics
curtin.accessStatusOpen access via publisher


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record