File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1016/j.automatica.2022.110553
- Scopus: eid_2-s2.0-85138783094
- WOS: WOS:000890961200006
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: Log–log convexity of an optimal control problem for positive linear systems
Title | Log–log convexity of an optimal control problem for positive linear systems |
---|---|
Authors | |
Keywords | Geometric programming Log–log convexity Optimal control Positive systems |
Issue Date | 2022 |
Citation | Automatica, 2022, v. 146, article no. 110553 How to Cite? |
Abstract | This 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 Identifier | http://hdl.handle.net/10722/328000 |
ISSN | 2023 Impact Factor: 4.8 2023 SCImago Journal Rankings: 3.502 |
ISI Accession Number ID |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Zhu, Bohao | - |
dc.contributor.author | Lam, James | - |
dc.contributor.author | Ogura, Masaki | - |
dc.date.accessioned | 2023-06-05T06:53:14Z | - |
dc.date.available | 2023-06-05T06:53:14Z | - |
dc.date.issued | 2022 | - |
dc.identifier.citation | Automatica, 2022, v. 146, article no. 110553 | - |
dc.identifier.issn | 0005-1098 | - |
dc.identifier.uri | http://hdl.handle.net/10722/328000 | - |
dc.description.abstract | This 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.language | eng | - |
dc.relation.ispartof | Automatica | - |
dc.subject | Geometric programming | - |
dc.subject | Log–log convexity | - |
dc.subject | Optimal control | - |
dc.subject | Positive systems | - |
dc.title | Log–log convexity of an optimal control problem for positive linear systems | - |
dc.type | Article | - |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1016/j.automatica.2022.110553 | - |
dc.identifier.scopus | eid_2-s2.0-85138783094 | - |
dc.identifier.volume | 146 | - |
dc.identifier.spage | article no. 110553 | - |
dc.identifier.epage | article no. 110553 | - |
dc.identifier.isi | WOS:000890961200006 | - |