File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Log–log convexity of an optimal control problem for positive linear systems

TitleLog–log convexity of an optimal control problem for positive linear systems
Authors
KeywordsGeometric programming
Log–log convexity
Optimal control
Positive systems
Issue Date2022
Citation
Automatica, 2022, v. 146, article no. 110553 How to Cite?
AbstractThis paper investigates the finite-time optimal control problems for positive linear systems with a time-varying control input. Cost functional of the system state is constructed. Under some assumptions on the designed parameters and cost functionals, the optimization problem with piecewise-constant matrix functions is first proved to be log–log convex and can be solved via geometric programming. Then, the log–log convex result is further extended to the optimization problem with continuous functions. Finally, an optimal control problem is investigated to verify the effectiveness of the proposed optimization framework.
Persistent Identifierhttp://hdl.handle.net/10722/328000
ISSN
2023 Impact Factor: 4.8
2023 SCImago Journal Rankings: 3.502
ISI Accession Number ID

 

DC FieldValueLanguage
dc.contributor.authorZhu, Bohao-
dc.contributor.authorLam, James-
dc.contributor.authorOgura, Masaki-
dc.date.accessioned2023-06-05T06:53:14Z-
dc.date.available2023-06-05T06:53:14Z-
dc.date.issued2022-
dc.identifier.citationAutomatica, 2022, v. 146, article no. 110553-
dc.identifier.issn0005-1098-
dc.identifier.urihttp://hdl.handle.net/10722/328000-
dc.description.abstractThis paper investigates the finite-time optimal control problems for positive linear systems with a time-varying control input. Cost functional of the system state is constructed. Under some assumptions on the designed parameters and cost functionals, the optimization problem with piecewise-constant matrix functions is first proved to be log–log convex and can be solved via geometric programming. Then, the log–log convex result is further extended to the optimization problem with continuous functions. Finally, an optimal control problem is investigated to verify the effectiveness of the proposed optimization framework.-
dc.languageeng-
dc.relation.ispartofAutomatica-
dc.subjectGeometric programming-
dc.subjectLog–log convexity-
dc.subjectOptimal control-
dc.subjectPositive systems-
dc.titleLog–log convexity of an optimal control problem for positive linear systems-
dc.typeArticle-
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1016/j.automatica.2022.110553-
dc.identifier.scopuseid_2-s2.0-85138783094-
dc.identifier.volume146-
dc.identifier.spagearticle no. 110553-
dc.identifier.epagearticle no. 110553-
dc.identifier.isiWOS:000890961200006-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats