Abstract
In this article, optimal control of bilinear positive systems with uncertain evolutionary dynamics is studied. The first objective is to determine optimal control signals such that the effect of the disturbance signals on the outputs of the nominal dynamics is minimized in terms of the <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$\mathcal{H}_2$</tex-math> </inline-formula> norm performance index. Properties of the positive systems, Metzler matrices, and the exploitable structure of the problem are utilized to show that the underlying problem is representable as a standard convex optimization problem. Next, the optimal strategy is examined in the presence of polytopic uncertainties. In this case, the optimization problem is a semi-infinite min-max problem. It is shown that under some assumptions, the underlying problem is equivalent to a finite min-max problem, i.e., it suffices to check only the vertices of the polytopic set for <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$\mathcal{H}_2$</tex-math> </inline-formula> norm minimization. The proposed approach for polytopic bilinear positive systems is non-iterative, does not involve parameter tuning or nonsmooth optimization algorithms, and can be solved using off-the-shelf solvers. The effectiveness of the proposed approach is investigated for the optimal combination therapy of human immunodeficiency virus (HIV).
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.